Modelling of Convolutional Encoders with Viterbi Decoders for Next Generation Broadband Wireless Access Systems

Benson Ojedayo, Ayodeji Ireti Fasiku, O. Elohor Oyinloye


Channel coding is known to be a form of modifying or scrambling a message between the source and the receiver so that the message is not corrupted before it is received; or in some cases known, the message may contain error. There are different forms of scrambling a message and detecting the error in the case there is one. The first is to request the message again called Automatic Repeat request (ARQ) and the other is to correct the message before getting to the destination Forward error correction (FEC). This research paper presents a system on the Convolutional encoding and the Viterbi decoding which is a Forward error correction method and the system was modelled using Matlab with special consideration for next generation broadband wireless access system.




Channel coding, Automatic Repeat request, Forward error correction, Matlab, Broadband Wireless Access System, Convolutional encoding and the Viterbi decoding

Full Text:



Thomas M Thompson. “From error-correcting codes through sphere packings to simple groups”. Mathematical association of America inc 1983

Graham Wade. “Coding Techniques (introduction to compression and error control)”. Palgrave 2000.

Drajic D. B, “60 Years of Shannon Information Theory” 8th International conference on Telecommunications in modern satellite and cable broadcasting services, 2007 pp 109-116.

Shannon C. E. “Mathematical Theory of Communication” Bell system Tech J. Vol 27, No 23, July 1948 pp 379-423

Hen Van Tiborg. “Error-correcting codes a first course”. Student literature Lund Sweden 1993

Shu Lin, Daniel Costello. “Error Control Coding Fundamentals and Applications” Prentice-Hall, Inc Englewood Cliffs, New Jersey 1983

John G Proakis, Masoud Salehi. “Digital Communications”. McGraw Hill 2008

C. Berrou, A. Glavieux, and P. Thitimajshima, B Near Shannon limit error- correcting coding and decoding: Turbo-codes,[ in Proc. Int. Conf. Communications (ICC ’93), Geneva, Switzerland, May 23–26, 1993, pp. 1064–1070

Peter Sweeney. “ Error Control Coding from theory to practice” John Wiley & Sons Ltd, 2002

Jerry D Gibson. “The communications handbook second edition” CRC press

Wicker, S and Bhargava, V.K. “ Reed Solomon Codes and their Applications, IEEE press, New Jersey 1994

A. Hocquenghem, Codes correcteurs d'erreurs, ChifFres, Vol. 2, pp. 147-156, 1959

R.C. Bose and D.K. Ray-Chaudhuri, On a class of error-correcting binary group codes,Information and Control, Vol. 3, pp. 68-79, 1960

I.S. Reed and G. Solomon, Polynomial codes over certain finite fields, J. Soc. Indust. Applied Math. Vol. 8, pp. 300–304, 1960

D.C. Gorenstein and N. Zierler, A class of error-correcting codes in pm symbols, J. Soc. Indust. Applied Math. Vol. 9, pp. 207-214, 1961

Mischa Schwartz. “Mobile Wireless Communications” Cambridge University Press 2005.

J. Wolfowitz, Coding Theorems of Information Theory, 2nd ed. New York: Sorinaer. 1964

D. Drajic, D. Bajic, “Communication System Performance: Achieving the Ultimate Information-Theoretic Limits?”, IEEE Comm. Mag., Vol. 40 (2002), No. 6, pp 124-129.

G. D. Forney, Jr., "Convolutional Codes II: Maximum-Likelihood Decoding," Information Control, vol. 25, June, 1974, pp. 222-226.

Lin, Ming-Bo, "New Path History Management Circuits for Viterbi Decoders," IEEE Transactions on Communications, vol. 48, October, 2000, pp. 1605-1608.

G.D Forney, Jr., “The Viterbi Algorithm,” Proceedings of the IEEE, vol. 61, pp. 268-278, March 1973


  • There are currently no refbacks.

Copyright (c)