ece 6332, spring, 2014 wireless communication

ECE 6332, Spring, 2014

Wireless Communication

Zhu Han

Department of Electrical and Computer Engineering

Class 19

Mar. 31st, 2014

OutlineOutline Review

– Hamming code (chapter 8.2.1, 8.2.2, 8.2.3)

Cyclic Code– CRC, 8.2.4

– BCH, 8.2.8

– RS, 8.2.9

Decision decoding – Hard v.s soft, 8.2.5

– Performance 8.2.6, 8.2.7

Common linear block codes, 8.2.8

Hamming Code ExampleHamming Code Example H(7,4)

Generator matrix G: first 4-by-4 identical matrix

Message information vector p

Transmission vector x

Received vector r

and error vector e

Parity check matrix H

Error CorrectionError Correction If there is no error, syndrome vector z=zeros

If there is one error at location 2

New syndrome vector z is

which corresponds to the second column of H. Thus, an error has been detected in position 2, and can be corrected

Cyclic codeCyclic code Cyclic codes are of interest and importance because

– They posses rich algebraic structure that can be utilized in a variety of ways.

– They have extremely concise specifications.

– They can be efficiently implemented using simple shift register

– Many practically important codes are cyclic

In practice, cyclic codes are often used for error detection (Cyclic redundancy check, CRC) – Used for packet networks

– When an error is detected by the receiver, it requests retransmission

– ARQ

BASICBASIC DEFINITIONDEFINITION of Cyclic Code of Cyclic Code

FFREQUENCY of CYCLIC CODESREQUENCY of CYCLIC CODES

EXAMPLE of a CYCLIC CODEEXAMPLE of a CYCLIC CODE

POLYNOMIALS POLYNOMIALS over over GF(GF(qq))

EXAMPLEEXAMPLE

Cyclic Code EncoderCyclic Code Encoder

Cyclic Code DecoderCyclic Code Decoder Divider

Similar structure as multiplier for encoder

Cyclic Redundancy Checks (CRC)

Example of CRC

Checking for errors

Capability of CRCCapability of CRC An error E(X) is undetectable if it is divisible by G(x). The

following can be detected.– All single-bit errors if G(x) has more than one nonzero term

– All double-bit errors if G(x) has a factor with three terms

– Any odd number of errors, if P(x) contain a factor x+1

– Any burst with length less or equal to n-k

– A fraction of error burst of length n-k+1; the fraction is 1-2^(-(-n-k-1)).

– A fraction of error burst of length greater than n-k+1; the fraction is 1-2^(-(n-k)).

Powerful error detection; more computation complexity compared to Internet checksum

BCH CodeBCH Code Bose, Ray-Chaudhuri, Hocquenghem

– Multiple error correcting ability

– Ease of encoding and decoding

Most powerful cyclic code– For any positive integer m and t<2^(m-1), there exists a t-error

correcting (n,k) code with n=2^m-1 and n-k<=mt.

Industry standards– (511, 493) BCH code in ITU-T. Rec. H.261 “video codec for

audiovisual service at kbit/s” a video coding a standard used for video conferencing and video phone.

– (40, 32) BCH code in ATM (Asynchronous Transfer Mode)

BCH PerformanceBCH Performance

Reed-Solomon CodesReed-Solomon Codes

An important subclass of non-binary BCH

Wide range of applications– Storage devices (tape, CD, DVD…)

– Wireless or mobile communication

– Satellite communication

– Digital television/Digital Video Broadcast(DVB)

– High-speed modems (ADSL, xDSL…)

1971: Mariner 91971: Mariner 9

Mariner 9 used a [32,6,16] Reed-Muller code to transmit its grey images of Mars.

camera rate:

100,000 bits/second

transmission speed:16,000 bits/second

1979+: Voyagers I & II1979+: Voyagers I & II Voyagers I & II used a [24,12,8] Golay code

to send its color images of Jupiter and Saturn.

Voyager 2 traveled further to Uranus and Neptune. Because of the higher error rate it switched to the more robust Reed-Solomon code.

Modern CodesModern Codes

More recently Turbo codes were invented, which are used in 3G cell phones, (future) satellites,and in the Cassini-Huygens spaceprobe [1997–].

Other modern codes: Fountain, Raptor, LT, online codes…

Next, next class

Error Correcting CodesError Correcting Codesimperfectness of a given code as the difference between the code's required Eb/No to attain a

given word error probability (Pw), and the minimum possible Eb/No required to attain the same Pw, as implied by the sphere-packing bound for codes with the same block size k and code rate r.