메뉴 건너뛰기




Volumn 19, Issue 5, 1971, Pages 835-848

Viterbi Decoding for Satellite and Space Communication

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

EID: 0015142169     PISSN: 00189332     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1971.1090711     Document Type: Article
Times cited : (272)

References (12)
  • 1
    • 84911837213 scopus 로고
    • Communication is the presence of noise
    • C. E. Shannon, “Communication is the presence of noise,” Proc. IRE, vol. 37, Jan. 1949, pp. 10–21.
    • (1949) Proc. IRE , vol.37 , pp. 10-21
    • Shannon, C.E.1
  • 2
    • 79960849094 scopus 로고    scopus 로고
    • Coding system design for advanced solar missions
    • Final Rep. Contract NAS 2-3637, NASA Ames Res. Cent., Moffett Field, Calif.
    • Codex Corp., Final Rep. “Coding system design for advanced solar missions,” Contract NAS 2-3637, NASA Ames Res. Cent., Moffett Field, Calif.
  • 3
    • 0015143526 scopus 로고    scopus 로고
    • Convolutional codes and their performance in communication systems
    • this issue
    • A. J. Viterbi, “Convolutional codes and their performance in communication systems,” this issue, pp. 751–772.
    • Viterbi, A.J.1
  • 5
    • 0008359238 scopus 로고
    • Sequential decoding for efficient communication from deep space
    • Aug.
    • I. M. Jacobs. “Sequential decoding for efficient communication from deep space,” IEEE Trans. Commun. Technol., vol. COM-15, Aug. 1967, pp. 492–501.
    • (1967) IEEE Trans. Commun. Technol. , vol.COM-15 , pp. 492-501
    • Jacobs, I.M.1
  • 6
    • 84935113569 scopus 로고
    • Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
    • Apr.
    • A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, Apr. 1967, pp. 260–269.
    • (1967) IEEE Trans. Inform. Theory , vol.IT-13 , pp. 260-269
    • Viterbi, A.J.1
  • 7
    • 29144501260 scopus 로고
    • Short constraint length convolutional codes
    • Jet Propulsion Lab., California Inst. Technol., Space Programs Summary 37–54, Oct./Nov.
    • J. A. Heller, “Short constraint length convolutional codes,” Jet Propulsion Lab., California Inst. Technol., Space Programs Summary 37–54, vol. III, Oct./Nov., 1968, pp. 171–177.
    • (1968) , vol.3 , pp. 171-177
    • Heller, J.A.1
  • 8
    • 64149119269 scopus 로고
    • Improved performance of short constraint length convolutional codes
    • Jet Propulsion Lab., California Inst. Technol., Space Programs Summary 37–56, Feb./Mar.
    • —, “Improved performance of short constraint length convolutional codes,” Jet Propulsion Lab., California Inst. Technol., Space Programs Summary 37–56, vol. III, Feb./Mar. 1969, pp. 83–84.
    • (1969) , vol.3 , pp. 83-84
    • Heller, J.A.1
  • 9
    • 84892268592 scopus 로고    scopus 로고
    • Coding systems study for high data rate telemetry links
    • Final Rep. Contract NAS2-6024, NASA Ames Res. Ctr. Rep. CR-114278, Moffett Field, Calif
    • Linkabit Corp., Final Rep., “Coding systems study for high data rate telemetry links,” Contract NAS2-6024, NASA Ames Res. Ctr. Rep. CR-114278, Moffett Field, Calif.
  • 10
    • 0003534277 scopus 로고
    • Optimum decoding of convolutional codes
    • Ph.D. dissertation, Syst. Sci. Dep., Univ. California, Los Angeles
    • J. P. Odenwalder, “Optimum decoding of convolutional codes,” Ph.D. dissertation, Syst. Sci. Dep., Univ. California, Los Angeles, 1970.
    • (1970)
    • Odenwalder, J.P.1
  • 12
    • 58149398127 scopus 로고
    • On the Viterhi decoding algorithm
    • (Corresp.) Jan
    • J. K. Omura, “On the Viterhi decoding algorithm,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-15, Jan. 1969, pp. 177–179.
    • (1969) IEEE Trans. Inform. Theory , pp. 177-179
    • Omura, J.K.1


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