Reed-Solomon decoding algorithms for digital audio broadcasting in the AM band

Laneman, J. Nicholas; Sundberg, C.-E.W.

doi:10.1109/11.948264

Cited by 6 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We evaluate methods of applying outer CRC codes to PAC, an audio coder that has variable frame length. Similar experiments to these should also be repeated for other outer codes such as Reed-Solomon codes, which are preferred for digital audio broadcasting systems in the AM band with multilevel modulation [4], [26], [27]. We conclude that the variable length outer CRC code integrated with the PAC audio coder is a more effective method of applying the outer CRC code.…”

Section: B Variable Crc Resultsmentioning

confidence: 99%

Huffman code based error screening and channel code optimization for error concealment in perceptual audio coding (PAC) algorithms

Laneman

Sundberg²,

Faller³

2002

IEEE Trans. on Broadcast.

Self Cite

View full text Add to dashboard Cite

Abstract-The class of Perceptual Audio Coding (PAC) algorithms yields efficient and high-quality stereo digital audio bitstreams at bit rates from 16 kb/sec to 128 kb/sec (and even higher bit rates). To avoid "pops and clicks" in the decoded audio signals due to erasure or undetected errors from transmission over unreliable channels, e.g., in the context of digital audio broadcasting (DAB), channel error detection combined with source error concealment, or source error mitigation, techniques are preferred to pure channel error correction. One simple and efficient way to perform channel error detection is to employ a high-rate block code; for example, the preferred solution for hybrid in-band on-channel (HIBOC) DAB in the FM band employs a cyclic redundancy check (CRC) code. Several joint source-channel coding issues arise in this framework because PAC contains a fixed-to-variable source coding component in the form of Huffman codes, so that the output audio packets are of varying length. We explore two such issues in this paper.First, we develop methods for screening for undetected channel errors in the audio decoder by looking for inconsistencies between the number of bits decoded by the Huffman decoder and the number of bits in the packet as specified by control information within the bitstream. We evaluate this scheme by means of simulations of Bernouli sources and real audio data encoded by PAC, both exposed to random bit errors as well as errors that pass undetected through a CRC decoder. Considerable reduction in undetected errors is obtained with little extra processing in the receiver and with little or no increase in the transmitted bit rate.Second, we consider several configurations for the channel error detection codes, in particular CRC codes, by means of representative simulations and informal listening tests, for several audio coder bit rates of interest in DAB. One configuration employs a fixed-rate, fixed-blocklength code of optimized length outside the PAC algorithm. Another preferable set of formats employs variable-blocklength, variable-rate outer codes matched to the individual audio packets, with one or more codewords used per audio packet. In this case, better performance is obtained; however, to maintain a constant bit rate into the channel, PAC and CRC encoding must be performed jointly, e.g., by incorporating the CRC into the bit allocation loop in the audio coder.

show abstract

Section: B Variable Crc Resultsmentioning

confidence: 99%

Huffman code based error screening and channel code optimization for error concealment in perceptual audio coding (PAC) algorithms

Laneman

Sundberg²,

Faller³

2002

IEEE Trans. on Broadcast.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The Reed-Solomon (RS) codes have been proven as good compromises between implementation complexity and error correction capability [4]. RS codes have been exploited in many applications such as Wireless Sensor Networks [5][6], digital broadcasting systems [7][8] and other networks [9]. In order to correct burst errors, some product codes based on RS codes have been proposed.…”

Section: Introductionmentioning

confidence: 99%

Highly Reliable Product Code for Error Correction

Wang¹,

Yang²,

Yao³

et al. 2015

IJMUE

View full text Add to dashboard Cite

In storage and communication systems, the product and concatenation codes, which consist of Reed-Solomon (RS) codes and other error-correction codes, can be utilized to effectively correct burst errors by performing erasures-and-errors decoding. However, the RS codes have two drawbacks: 1) the RS decoders may not detect received erroneous codewords, and 2) the RS decoders may generate valid codewords which are not equal to the transmitted codewords. In the implementation of the product and concatenation codes, such decoding drawbacks can cause the RS code to provide incorrect error-detection information or erasure information to other error-correction codes, resulting in unreliable error-correction performance of the systems. In this study, we propose a new product code to overcome these drawbacks by studying the RS product code (RSPC). The new code combines CRC code with RSPC which is called as CRSPC. In addition, the results of experiments show that the new CRSPC can significantly reduce the probabilities of these drawbacks, thereby improving the performance of erasures-anderrors decoding. With minor modifications, the CRSPC algorithm can be applied to Blueray disc systems which have powerful recording functions in multimedia.

show abstract

“…Previously, the E8 lattice has been considered for trellis-coded modulation with a convolutional code and average power shaping [6]. In addition, there are numerous proposals for including RS codes in trellis-coded modulation [7] [8]. However, the combination of the E8 lattice and RS codes described in this paper appears to be unique.…”

Section: Introductionmentioning

confidence: 99%

The E8 Lattice and Error Correction in Multi-Level Flash Memory

Kurkoski

2011

2011 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

A construction using the E8 lattice and Reed-Solomon codes for error-correction in flash memory is given. Since E8 lattice decoding errors are bursty, a Reed-Solomon code over GF(2 8 ) is well suited. This is a type of coded modulation, where the Euclidean distance of the lattice, which is an eight-dimensional signal constellation, is combined with the Hamming distance of the code. This system is compared with the conventional technique for flash memories, BCH codes using Gray-coded PAM. The described construction has a performance advantage of 1.6 to 1.8 dB at a probability of word error of 10 −6 . Evaluation is at high data rates of 2.9 bits/cell for flash memory cells that have an uncoded data density of 3 bits/cell.

show abstract

Reed-Solomon decoding algorithms for digital audio broadcasting in the AM band

Cited by 6 publications

References 15 publications

Huffman code based error screening and channel code optimization for error concealment in perceptual audio coding (PAC) algorithms

Huffman code based error screening and channel code optimization for error concealment in perceptual audio coding (PAC) algorithms

Highly Reliable Product Code for Error Correction

The E8 Lattice and Error Correction in Multi-Level Flash Memory

Contact Info

Product

Resources

About