메뉴 건너뛰기




Volumn 147, Issue 5, 2000, Pages 257-262

Ant colony algorithm for finding good interleaving pattern in turbo codes

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; DECODING; ERRORS; FUNCTIONS; ITERATIVE METHODS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES;

EID: 0034293904     PISSN: 13502425     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-com:20000446     Document Type: Article
Times cited : (10)

References (8)
  • 2
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the travelling salesman problem'
    • DORIGO, M., and GAMBARDELLA, L.: Ant colony system: a cooperative learning approach to the travelling salesman problem', IEEE Trails. Evol. Comput., 1997, 1, (1), pp. 53-66
    • (1997) IEEE Trails. Evol. Comput. , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.2
  • 3
    • 0030110651 scopus 로고    scopus 로고
    • Iterative decoding of binary block and convolutional codes'
    • HAGENAUER, J., OFFER, E., and PAPKE, L.: Iterative decoding of binary block and convolutional codes', IEEE Trans. Inf. Tlieory, 1996,42, (2), pp. 429-445
    • (1996) IEEE Trans. Inf. Tlieory , vol.42 , Issue.2 , pp. 429-445
    • Hagenauer, J.1    Offer, E.2    Papke, L.3
  • 5
    • 0003811543 scopus 로고    scopus 로고
    • A simple tight bound on error probability of block codes with application to turbo codes'
    • DIVSALAR, D.: A simple tight bound on error probability of block codes with application to turbo codes'. TMO Progress Report 42-139, 1999. Available at: http://tmo.jpl.nasa.gov/progress_report/42-139/139L.pdf
    • (1999) TMO Progress Report 42-139 , pp. 42-139
    • Divsalar, D.1
  • 6
    • 0033365367 scopus 로고    scopus 로고
    • Punctured turbo-codes for BPSK/ QPSK channels'
    • AÇİKEL, Ö., and RYAN, W.E.: Punctured turbo-codes for BPSK/ QPSK channels', IEEE Trans. Commun.. 1999,47, (9), pp. 1315-1323
    • (1999) IEEE Trans. Commun.. , vol.47 , Issue.9 , pp. 1315-1323
    • Açikel, Ö.1    Ryan, W.E.2
  • 7
    • 0033185275 scopus 로고    scopus 로고
    • Design of interleaves for turbo codes: Iterative interleaver growth algorithms of polynomial complexity'
    • DANESHGARAN, F., and MONDIN, M.: Design of interleaves for turbo codes: iterative interleaver growth algorithms of polynomial complexity', IEEE Tram. Inf. Tlieory, 1999, 45, (6), pp. 1845-1859
    • (1999) IEEE Tram. Inf. Tlieory , vol.45 , Issue.6 , pp. 1845-1859
    • Daneshgaran, F.1    Mondin, M.2


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