DocumentCode
2498935
Title
Fast ML Decoding of SPC Product Code by Linear Programming Decoding
Author
Yang, Kai ; Wang, Xiaodong ; Feldman, Jon
Author_Institution
Columbia Univ., New York
fYear
2007
fDate
26-30 Nov. 2007
Firstpage
1577
Lastpage
1581
Abstract
We consider the maximum-likelihood decoding of single parity-check (SPC) product code. We first prove that, for the family of SPC product code, the fractional distance and the pseudo-distance are both equal to the minimum Hamming distance. We then develop an efficient algorithm for decoding SPC product codes with low complexity and near maximum likelihood decoding performance at practical SNRs.
Keywords
Hamming codes; linear programming; maximum likelihood decoding; parity check codes; product codes; ML decoding; SPC product code; fractional distance; linear programming decoding; maximum-likelihood decoding; minimum Hamming distance; pseudo-distance; single parity-check product code; H infinity control; Hamming distance; Iterative algorithms; Iterative decoding; Linear programming; Maximum likelihood decoding; Maximum likelihood estimation; Parity check codes; Product codes; Sum product algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location
Washington, DC
Print_ISBN
978-1-4244-1042-2
Electronic_ISBN
978-1-4244-1043-9
Type
conf
DOI
10.1109/GLOCOM.2007.303
Filename
4411213
Link To Document