Applications of Adaptive Belief Propagation Decoding for Long Reed-Solomon Codes
Reed-Solomon (204,188) code has been widely used in many digital multimedia broadcasting systems. This paper focuses on the low complexity derivation of adaptive belief propagation bit-level soft decision decoding for this code. Simulation results demonstrate that proposed normalized min-sum algorithm as belief propagation (BP) process provides the same decoding performance in terms of packet-error-rate as sum-product algorithm. An outer adaptation scheme by moving adaptation process of parity check matrix out of the BP iteration loop is also introduced to reduce decoding complexity. Simulation results show that the proposed two schemes perform a good trade-off between the decoding performance and decoding complexity.
KeywordsReed-Solomon codes Adaptive belief propagation Sum-Product algorithm Min-sum algorithm Bit-level parity check matrix Gaussian elimination
Unable to display preview. Download preview PDF.
- 2.ETSI TS 102 427 V1.1.1: Digital Audio Broadcasting (DAB); Data Broadcasting – MPEG-2 TS Streaming (2005)Google Scholar
- 3.ETSI EN 300 429 V1.2.1: Digital Video Broadcasting (DVB); Framing structure, Channel Coding and Modulation for Cable Systems (1998) Google Scholar
- 4.ETSI EN 300 744 V1.5.1: Digital Video Broadcasting (DVB); Framing Structure, Channel Coding, and Modulation for Digital Terrestrial Television (2004) Google Scholar
- 5.ISDB-T: Terrestrial Television Digital Broadcasting Transmission. ARIB STD-B31 (1998) Google Scholar
- 6.Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1960)Google Scholar
- 8.Lin, S., Costello, D.J.: Error Control Coding: Fundamentals and Applications. Prentice Hall, New Jersey (1983)Google Scholar