electrical contractor near

Page 255

249

Letter

Probability

a

1/3

b

1/3

c

1/4

d

1/12 Table 6.8

(a) What is the average number of bits necessary to represent this alphabet? (b) Using a simple binary code for this alphabet, a two-bit block of data bits naturally emerges. Find an error correcting code for two-bit data blocks that corrects all single-bit errors. (c) How would you modify your code so that the probability of the letter a being confused with the letter d is minimized? If so, what is your new code; if not, demonstrate that this goal cannot be achieved. Problem 6.21: Universal Product Code The Universal Product Code (UPC), often known as a bar code, labels virtually every sold good. An example (Figure 6.40) of a portion of the code is shown.

d Figure 6.40

Here a sequence of black and white bars, each having width d, presents an 11-digit number (consisting of decimal digits) that uniquely identifies the product. In retail stores, laser scanners read this code, and after accessing a database of prices, enter the price into the cash register. (a) How many bars must be used to represent a single digit? (b) A complication of the laser scanning system is that the bar code must be read either forwards or backwards. Now how many bars are needed to represent each digit? (c) What is the probability that the 11-digit code is read correctly if the probability of reading a single bit incorrectly is pe ? (d) How many error correcting bars would need to be present so that any single bar error occurring in the 11-digit code can be corrected? Problem 6.22: Error Correcting Codes A code maps pairs of information bits into codewords of length-5 as follows. Data

Codeword

00

00000

01

01101

10

10111

11

11010 Table 6.9


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.