Modeling Error Sources in Digital Channels

IEEE Journal on Selected Areas in Communications

Volumn 11, Issue 3, 1993, Pages 340-347

  Turin, William ^a   Sondhi, M Mohan ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; PROBABILITY;

BAUM-WELCH RE-ESTIMATION ALGORITHM; DIGITAL CHANNEL ERROR MODELING; ERROR SOURCE MODELING; GILBERT'S MODEL; MARKOV MODELS; SINGLE-ERROR STATE MODELS;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0027577333     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.219549     Document Type: Article

References (15)

1. E. N. Gilbert, ' ‘' ‘Capacity of a burst-noise channel, Bell Syst. Tech. J., vol. 39, pp. 1253–1266, Sept. 1960.
2. L. N. Kanal and A. R. K. Sastry, “Models for channels with memory and their applications to error control,” Proc. IEEE, vol. 66, no. 7, July 1978.
3. W. Turin, Performance Analysis of Digital Transmission Systems. New York: Computer Science Press, 1990.
4. W. Turin, “Simulation of error sources in digital channels,” IEEE J. Select. Areas Commun., vol. 6, no. 1, pp. 85–93, Jan. 1988.
5. F. Swarts and H. C. Ferreira, “Modeling and performance evaluation of mobile VHF radio channels employing FSK, DPSK, QPSK and 8-ary PSK as modulation scheme,” in Proc. IEEE GLOBECOM ' ‘91, Phoenix, AZ, Dec. 1991, pp. 1935–1939.
6. B. D. Fritchman, “A binary channel characterization using partitioned Markov chains,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 221–227, Apr. 1967.
7. M.C. Jeruchim, P. Balaban, and K. S. Shanmugan, Simulation of Communication Systems. New York: Plenum, 1992.
8. L.E. Baum, T. Petrie, G. Soules, and N. Weiss, “A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains,” Ann. Math. Stat., vol. 41, pp. 164—171, 1970.
9. S. E. Levinson, L. R. Rabiner, and M. M. Sondhi, “An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition,” Bell Syst. Tech. J., vol. 62, no. 4, part 1, pp. 1035–1074, Apr. 1983.
10. D. E. Knuth, Art of Computer Programming. Addison, 1973, vol. 2.
11. F. R. Gantmacher, The Theory of Matrices. New York: Chelsea, 1959, vol. 1, p. 109.
12. G. Schwartz, “Estimating the dimension of a model,” Ann. Statist., vol. 6, no. 2, pp. 461–464, 1978.
13. J. Ziv and N. Merhav, “Estimating the number of states of a finite-state source,” IEEE Trans. Inform. Theory, vol. 38, no. 1, pp. 61–65, Jan. 1992.
14. M. B. Brilliant, “Observations of errors and error rates on T1 digital repeatered lines,” Bell Syst. Tech. J., vol. 57, no. 3, pp. 711–746, Mar. 1978.
15. R. R. Redner and H. F. Walker, “Mixture densities maximum likelihood and the EM algorithm,” SIAM Rev., vol. 26, no. 2, pp. 195–239, Apr. 1984.