563489578934
Sec. 1–11 Coding 21 Transmitter Noise Digital source m Encoder and other signal processing g(t) Carrier s(t) Transmission medium r(t) circuits (channel) r(t) Carrier circuits ~ g(t) Decoder and other signal processing m ~ Digital sink Figure 1–4 Receiver General digital communication system. However, these extra bits have the disadvantage of increasing the data rate (bits/s) and, consequently, increasing the bandwidth of the encoded signal. Codes may be classified into two broad categories: • Block codes. A block code is a mapping of k input binary symbols into n output binary symbols. Consequently, the block coder is a memoryless device. Because n 7 k, the code can be selected to provide redundancy, such as parity bits, which are used by the decoder to provide some error detection and error correction. The codes are denoted by (n, k), where the code rate R † is defined by R = k/n. Practical values of R range from 1 7 4 to 8, and k ranges from 3 to several hundred [Clark and Cain, 1981]. • Convolutional codes. A convolutional code is produced by a coder that has memory. The convolutional coder accepts k binary symbols at its input and produces n binary symbols at its output, where the n output symbols are affected by v + k input symbols. Memory is incorporated because v 7 0. The code rate is defined by R = k/n. Typical values for k and n range from 1 to 8, and the values for v range 1 7 from 2 to 60. The range of R is between 4 and 8 [Clark and Cain, 1981]. A small value for the code rate R indicates a high degree of redundancy, which should provide more effective error control at the expense of increasing the bandwidth of the encoded signal. Block Codes Before discussing block codes, several definitions are needed. The Hamming weight of a code word is the number of binary 1 bits. For example, the code word 110101 has a Hamming weight of 4. The Hamming distance between two code words, denoted by d, is the number of positions by which they differ. For example, the code words 110101 and 111001 have a distance of d = 2. A received code word can be checked for errors. Some of the errors can be † Do not confuse the code rate (with units of bits/bits) with the data rate or information rate (which has units of bits/s).
- Page 38: LIST OF SYMBOLS There are not enoug
- Page 42: List of Symbols xix l an integer n
- Page 46: List of Symbols xxi DEFINED FUNCTIO
- Page 50: C h a p t e r INTRODUCTION CHAPTER
- Page 54: Sec. 1-1 Historical Perspective 3 s
- Page 58: Sec. 1-2 Digital and Analog Sources
- Page 62: Sec. 1-4 Organization of the Book 7
- Page 66: Sec. 1-6 Block Diagram of a Communi
- Page 70: Sec. 1-7 Frequency Allocations 11 T
- Page 74: Sec. 1-8 Propagation of Electromagn
- Page 78: Sec. 1-8 Propagation of Electromagn
- Page 82: Sec. 1-9 Information Measure 17 In
- Page 86: Sec. 1-10 Channel Capacity and Idea
- Page 92: 22 Introduction Chap. 1 detected an
- Page 96: 24 Introduction Chap. 1 Constraint
- Page 100: 26 Introduction Chap. 1 Code Interl
- Page 104: 28 Introduction Chap. 1 where B is
- Page 108: 30 Introduction Chap. 1 When a conv
- Page 112: 32 Introduction Chap. 1 1-5 A cellu
- Page 116: C h a p t e r SIGNALS AND SPECTRA C
- Page 120: 36 Signals and Spectra Chap. 2 w(t)
- Page 124: 38 Signals and Spectra Chap. 2 For
- Page 128: 40 Signals and Spectra Chap. 2 V dc
- Page 132: 42 Signals and Spectra Chap. 2 aver
- Page 136: 44 Signals and Spectra Chap. 2 wher
Sec. 1–11 Coding 21<br />
Transmitter<br />
Noise<br />
Digital<br />
source<br />
m<br />
Encoder<br />
and other<br />
signal processing<br />
g(t)<br />
Carrier<br />
s(t)<br />
Transmission medium<br />
r(t)<br />
circuits<br />
(channel)<br />
r(t)<br />
Carrier<br />
circuits<br />
~<br />
g(t)<br />
Decoder<br />
and other<br />
signal processing<br />
m<br />
~<br />
Digital<br />
sink<br />
Figure 1–4<br />
Receiver<br />
General digital communication system.<br />
However, these extra bits have the disadvantage of increasing the data rate (bits/s) and,<br />
consequently, increasing the bandwidth of the encoded signal.<br />
Codes may be classified into two broad categories:<br />
• Block codes. A block code is a mapping of k input binary symbols into n output binary<br />
symbols. Consequently, the block coder is a memoryless device. Because n 7 k, the<br />
code can be selected to provide redundancy, such as parity bits, which are used by the<br />
decoder to provide some error detection and error correction. The codes are denoted by<br />
(n, k), where the code rate R † is defined by R = k/n. Practical values of R range from<br />
1 7<br />
4 to 8, and k ranges from 3 to several hundred [Clark and Cain, 1981].<br />
• Convolutional codes. A convolutional code is produced by a coder that has memory.<br />
The convolutional coder accepts k binary symbols at its input and produces n binary<br />
symbols at its output, where the n output symbols are affected by v + k input<br />
symbols. Memory is incorporated because v 7 0. The code rate is defined by<br />
R = k/n. Typical values for k and n range from 1 to 8, and the values for v range<br />
1 7<br />
from 2 to 60. The range of R is between<br />
4<br />
and<br />
8<br />
[Clark and Cain, 1981]. A small<br />
value for the code rate R indicates a high degree of redundancy, which should<br />
provide more effective error control at the expense of increasing the bandwidth of<br />
the encoded signal.<br />
Block Codes<br />
Before discussing block codes, several definitions are needed. The Hamming weight of a code<br />
word is the number of binary 1 bits. For example, the code word 110101 has a Hamming<br />
weight of 4. The Hamming distance between two code words, denoted by d, is the number of<br />
positions by which they differ. For example, the code words 110101 and 111001 have a<br />
distance of d = 2. A received code word can be checked for errors. Some of the errors can be<br />
† Do not confuse the code rate (with units of bits/bits) with the data rate or information rate (which has units<br />
of bits/s).