|
Berrou C, Glavieux A, and Thitimajshima P. Near Shannonlimit error-correcting coding and decoding: Turbo-codes.ICC93, Geneva, May 1993, 2: 1063-1070.[2]Berrou C and Clavieux A. Near optimum error correctingcoding and decoding: turbo-codes[J].IEEE Transactions onCommunications.1996, 44(10):1261-1271[3]Pyndiah R, Glavieux A, and Picart A, et al.. Near optimumdecoding of product codes, GLOBECOM 94, San Francisco,CA, 28 Nov-2 Dec. 1994: 339-343.[4]Pyndiah R. Near-optimum decoding of product codes: BlockTurbo codes[J].IEEE Transactions on Communications.1998,46(8):1003-1010[5]Mahran A and Benaissa M. Adaptive Chase algorithm forblock Turbo codes[J].Electronics Letters.2003, 39(7):617-619[6]Weber J H and Fossorier M P C. Limited-trial Chase-likealgorithms achieving bounded-distance decoding[J].IEEETransactions on Information Theory.2004, 50(12):3318-3323[7]Xu C, Liang Y C, and Leon W S. Shortened Turbo productcodes: encoding design and decoding algorithm[J].IEEETransactions on Vehicular Technology, Part .2007, 56(6):3495-3501[8]Liu W, Xiong C, and Wang D, et al.. A QRD-based chasedecoding algorithm for quasi-orthogonal space-time blockcode systems. WiCOM'08, Dalian, China, Oct. 2008: 1-5 .[9]Zhou R, Le Bidan R, and Pyndiah R, et al.. Low-complexityhigh-rate Reed-Solomon block Turbo codes[J].IEEETransactions on Communications.2007, 55(9):1656-1660[10]Loncar M, Johannesson R, and Bocharova I E, et al..Soft-output BEAST decoding with application to productcodes[J].IEEE Transactions on Information Theory.2008,54(3):1036-1049
|
下载:
