Book contents
- Frontmatter
- Contents
- Preface
- Notation
- Commonly used abbreviations
- 1 Channels, codes and capacity
- 2 Low-density parity-check codes
- 3 Low-density parity-check codes: properties and constructions
- 4 Convolutional codes
- 5 Turbo codes
- 6 Serial concatenation and RA codes
- 7 Density evolution and EXIT charts
- 8 Error floor analysis
- References
- Index
1 - Channels, codes and capacity
Published online by Cambridge University Press: 05 June 2012
- Frontmatter
- Contents
- Preface
- Notation
- Commonly used abbreviations
- 1 Channels, codes and capacity
- 2 Low-density parity-check codes
- 3 Low-density parity-check codes: properties and constructions
- 4 Convolutional codes
- 5 Turbo codes
- 6 Serial concatenation and RA codes
- 7 Density evolution and EXIT charts
- 8 Error floor analysis
- References
- Index
Summary
In this chapter we introduce our task: communicating a digital message without error (or with as few errors as possible) despite an imperfect communications medium. Figure 1.1 shows a typical communications system. In this text we will assume that our source is producing binary data, but it could equally be an analog source followed by analog-to-digital conversion.
Through the early 1940s, engineers designing the first digital communications systems, based on pulse code modulation, worked on the assumption that information could be transmitted usefully in digital form over noise-corrupted communication channels but only in such a way that the transmission was unavoidably compromised. The effects of noise could be managed, it was believed, only by increasing the transmitted signal power enough to ensure that the received signal-to-noise ratio was sufficiently high.
Shannon's revolutionary 1948 work changed this view in a fundamental way, showing that it is possible to transmit digital data with arbitrarily high reliability, over noise-corrupted channels, by encoding the digital message with an error correction code prior to transmission and subsequently decoding it at the receiver. The error correction encoder maps each vector of K digits representing the message to longer vectors of N digits known as codewords. The redundancy implicit in the transmission of codewords, rather than the raw data alone, is the quid pro quo for achieving reliable communication over intrinsically unreliable channels. The code rate r = K/N defines the amount of redundancy added by the error correction code.
- Type
- Chapter
- Information
- Iterative Error CorrectionTurbo, Low-Density Parity-Check and Repeat-Accumulate Codes, pp. 1 - 33Publisher: Cambridge University PressPrint publication year: 2009