Location of Repository

Single and joint iterative decoding for higher order modulation schemes\ud

By Juan Carlos Serrato Vital

Abstract

The research project described in this thesis concentrates on the study, and application of specific channel coding techniques, in particular, low-density parity-check (LDPC) codes, iterative decoding on Tanner graphs, and their\ud application on joint iterative receivers based on the turbo principle, previously proposed.\ud \ud The construction of random LDPC codes that fulfil certain desirable characteristics, such as large girth, specific p and -y values, and acceptable BER and FER performance for short code lengths, traditionally requires a high degree of processing power (i. e. CPU cycles) to run stochastic routines that firstly search within all the possible combinations for those ones that match the desired characteristics of the LDPC matrix, and secondly determines the bit-error rate (BER) and frame-error rate (FER) performance.\ud \ud The construction of well structured LDPC codes by means of algebraic methods has provided LDPC codes that achieve excellent performance, with desirable structure on their LDPC matrices. However, from the universe of LDPC matrices, those ones created through well structured procedures are\ud a small group. Multiple procedures to modify their characteristics such as length and rate have assisted to increase the pool of LDPC codes based on well structured procedures.\ud \ud This thesis study the problem of constructing random LDPC codes with particular length, girth, and column weight as design parameters, with reduced processing power, while providing, at the same time, a desirable structure to allow efficient use of the memory and of the parallel processing capacity to reduce delay through efficient encoding and decoding.\ud \ud Based on previous studies that analysed the same problem, an algorithm is introduced to construct the Girth-Partition and Shift (GPS) LDPC codes, which are half-rate quasi-cyclic (QC) LDPC codes. Several GPS constructions\ud are analysed over the AWGN channel and the flat-fading channel. The effect on the BER and FER performance from variations on their design parameters, is included in this study.\ud \ud This work also includes the BER and FER performance of the concatenation in parallel of different LDPC codes, some of which are based on well structured procedures, such as Euclidean Geometries (EG) and Projective Geomtries (PG), and Margulis constructions based on the Cayley graph,\ud while the rest are based on random procedures, such as Graphical Models (GM) and GPS-LDPC codes. The aim of the analysis of this scheme, combined with the referred LDPC code constructions, include the improvement of the BER and FER performance for short code lengths and the reduction\ud of the encoding complexity.\ud \ud The BER and FER performance achieved by the parallel concatenation of the previously mentioned LDPC codes, is further analysed in a joint demapping, parallel channel decoding and source decoding system. The impact of each component on the overall system performance is also examined

Publisher: School of Electronic & Electrical Engineering (Leeds)
Year: 2008
OAI identifier: oai:etheses.whiterose.ac.uk:730

Suggested articles

Preview

