📄 project turbo code -- research papers.htm
字号:
<DT><A name=jung96><STRONG>28</STRONG></A>
<DD>P. Jung, "Comparison of turbo-code decoders applied to short frame
transmission system," <EM>IEEE J. Select. Areas Commun.</EM>, vol. 14,
pp. 530-7, Apr. 1996.
<DT><A name=lin97a><STRONG>29</STRONG></A>
<DD>L. Lin and R.S. Cheng, "Improvements in SOVA-based decoding for turbo
codes," in <EM>Proc., IEEE Int. Conf. on Commun.</EM>, 1997.
<DT><A name=lin97b><STRONG>30</STRONG></A>
<DD>X. Lin, J.L. Massey, T. Mittelholzer, and R. Rimoldi,
"Hard-decision-aided turbo decoding," in <EM>Proc., Int. Symp. on Turbo Codes
and Related Topics</EM>, (Brest, France), pp. 235-8, Sept. 1997.
<DT><A name=lodge92><STRONG>31</STRONG></A>
<DD>J.H. Lodge, P. Hoeher, and J. Hagenauer, "The decoding of multidimensional
codes using separable MAP filtering," in <EM>Proc., 16th Biennial Symp. on
Commun.</EM>, pp. 343-6, 1992.
<DT><A name=lodge93><STRONG>32</STRONG></A>
<DD>J.H. Lodge, R.J. Young, P. Hoeher, and J. Hagenauer, "Separable MAP
"filters" for the decoding of product and concatenated codes," in <EM>Proc.,
IEEE Int. Conf. on Commun.</EM>, pp. 1740-5, 1993.
<DT><A name=mackay98><STRONG>33</STRONG></A>
<DD>D.J.C. MacKay, R.J. McEliece, and J.-F. Cheng, "Turbo decoding as an
instance of Pearl's 'belief propagation' algorithm," <EM>IEEE J. Select. Areas
Commun.</EM>, vol. 15, Jan. 1998. to appear.
<DT><A name=mceli95><STRONG>34</STRONG></A>
<DD>R.J. McEliece, E.R. Rodemich, and J.-F. Cheng, "The turbo decision
algorithm," in <EM>Proc., Allerton Conf. on Commun., Control, and
Computing</EM>, pp. 366-79, Univ. Illinois; Urbana-Champaign, IL, USA,
1995.
<DT><A name=moher93><STRONG>35</STRONG></A>
<DD>M.L. Moher, "Decoding via cross-entropy minimization," in <EM>Proc., IEEE
GLOBECOM</EM>, (Houston, USA), pp. 809-13, Nov. 1993.
<DT><A name=moher97b><STRONG>36</STRONG></A>
<DD>M.L. Moher, <EM>Cross-entropy and iterative decoding</EM>. PhD thesis,
Carleton University, Ottawa, Canada, May 1997. Dept. of Sys. and Comp. Eng.
<DT><A name=papke96><STRONG>37</STRONG></A>
<DD>L. Papke, P. Robertson, and E. Villebrun, "Improved decoding with the SOVA
in a parallel concatenated (turbo-code) scheme," in <EM>Proc., IEEE Int. Conf.
on Commun.</EM>, pp. 102-6, 1996.
<DT><A name=perez96><STRONG>38</STRONG></A>
<DD>L.C. Perez, J. Seghers, and D.J. Costello, "A distance spectrum
interpretation of turbo codes," <EM>IEEE Trans. Inform. Theory</EM>,
vol. 42, pp. 1698-708, Nov. 1996.
<DT><A name=perez97><STRONG>39</STRONG></A>
<DD>L.C. Perez, in <EM>Trellis Codes</EM> (C. Schlegel ed.), New York: IEEE
Press, chapter 8, pp. 233-62, 1997.
<DT><A name=pietrobon95><STRONG>40</STRONG></A>
<DD>S.S. Pietrobon, "Implementation and performance of a serial MAP decoder
for use in an iterative turbo decoder," in <EM>Proc., IEEE Int. Symp. on
Inform. Theory</EM>, p. 471, 1995.
<DT><A name=riedel95><STRONG>41</STRONG></A>
<DD>S. Riedel and Y.V. Svirid, "Iterative ("turbo") decoding of threshold
decodable codes," <EM>European Trans. on Telecommun.</EM>, vol. 6,
pp. 527-34, Sept./Oct. 1995.
<DT><A name=riedel97><STRONG>42</STRONG></A>
<DD>S. Riedel, "Symbol-by-symbol MAP decoding of convolutional codes using
reciprocal dual convolutional codes," in <EM>Proc., IEEE Int. Symp. on Inform.
Theory</EM>, 1997.
<DT><A name=riedel98><STRONG>43</STRONG></A>
<DD>S. Riedel, "MAP decoding algorithms for high-rate convolutional codes
which use reciprocal dual codes," <EM>IEEE J. Select. Areas Commun.</EM>,
vol. 15, Jan. 1998. to appear.
<DT><A name=sadowsky97><STRONG>44</STRONG></A>
<DD>J.S. Sadowsky, "A maximum-likelihood decoding algorithm for turbo codes,"
in <EM>Proc., IEEE Commun. Theory Workshop</EM>, (Tuscon, Arizona), Apr. 1997.
<DT><A name=svirid95a><STRONG>45</STRONG></A>
<DD>Y.V. Svirid and S. Riedel, "Threshold decoding of turbo-codes," in
<EM>Proc., IEEE Int. Symp. on Inform. Theory</EM>, p. 39, 1995.
<DT><A name=thit93><STRONG>46</STRONG></A>
<DD>P. Thitimajshima, <EM>Systematic recursive convolutional codes and their
application to parallel concatenation</EM>. PhD thesis, Universite de Bretagne
Occidentale, Dec. 1993. in French.
<DT><A name=viterbi97><STRONG>47</STRONG></A>
<DD>A.J. Viterbi, A.M. Viterbi, J. Nicolas, and N.T. Sindhushayana,
"Perspectives on interleaved concatenated codes with iterative soft-output
decoding," in <EM>Proc., Int. Symp. on Turbo Codes and Related Topics</EM>,
(Brest, France), pp. 47-54, Sept. 1997.
<DT><A name=wiberg97><STRONG>48</STRONG></A>
<DD>N. Wiberg, "On the performance of the iterative turbo decoding algorithm,"
in <EM>Proc., Int. Symp. on Turbo Codes and Related Topics</EM>, (Brest,
France), pp. 223-6, Sept. 1997. </DD></DL>
<H3><A name="Soft-Output Decoding Algorithms"><FONT color=#006633>Soft-Output
Decoding Algorithms</FONT></A></H3>
<DL compact>
<DT><A name=bahl74><STRONG>49</STRONG></A>
<DD>L.R. Bahl, J. Cocke, F. Jeinek, and J. Raviv, "Optimal decoding of linear
codes for minimizing symbol error rate," <EM>IEEE Trans. Inform. Theory</EM>,
vol. 20, pp. 284-7, Mar. 1974.
<DT><A name=ben96a><STRONG>50</STRONG></A>
<DD>S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Algorithm for
continuous decoding of turbo codes," <EM>Electronics Letters</EM>,
vol. 32, pp. 314-5, Feb. 15th 1996.
<DT><A name=ben96g><STRONG>51</STRONG></A>
<DD>S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Soft-output
decoding algorithms for continuous decoding of parallel concatenated
convolutional codes," in <EM>Proc., IEEE Int. Conf. on Commun.</EM>,
pp. 112-7, May 1996.
<DT><A name=ben97a><STRONG>52</STRONG></A>
<DD>S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "A soft-output APP
module for iterative decoding of concatenated codes," <EM>IEEE Commun.
Letters</EM>, vol. 1, pp. 22-4, Jan. 1997.
<DT><A name=ben97e><STRONG>53</STRONG></A>
<DD>S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Soft-input
soft-output building blocks for the construction and distributed iterative
decoding of code networks," <EM>European Trans. on Telecommun.</EM>, May 1997.
<DT><A name=berrou93b><STRONG>54</STRONG></A>
<DD>C. Berrou, P. Adde, E. Angui, and S. Faudeil, "A low complexity
soft-output Viterbi decoder architecture," in <EM>Proc., IEEE Int. Conf. on
Commun.</EM>, pp. 737-40, May 1993.
<DT><A name=chang66><STRONG>55</STRONG></A>
<DD>R.W. Chang and J.C. Hancock, "On receiver structures for channels having
memory," <EM>IEEE Trans. Inform. Theory</EM>, vol. 12, pp. 463-8,
Oct. 1966.
<DT><A name=feng97><STRONG>56</STRONG></A>
<DD>W. Feng and B. Vucetic, "A list bidirectional soft-output decoder of turbo
codes," in <EM>Proc., Int. Symp. on Turbo Codes and Related Topics</EM>,
(Brest, France), pp. 288-92, Sept. 1997.
<DT><A name=forney73><STRONG>57</STRONG></A>
<DD>G.D. Forney, "The Viterbi algorithm," <EM>Proc. IEEE</EM>, vol. 61,
pp. 268-78, Mar. 1973.
<DT><A name=forney96><STRONG>58</STRONG></A>
<DD>G.D. Forney, "The forward-backward algorithm," in <EM>Proc., Allerton
Conf. on Commun., Control, and Computing</EM>, (Allerton, Illinois), Sept.
1996.
<DT><A name=forney97><STRONG>59</STRONG></A>
<DD>G.D. Forney, "On iterative decoding and the two way algorithm," in
<EM>Proc., Int. Symp. on Turbo Codes and Related Topics</EM>, (Brest, France),
pp. 12-25, Sept. 1997.
<DT><A name=gert97><STRONG>60</STRONG></A>
<DD>M. Gertsman and J.H. Lodge, "Symbol-by-symbol MAP demodulation of CPM and
PSK signals on Rayleigh flat-fading channels," <EM>IEEE Trans. Commun.</EM>,
July 1997.
<DT><A name=hag89><STRONG>61</STRONG></A>
<DD>J. Hagenauer and P. Hoeher, "A Viterbi algorithm with soft-decision
outputs and its applications," in <EM>Proc., IEEE GLOBECOM</EM>,
pp. 1680-6, 1989.
<DT><A name=hag92><STRONG>62</STRONG></A>
<DD>J. Hagenauer, "Soft-in/soft-out: The benefits of using soft decisions in
all stages of digital receivers," in <EM>Proc., 3rd Int. Workshop on DSP
Techniques Applied to Space Commun.</EM>, (Noordwijk, The Netherlands), ESTEC,
Sept. 1992.
<DT><A name=hag94b><STRONG>63</STRONG></A>
<DD>J. Hagenauer, P. Robertson, and L. Papke, "Iterative (turbo) decoding of
systematic convolutional codes with the MAP and SOVA algorithms," in
<EM>Proc., ITG Conf.</EM>, Sept. 1994.
<DT><A name=hartmann76><STRONG>64</STRONG></A>
<DD>C.R.P. Hartmann and L.D. Rudolph, "An optimum symbol-by-symbol decoding
rule for linear codes," <EM>IEEE Trans. Inform. Theory</EM>, vol. 22,
pp. 514-517, Sept. 1976.
<DT><A name=luthi96><STRONG>65</STRONG></A>
<DD>E. Luthi and E. Casseau, "High rate soft output Viterbi decoder," in
<EM>Proc., European Design and Test Conf.</EM>, pp. 315-9, 1996.
<DT><A name=mceli96><STRONG>66</STRONG></A>
<DD>R.J. McEliece, "On the BCJR trellis for linear block codes," <EM>IEEE
Trans. Inform. Theory</EM>, vol. 42, pp. 1072-92, July 1996.
<DT><A name=pietrobon94><STRONG>67</STRONG></A>
<DD>S.S. Pietrobon and A.S. Barbalescu, "A simplification of the modified Bahl
decoding algorithm for systematic convolutional codes," in <EM>Proc., Int.
Symp. on Info. Theory and Applications</EM>, (Sydney, Australia),
pp. 1073-7, Nov. 1994.
<DT><A name=robert95a><STRONG>68</STRONG></A>
<DD>P. Robertson, E. Villebrun, and P. Hoeher, "A comparison of optimal and
sub-optimal MAP decoding algorithms operating in the log domain," in
<EM>Proc., IEEE Int. Conf. on Commun.</EM>, pp. 1009-13, 1995.
<DT><A name=robert97a><STRONG>69</STRONG></A>
<DD>P. Robertson, P. Hoeher, and E. Villebrun, "Optimal and sub-optimal
maximum a posteriori algorithms suitable for turbo decoding," <EM>European
Trans. on Telecommun.</EM>, vol. 8, pp. 119-25, Mar./Apr. 1997.
<DT><A name=seshadri94><STRONG>70</STRONG></A>
<DD>N. Seshadri and C.-E.W. Sundberg, "List Viterbi decoding algorithms with
application," <EM>IEEE Trans. Commun.</EM>, vol. 42, pp. 313-23,
Feb./Mar./Apr. 1994.
<DT><A name=viterbi67><STRONG>71</STRONG></A>
<DD>A.J. Viterbi, "Error bounds for convolutional codes and an asymptotically
optimum decoding algorithm," <EM>IEEE Trans. Inform. Theory</EM>,
vol. 13, pp. 260-9, Apr. 1967. </DD></DL>
<H3><A name="Design and Analysis of Concatenated Codes"><FONT
color=#006633>Design and Analysis of Concatenated Codes</FONT></A></H3>
<DL compact>
<DT><A name=andersen96><STRONG>72</STRONG></A>
<DD>J.D. Andersen, "Turbo codes extended with outer BCH code," <EM>Electronics
Letters</EM>, vol. 32, pp. 2059-60, Oct. 24th 1996.
<DT><A name=andersen97><STRONG>73</STRONG></A>
<DD>J.D. Andersen and V.V. Zyablov, "Interleaver design for turbo coding," in
<EM>Proc., Int. Symp. on Turbo Codes and Related Topics</EM>, (Brest, France),
pp. 154-6, Sept. 1997.
<DT><A name=bar94><STRONG>74</STRONG></A>
<DD>A.S. Barbulescu and S.S. Pietrobon, "Interleaver design for turbo codes,"
<EM>Electronics Letters</EM>, vol. 30, pp. 2107-8, Dec. 8th 1994.
<DT><A name=bar95a><STRONG>75</STRONG></A>
<DD>A.S. Barbulescu and S.S. Pietrobon, "Terminating the trellis of
turbo-codes in the same state," <EM>Electronics Letters</EM>, vol. 31,
pp. 22-3, Jan. 5th 1995.
<DT><A name=bar95c><STRONG>76</STRONG></A>
<DD>A.S. Barbulescu and S.S. Pietrobon, "Interleaver design for three
dimensional turbo codes," in <EM>Proc., IEEE Int. Symp. on Inform.
Theory</EM>, p. 37, 1995.
<DT><A name=ben95a><STRONG>77</STRONG></A>
<DD>S. Benedetto and G. Montorsi, "Performance evaluation of turbo-codes,"
<EM>Electronics Letters</EM>, vol. 31, pp. 163-5, Feb. 2nd 1995.
<DT><A name=ben95b><STRONG>78</STRONG></A>
<DD>S. Benedetto and G. Montorsi, "Performance evaluation of
parallel concatenated codes," in <EM>Proc., IEEE Int. Conf. on Commun.</EM>,
pp. 663-7, May 1995.
<DT><A name=ben95c><STRONG>79</STRONG></A>
<DD>S. Benedetto and G. Montorsi, "Design guidelines of parallel
concatenated convolutional codes," in <EM>Proc., IEEE GLOBECOM</EM>,
pp. 2273-7, 1995.
<DT><A name=ben95d><STRONG>80</STRONG></A>
<DD>S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some
results on parallel concatenated codes," in <EM>Proc., IEEE Int. Symp. on
Inform. Theory</EM>, p. 32, 1995.
<DT><A name=ben96b><STRONG>81</STRONG></A>
<DD>S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some
results on parallel concatenated coding schemes," <EM>IEEE Trans. Inform.
Theory</EM>, vol. 42, pp. 409-28, Mar. 1996.
<DT><A name=ben96c><STRONG>82</STRONG></A>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -