SCOPUS 정보 검색 플랫폼

IEEE Journal on Selected Areas in Communications

Volumn 19, Issue 5, 2001, Pages 891-907

Iterative turbo decoder analysis based on density evolution

(3) Divsalar, D a Dolinar, S a Pollara, F a

a CALIFORNIA INSTITUTE OF TECHNOLOGY (United States)

Author keywords

Concatenated mixture codes; Density evolution; Iterative decoding analysis; Noise figure; Serially concatenated codes; Turbo codes

Indexed keywords

APPROXIMATION THEORY; CONVOLUTIONAL CODES; ERROR ANALYSIS; ERROR DETECTION; ITERATIVE METHODS; OPTIMIZATION; SIGNAL TO NOISE RATIO; SPURIOUS SIGNAL NOISE; TURBO CODES;

ITERATIVE TURBO DECODER; LOW DENSITY PARITY CHECK (LDPC) CODES;

DECODING;

EID: 0035332194 PISSN: 07338716 EISSN: None Source Type: Journal
DOI: 10.1109/49.924873 Document Type: Article

Times cited : (239)

References (28)

1
- 0027297425
- Near shannon limit error-correcting coding: Turbo codes
- May
- (1993) Proc. IEEE Int. Conf. Communications , pp. 1064-1070
- Berrou, C.¹ Glavieux, A.² Thitimajshima, P.³

2
- 0032072269
- Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding
- May
- (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 909-926
- Benedetto, S.¹ Divsalar, D.² Montorsi, G.³ Pollara, F.⁴

3
- 0003846836
- Dept. Electrical Engineering, Linkoping University, Linkoping, Sweden
- (1996) Codes and Decoding on General Graphs
- Wiberg, N.¹

4
- 0003681138
- Ph.D. dissertation, Dept. Electrical and Computer Eng., Univ. Maryland, College Park, MD
- (1999) On the theory and application of space-time and graph based codes
- El Gamal, H.¹

5
- 0035246116
- Analyzing the turbo decoder using the Gaussian approximation
- Feb.
- (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 671-686
- El Gamal, H.¹ Hammons A.R., Jr.²

6
- 0016037512
- Optimal decoding of linear codes for minimizing symbol error rate
- Mar.
- (1974) IEEE Trans. Inform. Theory , vol.IT-20 , pp. 284-287
- Bahl, L.R.¹ Cocke, J.² Jelinek, F.³ Raviv, J.⁴

7
- 0001862523
- Soft input soft output map module to decode parallel and serial concatenated codes
- JPL, Pasadena, CA, Nov. 15
- (1996) The Telecommunications and Data Acquisition Progress Rep. , pp. 42-127
- Benedetto, S.¹ Divsalar, D.² Montorsi, G.³ Pollara, F.⁴

8
- 0035246307
- The capacity of low density parity check codes under message passing decoding
- Feb.
- (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 599-618
- Richardson, T.¹ Urbanke, R.²

9
- 0035246128
- Analysis of sum-product decoding of low-density parity-check codes using Gaussian approximation
- Feb.
- (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 657-670
- Chung, S.-Y.¹ Richardson, T.² Urbanke, R.³

10
- 0035246127
- Design of capacity-approaching irregular low-density parity check codes
- Feb.
- (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 619-637
- Richardson, T.¹ Shokrollahi, A.² Urbanke, R.³

11
- 0003207952
- Analysis and design of iterative decoding systems
- presented at the, Graphical Models, Minneapolis, MN, Aug. 2-6
- (1999) IMA Summer Program: Codes Systems
- Richardson, T.¹ Urbanke, R.²

12
- 0004747529
- May
- (1999) Telemetry channel coding

13
- 0019608335
- A recursive approach to low complexity codes
- Sept.
- (1981) IEEE Trans. Inform. Theory , vol.27 , pp. 533-547
- Tanner, R.M.¹

14
- 0032670935
- Convergence of iterative decoding
- May 24th
- (1999) Electron. Lett. , vol.35 , Issue.13 , pp. 806-808
- Ten Brink, S.¹

15
- 0031996395
- Analysis, design, and iterative decoding of double serially concatenated codes with interleavers
- Feb.
- (1998) IEEE J. Select. Areas Commun. , vol.16 , pp. 231-244
- Benedetto, S.¹ Divsalar, D.² Montorsi, G.³ Pollara, F.⁴

16
- 0000387846
- On the serial concatenation of rate-one codes through uniform random interleavers
- presented at the, Monticello, IL, Sept. 22-24
- (1999) 37th Allerton Conf. Communication, Control, Computing
- Pfister, H.¹ Siegel, P.H.²

17
- 0030110651
- Iterative decoding of binary block and convolutional codes
- Mar.
- (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 429-431
- Hagenauer, J.¹ Offer, E.² Papke, L.³

18
- 0031642584
- Analysis of low density codes and improved designs using irregular graphs
- (1998) Proc. 30th Annu. ACM Symp. Theory Computing , pp. 249-258
- Luby, M.¹ Mitzenmacher, M.² Shokrollahi, A.³ Spielman, D.⁴

19
- 0001585514
- Coding theorems for 'turbolike' codes
- Urbana, IL, Sept. 23-25
- (1998) Proc. 36th Allerton Conf. , pp. 201-210
- Divsalar, D.¹ Jin, H.² McEliece, R.J.³

20
- 0004780741
- Concatenated Viterbi decoding
- Gotland, Sweden, Aug.
- (1989) Proc. Int. Workshop Information Theory , pp. 29-33
- Hagenauer, J.¹ Hoeher, P.²

21
- 0032155264
- Iterative detection in code-division multiple-access with error control coding
- Sept.-Oct.
- (1998) ETT , vol.9 , pp. 419-426
- Alexander, P.D.¹ Grant, A.J.² Reed, M.C.³

22
- 0002465539
- Low complexity turbo-like codes
- Sept.
- (2000) 2nd Int. Symp. Turbo Codes , pp. 73-80
- Divsalar, D.¹ Dolinar, S.² Pollara, F.³

23
- 0034225467
- Rate one-half code for approaching the Shannon limit by 0.1 dB
- July
- (2000) Electron. Lett. , vol.36 , Issue.15 , pp. 1293-1294
- Ten Brink, S.¹

24
- 0034450054
- Iterative decoding of nonsystematic turbo codes
- Sorrento, Italy, June
- (2000) Proc. IEEE Int. Symp. Inform. Theory , pp. 172
- Collins, O.M.¹ Takeshita, O.Y.² Costello D.J., Jr.³

25
- 0034447069
- The turbo decoding algorithm and its phase trajectories
- Sorrento, Italy, June
- (2000) Proc. IEEE Int. Symp. Inform. Theory , pp. 316
- Agrawal, D.¹ Vardy, A.²

26
- 0034450056
- Thresholds for turbo codes
- Sorrento, Italy, June
- (2000) Proc. IEEE Int. Symp. Inform. Theory , pp. 317
- Richardson, T.¹ Urbanke, R.²

27
- 0034447819
- Performance limits of concatenated codes with iterative decoding
- June
- (2000) Proc. IEEE Int. Symp. Inform. Theory , pp. 150
- Vialle, S.¹ Boutros, J.²

28
- 0035248618
- On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
- Feb.
- (2001) IEEE Commun. Lett. , vol.5 , pp. 58-60
- Chung, S.-Y.¹ Forney G.D., Jr.² Richardson, T.J.³ Urbanke, R.⁴

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.