CT码和RA码的资料共享

Adelaide

【文件名】:06526@52RD_CT.rar
【格　式】:rar
【大　小】:169K
【简　介】:Abstract—This paper is concerned with a family of concatenated tree (CT) codes. CT codes are special low-density paritycheck(LDPC) codes consisting of several trees with large spans.They can also be regarded as special turbo codes with hybrid recursive/
nonrecursive parts and multiple constituent codes. CT codes are decodable by the belief-propagation algorithm. They combine many advantages of LDPC and turbo codes, such as low decoding cost, fast convergence speed, and good performance.
【目　录】:
I. INTRODUCTION
II. CT CODES
III. BELIEF-PROPAGATION DECODING OF CT CODES
IV. SOME DESIGN PRINCIPLES
V. COMPARISONS WITH TURBO CODES AND LDPC CODES
VI. CONCLUSION