An improvement to generalized-minimum-distance decoding
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (1) , 167-172
- https://doi.org/10.1109/18.61132
Abstract
A novel acceptance criterion that is less stringent than previous criteria is developed. The criterion accepts the codeword that is closest to the received vector for many cases where previous criteria fail to accept any codeword. As a result, the performance of generalized minimum distance (GMD) decoding is better if the new criterion is used. For M-ary signaling, the weights used in GMD decoding are generalized to permit each of the possible M symbol values to have a different weightKeywords
This publication has 5 references indexed in Scilit:
- Developments in the Theory and Application of Importance SamplingIEEE Transactions on Communications, 1987
- A Modified Monte-Carlo Simulation Technique for the Evaluation of Error Rate in Digital Communication SystemsIEEE Transactions on Communications, 1980
- Generalized minimum distance decoding algorithms for Qary output channels (Corresp.)IEEE Transactions on Information Theory, 1980
- A note on soft decision decoding with successive erasures (Corresp.)IEEE Transactions on Information Theory, 1976
- Generalized minimum distance decodingIEEE Transactions on Information Theory, 1966