electrical contractor near

Page 239

233 what this code might be; it has never been found. Codes such as the Hamming code work quite well in practice to keep error rates low, but they remain greater than zero. Until the “magic” code is found, more important in communication system design is the converse. It states that if your data rate exceeds capacity, errors will overwhelm you no matter what channel coding you use. For this reason, capacity calculations are made to understand the fundamental limits on transmission rates. Exercise 6.34 (Solution on p. 259.) The first definition of capacity applies only for binary symmetric channels, and represents the number of bits/transmission. The second result states capacity more generally, having units of bits/second. How would you convert the first definition’s result into units of bits/second? Example 6.5 The telephone channel has a bandwidth of 3 kHz and a signal-to-noise ratio exceeding 30 dB (at least they promise this much). The maximum data rate a modem can produce for this wireline channel and hope that errors will not become rampant is the capacity. C = 3 × 103 log2 1 + 103 (6.62) = 29.901 kbps Thus, the so-called 33 kbps modems operate right at the capacity limit. Note that the data rate allowed by the capacity can exceed the bandwidth when the signal-to-noise ratio exceeds 0 dB. Our results for BPSK and FSK indicated the bandwidth they require exceeds T1 . What kind of signal sets might be used to achieve capacity? Modem signal sets send more than one bit/transmission using a number, one of the most popular of which is multi-level signaling. Here, we can transmit several bits during one transmission interval by representing bit by some signal’s amplitude. For example, two bits A can be sent with a signal set comprised of a sinusoid with amplitudes of ±A and ± . 2

6.32 Comparison of Analog and Digital Communication41 Analog communication systems, amplitude modulation (AM) radio being a typifying example, can inexpensively communicate a bandlimited analog signal from one location to another (point-to-point communication) or from one point to many (broadcast). Although it is not shown here, the coherent receiver (Figure 6.6) provides the largest possible signal-to-noise ratio for the demodulated message. An analysis of this receiver thus indicates that some residual error will always be present in an analog system’s output. Although analog systems are less expensive in many cases than digital ones for the same application, digital systems offer much more efficiency, better performance, and much greater flexibility. • Efficiency: The Source Coding Theorem allows quantification of just how complex a given message source is and allows us to exploit that complexity by source coding (compression). In analog communication, the only parameters of interest are message bandwidth and amplitude. We cannot exploit signal structure to achieve a more efficient communication system. • Performance: Because of the Noisy Channel Coding Theorem, we have a specific criterion by which to formulate error-correcting codes that can bring us as close to error-free transmission as we might want. Even though we may send information by way of a noisy channel, digital schemes are capable of error-free transmission while analog ones cannot overcome channel disturbances; see this problem (Problem 6.15) for a comparison. • Flexibility: Digital communication systems can transmit real-valued discrete-time signals, which could be analog ones obtained by analog-to-digital conversion, and symbolic-valued ones (computer data, for example). Any signal that can be transmitted by analog means can be sent by digital means, with the only issue being the number of bits used in A/D conversion (how accurately do we need to represent signal amplitude). Images can be sent by analog means (commercial television), but better communication performance occurs when we use digital systems (HDTV). In addition to digital 41 This

content is available online at http://cnx.org/content/m0074/2.11/.


Turn static files into dynamic content formats.

Create a flipbook

Articles inside

7.2 Permutations and Combinations

2min
page 262

7.1 Decibels

2min
page 261

Solutions

2min
page 265

Solutions

11min
pages 255-260

6.37 Communication Protocols

3min
page 239

6.34 Message Routing

2min
page 235

6.33 Communication Networks

3min
page 234

6.31 Capacity of a Channel

2min
page 232

6.30 Noisy Channel Coding Theorem

2min
page 231

6.28 Error-Correcting Codes: Channel Decoding

5min
pages 228-229

6.26 Block Channel Coding

2min
page 225

6.24 Channel Coding

3min
page 223

6.20 Entropy

1min
page 218

6.15 Frequency Shift Keying

2min
page 212

6.13 Digital Communication

2min
page 209

6.5 Line-of-Sight Transmission

3min
page 202

6.1 Information Communication

3min
page 195

6.12 Signal-to-Noise Ratio of an Amplitude-Modulated Signal

2min
page 208

6.9 Channel Models

2min
page 205

5.16 Discrete-Time Filtering of Analog Signals

3min
page 179

5.5 Discrete-Time Signals and Systems

6min
pages 152-153

2.1 Complex Numbers

8min
pages 11-13

5.14 Filtering in the Frequency Domain

8min
pages 172-175

Solutions

2min
page 30

3.9 The Impedance Concept

2min
page 48

5.4 Amplitude Quantization

5min
pages 150-151

3.16 Power Conservation in Circuits

3min
page 62

3.12 Equivalent Circuits: Impedances and Sources

3min
page 53
Issuu converts static files into: digital portfolios, online yearbooks, online catalogs, digital photo albums and more. Sign up and create your flipbook.