{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Group 8 - redundant bits given large M If we let the total...

This preview shows pages 1–5. Sign up to view the full content.

Created by: Keaton Drake, Kevin Pfeil, Jordan Eberst, Aaron Goldstein

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Block Coding Type of Channel coding r Encodes large amounts of information into single n-digit code words r Reduces amount of information having to be transfer
Uses for Block Coding Block coding is used in: r Cell Phones r Compact Disc Players r Global Positioning Systems

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Possible to code the information so that it transmits at the maximum rate that the channel allows r Used to determine how much extra redundant information is needed r Transmission of M message bits given a probability of each bit being in error requires a proportion H(p) of additional
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: redundant bits, given large M. If we let the total number of bits be N, we have: N=M+NH(p) Work Cited Block Coding l http://www.mathworks.com/access/helpdesk/help/too lbox/comm/index.html?/access/helpdesk/help/toolbo x/comm/ug/a1039545258.htm r http://www.complextoreal.com/chapters/block.pdf r Shannons 2nd Theorem l http://ocw.mit.edu/NR/rdonlyres/Mathematics/18-310Fall-2004/A3A63B0C-F597-49C5-93E6-21F585ECECD8/0/error_correction.pdf r http://docs.happycoders.org/orgadoc/computer_scie nce_theory/www-math.mit.edu/shannon_bound.html...
View Full Document

{[ snackBarMessage ]}

### Page1 / 5

Group 8 - redundant bits given large M If we let the total...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online