Fast ML Decoding of SPC Product Code by Linear Programming Decoding
Kai Yang
Xiaodong Wang
Feldman, J.
Columbia Univ., New York;
This paper appears in: Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Publication Date: 26-30 Nov. 2007
On page(s): 1577-1581
Location: Washington, DC,
ISBN: 978-1-4244-1043-9
INSPEC Accession Number: 9847334
Digital Object Identifier: 10.1109/GLOCOM.2007.303
Current Version Published: 2007-12-26
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
