Low Complexity Soft Decision Decoding Algorithms for Reed-Solomon Codes(Special Issue on Innovative Mobile Communication Technologies at the Dawn of the 21^<st>Century)
スポンサーリンク
概要
- 論文の詳細を見る
We propose a method to represent non-binary error patterns for Reed-Solomon codes using a trellis. All error patterns are sorted according to their Euclidean distances from the received vector. The decoder searches through the trellis until it finds a codeword. This results in a soft-decision maximum likelihood algorithm with lower complexity compared to other known MLD methods. The proposed MLD algorithm is subsequently modified to further simplify complexity, reflecting in a slight reduction in the error performance.
- 社団法人電子情報通信学会の論文
- 2001-03-01
著者
-
Vucetic Branka
The School Of Electrical And Information Engineering University Of Sydney
-
Vucetic Branka
The School Of Electrical And Information Engineering Building J03 University Of Sydney
-
PONAMPALAM Vishakan
The School of Electrical and Information Engineering University of Sydney
-
VOCKOVIC Jelena
The Department of Electrical Engineering, California Institute of Technology
-
Vockovic Jelena
The Department Of Electrical Engineering California Institute Of Technology
関連論文
- Low Complexity Soft Decision Decoding Algorithms for Reed-Solomon Codes(Special Issue on Innovative Mobile Communication Technologies at the Dawn of the 21^Century)
- Optimum Source Codec Design in Coded Systems and Its Application for Low-Bit-Rate Speech Transmission (Special Issue on Personal, Indoor and Mobile Radio Communications)
- Turbo Codes with Transmit Diversity : Performance Analysis and Evaluation(Wireless Communications Issue)