Design of Double Repeat Accumulate Codes Based on Belief Propagation Decoding

Berrou C, Glavieux A, and Thitimajshima P. Near Shannonlimit error-correcting coding and decoding: turbo-codes.IEEE International Conference On Communication, Geneva,May 1993: 1064-1070.[2]MacKay D J C and Neal R M. Near Shannon limitperformance of low density parity check codes. ElectronicsLetters, 1996, 32(18): 1645-1646.[3]Divsalar D, Jin H, and McEliece R. Coding theorems forTurbo like codes. Proceedings of the 36th Annual AllertonConference on Communication Control and Computing.Monticello, IL , USA, 1998, 9: 201-210.[4]Abbaster A, Divsalar D, and Yao K. Accumulate repeataccumulate codes. Proceedings of 2004 IEEE InternationalSymposium on Information Theory. June 27-July 2, Chicago,IL, 2004: 509-513.[5]Johnson S J and Weller S R. Practical interleavers forsystematic repeat-accumulate codes. Vehicular TechnologyConference, 2006. VTC 2006-Spring. IEEE 63rd, Melbourne,Australia, Volume 3: 1358-1362.[6]Brink S ten, Kramer Gerhard, and Ashikhmin Alexei. Designof Low-density parity-check codes for modulation anddetection[J].IEEE Trans. on Communications.2004, 52(4):670-678[7]Johnson S J and Weller S R. Constraining LDPC degreedistributions for improved error floor performance. IEEECommunications Letters, 2006, 10(2): 103-105.