메뉴 건너뛰기




Volumn 41, Issue 2, 1995, Pages 441-447

On a Technique to Calculate the Exact Performance of a Convolutional Code

Author keywords

bit error probability; Convolutional codes; Viterbi algorithm

Indexed keywords

ALGORITHMS; BINARY CODES; BIT ERROR RATE; CALCULATIONS; COMPUTER SIMULATION; DECODING; ENCODING (SYMBOLS); MARKOV PROCESSES; PERFORMANCE; PROBABILITY;

EID: 0029272002     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.370145     Document Type: Article
Times cited : (48)

References (9)
  • 1
    • 0025218172 scopus 로고
    • Trellis coded quantization of memoryless and Gauss-Markov sources
    • Jan.
    • M. W. Marcellin and T. R. Fischer, “Trellis coded quantization of memoryless and Gauss-Markov sources,” IEEE Trans. Commun., vol. 38, pp. 82–92, Jan. 1990.
    • (1990) IEEE Trans. Commun. , vol.38 , pp. 82-92
    • Marcellin, M.W.1    Fischer, T.R.2
  • 3
    • 2942652810 scopus 로고
    • Analysis of decoders for convolutional codes by stochastic sequential machine methods
    • July
    • T. N. Morrissey, Jr., “Analysis of decoders for convolutional codes by stochastic sequential machine methods,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 460–469, July 1970.
    • (1970) IEEE Trans. Inform. Theory , vol.IT-16 , pp. 460-469
    • Morrissey, T.N.1
  • 4
    • 0014637439 scopus 로고
    • A Markovian analysis of Viterbi decoders for convolutional codes
    • Oct.
    • T. N. Morrissey, Jr., “A Markovian analysis of Viterbi decoders for convolutional codes,” in Proc. Nat. Electronics Conf., Oct. 1969, pp. 303–307.
    • (1969) Proc. Nat. Electronics Conf. , pp. 303-307
    • Morrissey, T.N.1
  • 5
    • 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, pp. 260–269, Apr. 1967.
    • (1967) IEEE Trans. Inform. Theory , vol.IT-13 , pp. 260-269
    • Viterbi, A.J.1
  • 6
    • 0018544680 scopus 로고
    • On a method of calculating the event error probability of convolutional codes with maximum likelihood decoding
    • Nov.
    • J. P. M. Schalkwijk, K. A. Post, and J. P. J. C. Aarts, “On a method of calculating the event error probability of convolutional codes with maximum likelihood decoding,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 737–743, Nov. 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , pp. 737-743
    • Schalkwijk, J.P.M.1    Post, K.A.2    Aarts, J.P.J.C.3
  • 7
    • 0028292891 scopus 로고
    • The normalized second moment of the binary lattice determined by a convolutional code
    • Jan.
    • A. R. Calderbank and P. C. Fishburn, “The normalized second moment of the binary lattice determined by a convolutional code,” IEEE Trans. Inform. Theory, vol. 40, pp. 166–174, Jan. 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 166-174
    • Calderbank, A.R.1    Fishburn, P.C.2
  • 9
    • 84911837213 scopus 로고
    • Communication in the presence of noise
    • Jan.
    • C. E. Shannon, “Communication in the presence of noise,” in Proc. IRE, vol. 37, pp. 10–21, Jan. 1949.
    • (1949) Proc. IRE , vol.37 , pp. 10-21
    • Shannon, C.E.1


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