13.07.2015 Views

View File - University of Engineering and Technology, Taxila

View File - University of Engineering and Technology, Taxila

View File - University of Engineering and Technology, Taxila

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

3. Huffman, D.A. (1952). A method for the construction <strong>of</strong> minimum redundancycodes, Proc. IRE, 40, 1098–1101.4. Fano, R.M. (1963). A heuristic discussion <strong>of</strong> probabilistic decoding, IEEE Trans.Information Theory, 9,64–74.5. Okunev, I.B. (1997). Phase <strong>and</strong> Phase-Difference Modulation in Digital Communications.Artech House.6. Lee, E.A. <strong>and</strong> Messerschmitt, D.G. (1994). Digital Communication. KluwerAcademic.7. Lin, S. (1970). An Introduction to Error Correcting Codes. Prentice-Hall.8. Huber, J. <strong>and</strong> Rueppel, A. (1990). Reliability estimation for symbols detected byTrellis decoders (in German), AEU, 44, 8–21.9. Lin, S. <strong>and</strong> Costello, D.J. (1983). Error Control Coding: Fundamentals <strong>and</strong>Applications. Prentice-Hall.10. Shamnugam, K.S. (1979). Digital <strong>and</strong> Analog Communication Systems. JohnWiley.11. Peterson, W.W. (1972). Error Correcting Codes. MIT Press.12. Bose, R.C <strong>and</strong> Ray-Chaudhuri, D.K. (1960). On a class <strong>of</strong> error correcting binarygroup codes, Information Control, 3,68–79.13. Pratt, T. <strong>and</strong> Bostian, C.W. (1986). Satellite Communications. John Wiley.14. Viterbi, A.J. (1967). Error bounds for convolutional codes <strong>and</strong> an asymptoticallyoptimum decoding algorithm, IEEE Trans. Information Theory, 13, 260–269.15. Viterbi, A.J. <strong>and</strong> Omura, J.K. (1979). Principles <strong>of</strong> Digital Communication <strong>and</strong>Coding. McGraw-Hill.16. Battail, G. (1989). Building long codes by combination <strong>of</strong> simple ones, thanks toweighted-output decoding, Proc. URSI ISSSE, Erlangen, 634–637.17. Berrou, C. <strong>and</strong> Glavieux, A. (1996). Near optimum error correcting coding <strong>and</strong>decoding, IEEE Trans. Communications, 44:10, 1261–1271.18. Proakis, J.G. (1995). Digital Communications. McGraw-Hill.19. Hashimoto, T. (1987). A list-type reduced-constraint generalization <strong>of</strong> the Viterbialgorithm, IEEE Trans. Information Theory, 26, 540–547.20. Sundberg, C.W. (1992). Generalizations <strong>of</strong> the Viterbi algorithm with applicationsin radio systems in Advanced Methods for Satellite <strong>and</strong> Deep Space Communications.Springer-Verlag.21. Rorabaugh, C.B. (1996). Error Coding Cookbook; Practical C=Cþþ Routines<strong>and</strong> Recipes for Error Detection <strong>and</strong> Correction. McGraw-Hill.22. Heller, J.A. <strong>and</strong> Jacobs, I.M. (1981). Viterbi decoding for satellite <strong>and</strong> spacecommunications, IEEE Trans. Communications, 19, 835–848.PROBLEMS1. A channel-coded CDMA system uses a rate 1=2, 7-stage convolutionalencoder before addressing at each transmitter. Determine by which factorCopyright © 2002 by Marcel Dekker, Inc. All Rights Reserved.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!