DocumentCode
2052369
Title
Concentration theorem for tripartite LDPC codes
Author
Meshkat, Payman ; Jafarkhani, Hamid
Author_Institution
Electr. Eng. & Comput. Sci. Dept., California Univ., Irvine, CA, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
100
Abstract
This paper presents the framework of tripartite LDPC codes and more than a single coded bit affects its channel outputs. Symbol-nodes along with variable-nodes and check-nodes of the graph of an LDPC codes is used to represent a third set of nodes in channel output. Thus the concentration theorem is considered in this framework, which optimizes the average performance of the codes and the design criterion is meaningful for a randomly chosen sample from the ensemble of LDPC codes.
Keywords
MIMO systems; decoding; optimisation; parity check codes; concentration theorem; low density parity check; optimization; symbol-node; tripartite LDPC code; variable-node; Computer science; Convergence; Design methodology; Design optimization; Engineering profession; Iterative decoding; MIMO; Parity check codes; Pervasive computing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365140
Filename
1365140
Link To Document