DocumentCode
151640
Title
On the equivalence of the ACE and the EMD of a cycle for the ACE spectrum constrained LDPC codes
Author
Deka, Kuntal ; Rajesh, A. ; Bora, Prabin Kumar
Author_Institution
Dept. of Electron. & Electr. Eng., Indian Inst. of Technol. Guwahati, Guwahati, India
fYear
2014
fDate
18-22 Aug. 2014
Firstpage
67
Lastpage
71
Abstract
The Extrinsic Message Degree (EMD) of a cycle in the Tanner graph of a low density parity check (LDPC) code measures the connectivity of the cycle. As it is difficult to calculate the EMD, the Approximate EMD (ACE) is generally used. However, the ACE of a cycle is not always equal to its EMD. This paper presents some sufficient conditions for the equivalence of the ACE and the EMD of a cycle for the ACE spectrum constrained LDPC codes.
Keywords
cyclic codes; parity check codes; ACE spectrum constrained LDPC codes; EMD equivalence; Tanner graph; extrinsic message degree; low density parity check code; Information processing; Iterative decoding; Maximum likelihood decoding; Signal to noise ratio; Turbo codes; ACE; EMD; Low density parity check (LDPC) codes; cycles;
fLanguage
English
Publisher
ieee
Conference_Titel
Turbo Codes and Iterative Information Processing (ISTC), 2014 8th International Symposium on
Conference_Location
Bremen
Type
conf
DOI
10.1109/ISTC.2014.6955087
Filename
6955087
Link To Document