|
Berrou C, Glavieux A, Thitimajshima P. Near Shannon limit error-correcting coding and decoding: Turbo codes. IEEE Int.Conf. on Communications, Geneva, Switzerland, 1993:1064- 1070.[2]Rowitch D N, Milstein L B. On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT)Codes[J].IEEE Trans. on Communications.2000, 48 (6):948-[3]Benedetto S, Montorsi G. Unveiling turbo codes: some results on parallel concatenated coding schemes[J].IEEE Trans. on Info.Theory.1996, 42 (2):409-[4]Divsalar D. A simple tight bound on error probability of block codes with application to turbo codes. JPL, TMO Progress Report 42-139, 1999 (11): 1 - 34.[5]Duman T M, Salehi M. New performance bounds for turbo codes[J].IEEE Trans. on Communications.1998, 46 (6):717-[6]Sason I, Shamai S. Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum[J].IEEE Trans. on Info.Theory.2000, 46 (1):24-[7]Darnell M, Honary B. Communications and Coding: Part 10.Taunton, Somerset, England: Research Studies Press Ltd. 1998:121 - 141.[8]Ruoheng L, Spasojevic P, SoIjanin E. Punctured turbo code ensembles. Proc. of IEEE Information Theory Workshop, Paris,France, 2003:249 - 252.[9]Rowitch D N. Convolutional and turbo coded multicarrier direct sequence CDMA, and applications of turbo codes to hybrid ARQ communication systems. [Ph.D.], Univ. of California at San Diego, La Jolla, CA, June 1998.
|
下载:
