Closest coset decoding of |u|u+v| codes

Author

Hemmati, Farhad

Author_Institution

COMSAT Labs., Clarksburg, MD, USA

Volume

7

Issue

6

fYear

1989

fDate

8/1/1989 12:00:00 AM

Firstpage

982

Lastpage

988

Abstract

The general concept of closest coset decoding (CCD) is presented, and a soft-decoding technique for block codes that is based on partitioning a code into a subcode and its cosets is described. The computational complexity of the CCD algorithm is significantly less than that required if a maximum-likelihood detector (MLD) is used. A set-partitioning procedure and details of the CCD algorithm for soft decoding of |u|u+v| codes are presented. Upper bounds on the bit-error-rate (BER) performance of the proposed algorithm are combined, and numerical results and computer simulation tests for the BER performance of second-order Reed-Muller codes of length 16 and 32 are presented. The algorithm is a suboptimum decoding scheme and, in the range of signal-to-noise-power-density ratios of interest, its BER performance is only a few tenths of a dB inferior to the performance of the MLD for the codes examined

Keywords

computational complexity; decoding; error correction codes; error statistics; BER; bit-error-rate; block codes; closest coset decoding; computational complexity; maximum-likelihood detector; second-order Reed-Muller codes; set-partitioning procedure; soft-decoding technique; suboptimum decoding scheme; upper bounds; Bit error rate; Block codes; Charge coupled devices; Computational complexity; Computer simulation; Detectors; Maximum likelihood decoding; Maximum likelihood detection; Partitioning algorithms; Upper bound;

fLanguage

English

Journal_Title

Selected Areas in Communications, IEEE Journal on

Publisher

ieee

ISSN

0733-8716

Type

jour

DOI

10.1109/49.29620

Filename

29620