Citations

  1. (2003). 4g mobile research in asia, " doi
  2. (1999). A factor graph framework for joint source-channel decoding of images, " doi
  3. (1952). A method for the construction of minimum redundancy codes, " doi
  4. (1981). A recursive approach to low complexity codes, " doi
  5. (1988). A transform theory for a class of group-invariant codes, " doi
  6. (2004). An algebraic method for constructiong quasi-cyclic ldpc codes, "
  7. (2007). An improved max-log-map algorithm for turbo decoding and turbo equalization, " doi
  8. (2003). An integrated joint source-channel decoder for mpeg-4 coded video, " doi
  9. An introduction to factor graphs, " doi
  10. (2002). Analysis and design of parallel concatenated gallager codes, " doi
  11. (2001). Analysis of sum-product decoding of low-density parity-check codes using a gaussian approximation, " Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation, doi
  12. (2007). Applications of ldpc codes to the wiretap channel, " doi
  13. Area efficient decoding of quasi-cyclic low density parity check codes, " doi
  14. (2006). Bilayer ldpc codes for the relay channel, " doi
  15. (2004). Bounds on information combining for the accumulator of repeat-accumulate codes without gaussian assumption, " doi
  16. (2005). Bounds on information combining, " doi
  17. (1996). Codes and decoding on general graphs, " doi
  18. (2005). Codes on finite geometries, " doi
  19. (2004). Combinatorial construction of low-density parity-check codes for iterative decoding, " doi
  20. Comparison between serial and parallel concatenated channel coding schemes using continuous phase modulation over awgn and fading channels, " in CIC'
  21. (1966). Concatenated Codes. doi
  22. Construction of low density parity check codes: a combinatoric design approach, " doi
  23. (2004). Construction of low-density parity-check codes based on balanced incomplete block designs, " doi
  24. (2001). Construction of low-density parity-check codes from kirkman triple systems, " doi
  25. (2003). Construction of low-density parity-check codes on reed-solomon codes with two information symbols, " doi
  26. (2005). Construction of low-density paritycheck codes by superposition, "
  27. (2004). Construction of qcldpc codes based on the minimum-weight codewords of rs codes, " doi
  28. (2005). Construction of well-structured quasicyclic low-density parity check codes, " doi
  29. (2000). Constructions of ldpc codes using ramanujan graphs and ideas from margulis, " doi
  30. (2001). Convergence behavior of iteratively decoded parallel concatenated codes, " doi
  31. (1999). Convergence of iterative decoding, doi
  32. Density evolution for gf(q) ldpc codes via simplified message-passing sets, " Information Theory and Applications Workshop, doi
  33. (2001). Density evolution for low-density paritycheck codes under max-log-map decoding, " doi
  34. (2005). Density evolution, thresholds and the stability condition for non-binary ldpc codes, " doi
  35. (2001). Design of capacity-approaching irregular low-density parity-check codes, " doi
  36. (2003). Design of ldpc-coded modulation schemes, "
  37. (2004). Design of low-density parity-check codes for modulation and detection, " doi
  38. (2001). Digital Communications Fundamentals and Applications,
  39. (2006). Efficient encoding of quasi-cyclic lowdensity parity-check codes, " doi
  40. (2007). Efficient serial message-passing schedules for ldpc decoding, " doi
  41. (2004). Error Control Coding, doi
  42. (1972). Error Correcting Codes, doi
  43. (2004). Explicit construction of families of ldpc codes with no 4-cycles, " doi
  44. Explicit constructions of graphs without short cycles and low density codes, " doi
  45. (2001). Factor graphs and the sumproduct algorithm, " doi
  46. (2007). Fast encodable and decodable irregular repeat accumulate codes from circulant permutation matrices, " doi
  47. (2002). Finite-length analysis of low-density parity-check codes on the binary erasure channel, " doi
  48. Geometry based designs of ldpc codes, " doi
  49. Girth partition and shift, " Electronic Letters, Under revision.
  50. (1999). Good error-correcting codes based on very sparse matrices, " doi
  51. (1998). Iterative demapping and decoding for multilevel modulation, " doi
  52. (1998). Iterative demapping for gpsk modulation, " doi
  53. (2000). Iterative source-channel decoding using soft-in/soft-out decoders, " doi
  54. (2006). Joint demapping and source decoding for multilevel modulation, " doi
  55. Joint source-channel coding: a practical approach and an implementation example, " Information Theory and Applications Workshop, doi
  56. (2001). Joint source-channel decoding of correlated sources over noisy channels, " doi
  57. (2003). Large-girth ldpc codes based on graphical models, " doi
  58. (2007). Lazy scheduling for ldpc decoding, "
  59. (2002). Ldpc-based joint source-channel coding scheme for multimedia communications, " doi
  60. (1999). Low complexity source controlled channel decoding in a gsm system, " doi
  61. (2005). Low complexity, high speed decoder architecture for quasi-cyclic ldpc codes, " doi
  62. (2001). Low density parity check matrices from permutation matrices, " doi
  63. (2007). Low-complexity high-speed decoder design for quasi-cyclic ldpc codes, " doi
  64. Low-density parity-check codes based on finite geometries: A rediscovery and new results, " doi
  65. (1998). Low-density parity-check codes over gf(q), " doi
  66. (1963). Low-density parity-check codes, " doi
  67. (2005). Migration to capacity approaching codes for digital video broadcasting, " doi
  68. Near shannon limit errorcorrecting coding: Turbo codes, " in doi
  69. (1996). Near shannon limit performance of lowdensity parity-check codes, " doi
  70. (2004). Near-shannon-limit quasi-cyclic lowdensity parity-check codes, " doi
  71. (2008). New constructions of quasicyclic ldpc codes based on special classes of bidb for the awgn and binary erasure channels, " doi
  72. (2004). On algebraic construction of gallager and circulant low density parity check codes, " doi
  73. On circulant low density parity check codes, " doi
  74. (2007). On the bcjr algorithm for rate distortion source coding, " doi
  75. (2002). On the design, simulation and analysis of parallel concatenated gallager codes, " doi
  76. (2007). On the error exponent and the use of ldpc codes for cooperative sensor networks with misinformed nodes, " doi
  77. (2005). On the exit chart analysis of low-density parity-check codes, " doi
  78. (2006). On the stopping distance and the stopping redundancy of codes, " doi
  79. Open wireless architecture - the core to 4g mobile communications, " doi
  80. (1974). Optimum decoding of linear codes for minimizing symbol error rate, " doi
  81. (2001). Parallel concatenated gallager codes for cdma applications, " doi
  82. (2004). Parallel concatenated gallager codes using euclidean and projective geomery ldpc codes, "
  83. (2000). Parallel concatenated gallager codes, " doi
  84. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, doi
  85. (1994). Probability and Random Processes for Electrical Engiveering,
  86. (2004). Quasicyclic low-density parity-check codes from circulant permutation matrices, " doi
  87. (2004). Rate adaptation with hybrid arq based on cross layer information for satellite communication systems, " doi
  88. (2003). Soft decisions for dgpsk demodulation for the vitervi decoding of the convolutional codes, " doi
  89. (1995). Source-controlled channel decoding, " doi
  90. (2001). Spectral graphs for quasi-cyclic ldpc codes, " doi
  91. Stopping set analysis for hamming codes, " doi
  92. (2004). Structured low-density parity-check codes, " doi
  93. (2006). Structured parallel concatenated ldpc codes, " doi
  94. (2005). TCP Performance over UMTS-HSDPA System. doi
  95. (2001). The capacity of low-density parity-check codes under message-passing decoding, " doi
  96. The design of structured regular ldpc codes with large girth, " doi
  97. (1996). To compress or not to compress? " doi
  98. (2002). Turbo coding, turbo Equalisation and SpaceTime Coding for Transmission over Fading Channels, Wiley and Sons, Eds. doi
  99. Turbo decoding as an instance of pearl's "belief propagation" algorithm, '' doi
  100. Turbo decoding for pr4: parallel versus serial concatenation, " doi
  101. (2001). Unified design of iterative receivers using factor graphs, " on Information Theory, doi
  102. (2003). Utilizing soft information in image decoding, " doi
  103. (1999). Which codes have cycle-free tanner graphs, " doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.