Multiple parallel concatenation of circular recursive systematic convolutional (CRSC) codes

Annales des Telecommunications/Annals of Telecommunications

Volumn 54, Issue 3, 1999, Pages 166-172

  Berrou, Claude ^a   Douillard, Catherine ^a   Jézéquel, Michel ^a  

^a ECOLE DES MINES DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CIRCULAR RECURSIVE SYSTEMATIC CONVOLUTIONAL (CRSC) CODES; CONCATENATION; TURBO CODES; BLOCK-TRANSMISSION; CODING RATE; ERROR CORRECTING CODE; INFORMATION BLOCKS; MINIMUMS DISTANCE; PARALLEL CONCATENATION; RANDOM CODES; RANDOM CODING; RECURSIVE SYSTEMATIC CONVOLUTIONAL CODE;

BLOCK CODES; DECODING; ERROR CORRECTION; ITERATIVE METHODS; RANDOM PROCESSES; CONVOLUTION; ITERATIVE DECODING; TURBO CODES;

CONVOLUTIONAL CODES;

EID: 0032650625     PISSN: 00034347     EISSN: 19589395     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. SHANNON (C. E.). A mathematical theory of communication, Bell System Technical Journal, 27, (July and October 1948).
2. *** Draft CCSDS recommendation for telemetry channel coding (updated to include turbo codes), Consultative Committee for Space Data Systems, Rev. 4, (May 1998).
3. BERROU (C.), GLAVIEUX (A.). Near optimum error correcting coding and decoding : turbo-codes, IEEE Trans. Com. 44, no 10, pp. 1261-1271, (Oct. 1996).
4. BERROU (C.), GLAVIEUX (A.). Turbo codes, general principles and applications, Proc. of the 6th Int. Tirrenia Workshop on Digital Communications, Pisa, Italy, pp. 215-226, (Sept. 1993).
5. THITIMAJSHIMA (P.). Les codes convolutifs récursifs systématiques et leur application à la concaténation parallèle. Ph. D. no 284, Université de Bretagne Occidentale, Brest, France, (Dec. 1993).
6. BAHL (L. R.), COCKE (J.), JELINEK (F.), RAVIV (J.). Optimal decoding of linear codes for minimizing symbol error rate, IEEE Trans. Inform. Theory, 20, pp. 248-287, (Mar. 1974).
7. ROBERTSON (P.), HOEHER (P.), VILLEBRUN (E.). Optimal and suboptimal maximum a posteriori algorithms suitable for turbo decoding, European Trans. Telecommun., 8, pp. 119-125. (March-Apr. 1997).
8. BATTAIL (G.). Pondération des symboles décodés par l'algorithme de Viterbi, Ann. Télécommun., Fr., 42, no 1-2, pp. 31-38, (Jan. 1987).
9. HAGENAUER (J.), HOEHER (P.). A Viterbi algorithm with soft-decision outputs and its applications, Proc. of Globecom 89, Dallas, Texas, pp. 47, 11-47-17, (Nov. 1989).
10. BERROU (C.), ADDE (P.), ANGUI (E.), FAUDEIL (S.). A low complexity soft-output Viterbi decoder architecture, Proc. of ICC '93, Geneva, pp. 737-740. (May 1993).
11. BENEDETTO (S.), MONTORSI (G.). Unveiling turbo-codes: some results on parallel concatenared coding schemes, IEEE Trans. IT., 42, no 2, pp. 409-429, (Mar. 1996).
12. BERROU (C.). Some clinical aspects of turbo codes, Proc. of Int. Symposium on Turbo Codes, Brest, France, pp. 26-31, (Sept. 1997).
13. LI PING. Modified turbo codes with low decoding complexity, Electronics, Letters, 34, no 23, pp. 2228-2229, (Nov. 1998).
14. PIERCE (J. N.). Limit distribution of the minimum distance of random linear codes, IEEE Trans. IT, 13, no 4, (Oct. 1967).
15. SVIRID (Y. V.), Weight distributions and bounds for turbo codes », Eur. Trans. Telecomm., 6, no 5, pp. 543-555, (Sept./Oct. 1995).
16. BATTAIL (G.). Théorie de l'information, application aux techniques de communication, Masson, Paris, (1997).