Bibliography

  • [BAH 74] BAHL L.R., COCKE J., JELINEK F. et al., “Optimal decoding of linear codes for minimizing symbol error rate”, IEEE Transactions on Information Theory, vol. 20, no. 2, pp. 284–287, 1974.
  • [BAR 95] BARBULESCU A.S., PIETROBON S.S., “Terminating the trellis of turbo-codes in the same state”, Electronics Letters, IET, vol. 31, no. 1, pp. 22–23, 1995.
  • [BAS 65] BASSALYGO L.A., “New upper bounds for error-correcting codes”, Problems of Information Transmission, vol. 1, no. 1, pp. 32–35, 1965.
  • [BAT 79] BATTAIL G., DECOUVELAERE M.C., GODLEWSKI P., “Replication decoding”, IEEE Transactions on Information Theory, vol. 25, no. 2, pp. 332–345, 1979.
  • [BAT 87] BATTAIL G., “Le décodage pondéré en tant que procédé de réévaluation d’une distribution de probabilité”, Annales des Télécommunications, vol. 42, pp. 499–509, 1987.
  • [BAT 89] BATTAIL G., “Construction explicite de bons codes longs”, Annales des Télécommunications, vol. 44, pp. 392–404, 1989.
  • [BAT 93] BATTAIL G., BERROU C., GLAVIEUX A., “Pseudo-random recursive convolutional coding for near-capacity performance”, Proceedings of GLOBECOM, Houston, TX, pp. 23–27, 1993.
  • [BAT 97] BATTAIL G., Théorie de l’information, Elsevier Masson, Paris, 1997.
  • [BEN 96a] BENEDETTO S., MONTORSI G., “Design of parallel concatenated convolutional codes”, IEEE Transactions on Communications, vol. 44, no. 5, pp. 591–600, 1996.
  • [BEN 96b] BENEDETTO S., MONTORSI G., “Unveiling turbo codes: some results on parallel concatenated coding schemes”, IEEE Transactions on Information Theory, vol. 42, no. 2, pp. 409–428, 1996.
  • [BEN 98] BENEDETTO S., GARELLO R., MONTORSI G., “A search for good convolutional codes to be used in the construction of turbo codes”, IEEE Transactions on Communications, vol. 46, no. 9, pp. 1101–1105, 1998.
  • [BEN 99] BENEDETTO S., BIGLIERI E., Principles of Digital Transmission with Wireless Applications, Kluwer Academic, New York, 1999.
  • [BER 68] BERLEKAMP E.R., Algebraic Coding Theory, Me Graw-Hill, New York, 1968.
  • [BER 93] BERROU C., GLAVIEUX A., THITIMAJSHIMA P., “Near Shannon limit error correcting coding and decoding: turbo-codes”, Proceedings of the International Conference on Communications, Geneva, Switzerland, pp. 1064–1070, May 1993.
  • [BER 04] BERROU C., SAOUTER Y., DOUILLARD C. et al., “Designing good permutations for turbo codes: towards a single model”, Proceedings of the International Conference on Communications, pp. 341–345, June 2004.
  • [BOS 60] BOSE R.C., RAY-CHAUDHURI D.K., “On a class of error correcting binary group codes”, Information Control, vol. 3, pp. 68–79, 1960.
  • [BRI 99] BRINK T. S., “Performance of an efficient parallel data transmission system”, Electronic Letters, vol. 35, no. 10, pp. 806 –808, May 1999.
  • [CAI 79] CAIN J.B., CLARK G.C., GEIST J.M., “Punctured convolutional codes of rate n − 1/n and simplified maximum likelihood decoding”, IEEE Transactions on Information Theory, vol. 25, pp. 97–100, 1979.
  • [CAM 86] CAMPBELL J.P., TREMAIN T.E., “Voiced/unvoiced classification of speech with applications to the U.S. Government LPC-10E Algorithm”, Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 473–476, June 1986.
  • [CAM 01] CAMPELLO J., MODHA D.S., RAJAGOPALAN S., “Designing LDPC codes using bit-filling”, Proceedings of the IEEE International Conference on Communications, vol. 1, pp. 55–59, 2001.
  • [CHA 72] CHASE D., “A class of algorithms for decoding block codes with channel measurement information”, IEEE Transactions on Information Theory, vol. 18, pp. 170–182, 1972.
  • [CHA 73] CHASE D., “A combined coding and modulation approach for communication over dispersive channels”, IEEE Transactions on Communications, IEEE, vol. 21, no. 3, pp. 159–174, 1973.
  • [CHE 04] CHEN L., XU J., DJURDJEVIC I. et al., “Near-Shannon-limit quasi-cyclic lowdensity parity-check codes”, IEEE Transactions on Communications, IEEE, vol. 52, no. 7, pp. 1038–1042, 2004.
  • [CHI 64] CHIEN R.T., “Cyclic decoding procedures for Bose-Chaudhuri-Hocquenghem codes”, IEEE Transactions on Information Theory, IEEE, vol. 10, no. 4, pp. 357–363, 1964.
  • [CHU 04] CHU W. C., Speech Coding Algorithms: Foundation and Evolution of Standardized Coders, John Wiley & Sons, New York, 2004.
  • [CON 92] CONWAY J.H., SLOANE N.J.A., Sphere Packings, Lattices and Groups, 2nd ed., Springer-Verlag, Berlin, 1992.
  • [COS 14] COSTELLO JR D.J., DOLECEK L., FUJA T.E. et al., “ Spatially coupled sparse codes on graphs: theory and practice”, Communications Magazine, IEEE, vol. 52, no. 7, pp. 168–176, 2014.
  • [COV 91] COVER T.M., THOMAS J.A., Elements of Information Theory, Wiley, 1991.
  • [CRO 05] CROZIER S., GUINAND P., “Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers”, Annales des Télécommunications, vol. 60, pp. 10–28, 2005.
  • [DEC 07] DECLERCQ D., FOSSORIER M., “Decoding algorithms for nonbinary LDPC codes over GF”, IEEE Transactions on Communications, IEEE, vol. 55, no. 4, pp. 633–643, 2007.
  • [DOL 95] DOLINAR S., DLVSALAR D., “Weight distributions for turbo codes using random and nonrandom permutations”, TDA Progress Report 42-122, Jet Propulsion Lab., 1995.
  • [DUR 10] DURRETT R., Probability: Theory and Examples, 4th ed., Cambridge University Press, 2010.
  • [ELI 54] ELIAS P., “Error-free coding”, IRE Transactions on Information Theory, vol. 4, no. 4, pp. 29–37, 1954.
  • [ELI 55] ELIAS P., “Coding for two noisy channels”, Proceedings of the 3rd London Symposium on Information Theory, London, UK, pp. 61–76, 1955.
  • [FOR 66] FORNEY G.D., Concatenated Codes, MIT Press, Cambridge, MA, 1966.
  • [FOR 73] FORNEY G.D., “The Viterbi algorithm”, Proceedings of the IEEE, vol. 61, no. 3, pp. 268–278, 1973.
  • [FOR 88] FORNEY G.D., “Coset codes-part 11: binary lattices and related codes”, IEEE Transactions on Information Theory, vol. 34, pp. 1152–1187, 1988.
  • [FOR 98] FORNEY Jr G.D., UNGERBOECK G., “Modulation and coding for linear Gaussian channels”, IEEE Transactions on Information Theory, IEEE, vol. 44, no. 6, pp. 2384–2415, 1998.
  • [FOS 04] FOSSORIER M.P., “Quasicyclic low-density parity-check codes from circulant permutation matrices”, IEEE Transactions on Information Theory, IEEE, vol. 50, no. 8, pp. 1788–1793, 2004.
  • [GAL 63] GALLAGER R.G., Low Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.
  • [GER 92] GERSHO A., GRAY R.M., Vector Quantization and Signal Compression, Kluwer Academic Publishers, 1992.
  • [GIB 88] GIBSON J.D., SAYOOD K., “Lattice quantization”, Advances in Electronics and Electron Physics, vol. 72, pp. 259–332, 1988.
  • [GOY 01] GOYAL V.K., “Theoretical foundations of transform coding”, IEEE Signal Processing Magazine, vol. 18, no. 5, pp. 9–21, 2001.
  • [GRA 82] GRAY R.M., ABUT H., “Full search and tree searched vector quantization of speech waveforms”, IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP ’82, pp. 593–596, June 1982.
  • [GRA 98] GRAY R.M., NEUHOFF D.L., “Quantization”, IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2325–2383, 1998.
  • [HAG 96] HAGENAUER J., OFFER E., PAPKE L., “Iterative decoding of binary block and convolutional codes”, IEEE Transactions on Information Theory, vol. 42, no. 2, pp. 429–445, 1996.
  • [HAG 04] HAGENAUER J., “The EXIT chart-introduction to extrinsic information transfer”, Iterative Processing, Proceedings of the 12th European Signal Processing Conference (EUSIPCO), pp. 1541–1548, 2004
  • [HAL 02] HALEY D., GRANT A., BUETEFUER J., “Iterative encoding of low-density parity-check codes”, Proceedings of the Global Telecommunications Conference, GLOBECOM’02, vol. 2, pp. 1289–1293, 2002.
  • [HOC 59] HOCQUENGHEM A., “Codes correcteurs d’erreurs”, Chiffres, vol. 2, pp. 147–156, 1959.
  • [HOK 99a] HOKFELT J., EDFORS O., MASENG T., “A survey on trellis termination alternatives for turbo codes”, Proceedings of the Vehicular Technology Conference, Houston, USA, pp. 2225–2229, May 1999.
  • [HOK 99b] HOKFELT J., EDFORS O., MASENG T., “Turbo codes: correlated extrinsic information and its impact on iterative decoding performance”, Proceedings of the 49th IEEE Vehicular Technology Conference (VTC), IEEE, vol. 3, pp. 1871–1875, 1999.
  • [HU 05] HU X.-Y., ELEFTHERIOU E., ARNOLD D.-M., “Regular and irregular progressive edge-growth tanner graphs”, IEEE Transactions on Information Theory, vol. 51, no. 1, pp. 386–398, 2005.
  • [HUF 52] HUFFMAN D.A., “A method for the construction of minimum redundancy codes”, Proceeding of the IRE, vol. 40, pp. 1098–1101, 1952.
  • [ITU 89] ITU-T, CCITT Recommendation G.711; pulse code modulation (PCM) of voice frequencies, 1989.
  • [ITU 90] ITU-T, CCITT Recommendation G.726 (12/90); 40, 32, 24, 16 kbit/s adaptive differential pulse code modulation (ADPCM), 1990.
  • [JEL 69] JELINEK F., “An upper bound on moments of sequential decoding effort”, IEEE Transactions on Information Theory, vol. 15, no. 2, pp. 464–468, 1969.
  • [JIM 99] JIMENEZ FELSTROM A., ZIGANGIROV K. S., “Time-varying periodic convolutional codes with low-density parity-check matrix”, IEEE Transactions on Information Theory, vol. 45, no. 6, pp. 2181–2191, 1999.
  • [JOH 99] JOHANNES SON R., ZIGANGIROV K.S., Fundamentals of Convolutional Coding, IEEE Press, Piscataway, NJ, 1999.
  • [JOH 01] JOHNSON S.J., WELLER S.R., “Construction of low-density parity-check codes from Kirkman triple systems”, Proceedings of the Global Telecommunications Conference, GLOBECOM’01, vol. 2, pp. 970–974, 2001.
  • [JPE 90] ITU-T, Recommendation T.81 ISO/IECIS 10918-1, 1990.
  • [JUA 82] JUANG B.H., GRAY A.H., “Multiple stage vector quantization for speech coding”, Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Paris, France, pp. 597–600, June 1982.
  • [KAI 80] KAILATH T., Linear Systems, Prentice-Hall, Englewood Cliffs, NJ, 1980.
  • [KOU 01] KOU Y., LIN S., FOSSORIER M.P., “Low-density parity-check codes based on finite geometries: a rediscovery and new results”, IEEE Transactions on Information Theory, IEEE, vol. 47, no. 7, pp. 2711–2736, 2001.
  • [KSC 01] KSCHISCHANG ER., FREY B.J., LOELIGER H.A., “Factor graphs and the sum-product algorithm”, IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 498–519, 2001.
  • [KSH 95] KSHISCHANG F, SOROKINE V., “On the trellis structure of block codes”, IEEE Transactions on Information Theory, vol. 41, pp. 1924−1937, 1995.
  • [LEG 94] LEGOFF S., GLAVIEUX A., BERROU C., “Turbo-codes and high spectral efficiency modulation”, Proceedings of the IEEE International Conference on Communications, pp. 645–649, 1994.
  • [LER 00] LE RUYET D., THIEN H.V., “Design of cycle optimized interleavers for turbo codes”, Proceedings of the International Symposium on Turbo Codes, pp. 335–338, 2000.
  • [LIN 80] LLNDE Y., BUZO A., GRAY R.M., “An algorithm for vector quantizer design”, IEEE Transactions on Communications, vol. 28, no. 1, pp. 84−95, 1980.
  • [LIN 83] LIN S., COSTELLO D., Error Control Coding: Fundamentals and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1983.
  • [LLO 82] LLOYD S., “Least squares quantization in PCM”, IEEE Transactions on Information Theory, IEEE, vol. 28, no. 2, pp. 129–137, 1982.
  • [LUB 98] LUBY M., MLTZENMACHER M., SHOKROLLAHI A. et al., “Improved low density parity codes using irregular graphs and belief propagation”, Proceedings of the International Symposium on Information Theory, Boston, USA, p. 117, September 1998.
  • [MAC 99] MACKAY D.J.C., “Good error-correcting codes based on very sparse matrices”, IEEE Transactions on Information Theory, vol. 45, pp. 399–431, 1999.
  • [MAC 03] MACKAY D.J., Information Theory, Inference, and Learning Algorithms, Cambridge University Press, 2003.
  • [MAK 75] MAKHOUL J., “Linear prediction: a tutorial review”, Proceedings of the IEEE, vol. 63, no. 4, pp. 561–580, 1975.
  • [MAN 74] MANDELBAUM D.M., “An adaptive-feedback coding scheme using incremental redundancy (corresp.)”, IEEE Transactions on Information Theory, IEEE, vol. 20, no. 3, pp. 388–389, 1974.
  • [MAS 69] MASSEY J., “Shift-register synthesis and BCH decoding”, IEEE Transactions on Information Theory, IEEE, vol. 15, no. 1, pp. 122-127, 1969.
  • [MAS 78] MASSEY J.L., “Foundations and methods of channel coding”, Proceedings of the International Conference on Information Theory and Systems, vol. 65, pp. 148–157, September 1978.
  • [MCE 96] MCELIECE R. J., “On the BCJR trellis for linear block codes”, IEEE Transactions on Information Theory, vol. 42, no. 4, pp. 1072–1092, 1996.
  • [MCE 98] MCELIECE R.J., MACKAY D. J., CHENG J.F., “Turbo decoding as an instance of Pearl’s belief propagation algorithm”, IEEE Journal on Selected Areas in Communications, vol. 16, pp. 140–152, 1998.
  • [PAN 95] PAN D., “A tutorial on MPEG/audio compression”, IEEE Multimedia, IEEE Computer Society, vol. 2, no. 2, pp. 60–74, 1995.
  • [PAP 02] PAPOULIS A., PILLAI S., Probability, Random Variables and Stochastic Processes, International Edition, 2002.
  • [PAS 76] PASCO R.C., Source coding algorithms for fast data compression, PhD Thesis, Department of Electrical Engineering, Stanford University, 1976.
  • [PIR 88] PIRET P., Convolutional Codes: An Algebraic Approach, MIT Press, Cambridge, MA, 1988.
  • [PIS 15] PLSCHELLA M., LE RUYET D., Digital Communication Volume 2, ISTE Ltd., London and John Wiley & Sons, New York, 2015.
  • [POL 94] POLTYREV G., “Bounds on the decoding error probability of binary linear codes via their spectra”, IEEE Transactions on Information Theory, vol. 40, no. 4, pp. 1284−1292, 1994.
  • [POL 10] POLYANSKIY Y., POOR H.V., VERDÚ S., “Channel coding rate in the finite blocklength regime”, IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2307–2359, 2010.
  • [PYN 94] PYNDIAH R., GLAVIEUX A., PLCART A. et al., “Near optimum product codes”, Proceedings of GLOBECOM, San Francisco, USA, pp. 339–343, 1994.
  • [RIC 01a] RICHARDSON T., URBANKE R., “The capacity of low density parity check codes under message passing algorithm”, IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 599–617, 2001.
  • [RIC 01b] RICHARDSON T., URBANKE R., “Efficient encoding of low-density parity-check codes”, IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 638–656, 2001.
  • [RIC 08] RICHARDSON T., URBANKE R., Modern Coding Theory, Cambridge University Press, Cambridge, MA, 2008.
  • [RIS 76] RLSSANEN J.J., “Generalized Kraft inequality and arithmetic coding”, IBM Journal Research and Development, vol. 20, no. 3, pp. 198–203, 1976.
  • [SAB 84] SABIN M.J., GRAY R.M., “Product code vector quantizers for speech and waveform coding”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 32, pp. 474–488, 1984.
  • [SAD 01] SADJADPOUR H.R., SLOANE N.J., SALEHI M. et al., “Interleaver design for turbo codes”, IEEE Journal on Selected Areas in Communications, IEEE, vol. 19, no. 5, pp. 831–837, 2001.
  • [SAL 98] SALAMI R., LAFLAMME C., ADOUL J. et al., “Design and description of CS-ACELR a toll quality 8 kb/s speech coder”, IEEE Transactions on Speech and Audio Processing, vol. 6, no. 2, pp. 116–130, 1998.
  • [SAL 07] SALOMON D., Data Compression, 4th ed., Springer-Verlag, London, 2007.
  • [SCH 85] SCHROEDER M., ATAL B., “Code-excited linear prediction (CELP): high-quality speech at very low bit rates”, Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 937–940, June 1985.
  • [SCH 06] SCHWARTZ M., VARDY A., “On the stopping distance and the stopping redundancy of codes”, IEEE Transactions on Information Theory, vol. 52, no. 3, pp. 922–932, 2006.
  • [SEG 76] SEGALL A., “Bit allocation and encoding for vector sources”, IEEE Transactions on Information Theory, vol. 22, no. 2, pp. 162–169, 1976.
  • [SHA 48] SHANNON C.E., “A mathematical theory of communication”, Bell System Technical Journal, vol. 27, pp. 623–659, 1948.
  • [SHA 59a] SHANNON C.E., “Probability of error for optimal codes in a Gaussian channel”, Bell System Technical Journal, Wiley Online Library, vol. 38, no. 3, pp. 611–656, 1959.
  • [SHA 59b] SHANNON C.E., “Coding theorems for a discrete source with a fidelity criterion”, IRE National Convention Record, vol. 7, pp. 142–163, 1959.
  • [SHA 67] SHANNON C.E., GALLAGER R.G., BERLEKAMP E.R., “Lower bounds to error probability for coding on discrete memoryless channels. I”, Information and Control, Elsevier, vol. 10, no. 1, pp. 65–103, 1967.
  • [SUL 12] SULLIVAN G.J., OHM J., HAN W.-J. et al., “Overview of the high efficiency video coding (HEVC) standard”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 22, no. 12, pp. 1649–1668, 2012.
  • [SUN 05] SUN J., TAKESHITA O.Y., “Interleavers for turbo codes using permutation polynomials over integer rings”, IEEE Transactions on Information Theory, vol. 51, no. 1, pp. 101–119, 2005.
  • [TAK 98] TAKESHITA O.Y., COSTELLO D.J., “New classes of algebraic interleavers for turbo-codes”, Proceedings of the IEEE International Symposium on Information Theory, Citeseer, pp. 419–419, 1998.
  • [TAU 02] TAUBMAN D.S., MARCELLIN M.W., JPEG 2000, Image Compression Fundamentals, Standards and Practice, Kluwer Academic, Norwell, MA, 2002.
  • [THO 03] THORPE J., “Low-density parity-check (LDPC) codes constructed from photographs”, JPN Progress Report, vol. 42, no. 154, pp. 42–154, 2003.
  • [VAI 93] VAIDYANATHAN P., Multirate Systems and Filter Banks, Prentice-Hall, Englewood Cliffs, NJ, 1993.
  • [VAI 08] VAIDYANATHAN P., The Theory of Linear Prediction, Morgan and Claypool Publishers, 2008.
  • [VAN 00] VAN DIJK M., EGNER S. MOTWANI R. et al., “Simultaneous zero-tailing of parallel convolutional codes”, Proceedings of the IEEE Int. Symp. Infor. Theory (ISIT), Sorrento, Italia, p. 368, June 2000.
  • [VIT 67] VITERBI A.J., “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm”, Proceedings of the IEEE International Symposium on Information Theory (ISIT), vol. 13, pp. 260–269, 1967.
  • [VIT 97] VITERBI A.J., VITERBI A.M., NICOLAS J. et al., “Perspectives on interleaved concatenated codes with iterative soft-output decoding”, Proceedings of the International Symposium on Turbo Codes, pp. 1−4, 1997.
  • [WIB 95] WIBERG N., LOELIGER H.A., KOTTER R., “Codes and iterative decoding on general graphs”, European Transactions on Telecommunication, vol. 6, no. 5, pp. 513–526, 1995.
  • [WIC 99] WICKER S.B., BHARGAVA V.K., Reed-Solomon Codes and Their Applications, John Wiley & Sons, 1999.
  • [WOL 78] WOLF J. K., “Efficient maximum likelihood decoding of linear block codes”, IEEE Transactions on Information Theory, vol. 24, pp. 76–80, 1978.
  • [XIA 04] XIAO H., BANIHASHEMI A.H., “Improved progressive-edge-growth (PEG) construction of irregular LDPC codes”, IEEE Communications Letters, vol. 8, no. 12, pp. 715–717, 2004.
  • [YAS 84] YASUDA Y., KASHIKI K., HIRATA H., “High rate punctured convolutional codes for soft-decision Viterbi decoding”, IEEE Transactions on Communications, vol. 32, pp. 315–319, 1984.
  • [ZAM 96] ZAMIR R., FEDER M., “On lattice quantization noise”, IEEE Transactions on Information Theory, vol. 42, pp. 1152–1159, 1996.
  • [ZIV 78] ZIV J., LEMPEL A., “Compression of individual sequences via variable rate coding”, IEEE Transactions on Information Theory, vol. 24, no. 5, pp. 530–536, 1978.
  • [ZWI 61] ZWICKER E., “Subdivision of the audible frequency range into critical bands (Frequenzgruppen)”, The Journal of the Acoustical Society of America, Acoustical Society of America, vol. 33, no. 2, pp. 248–248, 1961.
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset