Novel blind encoder identification of Reed-Solomon codes with low computational complexity

• Published in: Globecom (2003) pp. 3294 - 3299
• Main Authors: Hongting Zhang, Hsiao-Chun Wu, Hong Jiang
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2013
• Subjects: Blind encoder identification; Computational complexity; Encoding; expectation maximization; log-likelihood ratio; Modulation; Probability; Reed Solomon codes; Signal to noise ratio; Transmitters; Vectors
• ISSN: 1930-529X
• DOI: 10.1109/GLOCOM.2013.6831580

Adaptive modulation and coding (AMC) is commonly used in wireless systems to dynamically change the modulation and coding schemes (MCSs) in subsequent frames such that the spectral efficiency can be adapted to various channel conditions. The spectrum and energy efficiency would decrease if the adopted MCS option at the transmitter needs to be dynamically transmitted to the receiver through a secure control channel. To combat this problem, in this paper, we would like to propose a novel blind channel-encoder identification scheme with low computational complexity for Reed-Solomon (RS) codes over Galois field GF(q), which could also be applied to other similar non-binary channel codes as well. Our proposed new scheme involves the estimation of the channel parameters using the expectation-maximization (EM) algorithm, the calculation of the log-likelihood ratio vectors (LLRVs) of the syndrome a posteriori probabilities over GF(q), and the identification of the non-binary RS encoder in use subject to the maximum average log-likelihood ratio (LLR) over the pre-selected candidate encoder set. Simulation results justify the effectiveness of this new mechanism.