2018/11/1 Thursday. YU Xiangyu
|
|
- Aubrey Loren Chapman
- 5 years ago
- Views:
Transcription
1 2018/11/1 Thursday YU Xiangyu
2
3 Introduction ARQ FEC Parity Check Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Turbo Codes LDPC
4 Information to be transmitted Source coding Channel coding Modulation Transmitter Antenna Air Antenna Information received Source decoding Channel decoding Demodulation Receiver
5 Channel coding: Purpose: to improve the reliability of signal transmission. Method: to add some redundant bits in order to discover or correct errors. Error control: all error correction measures including channel coding. Causations for producing error symbols: Intersymbol interference evoked by multiplicative interference. Signal to noise ratio reduction caused by additive interference. Fan P278
6 According to the statistical characteristics of the error symbols caused by additive interference: Random channel: Error symbols occur randomly, e.g., error symbols caused by additive noise. Burst channel: the occurrence is relatively concentrated, e.g., the error symbols caused by pulse interference. Mixed channel Fan P278
7 Terminal A Terminal B Transmission in only one direction (a) Terminal A Or Terminal B Transmission in either direction, but not simulaneously (b) Terminal A Terminal B Transmission in both directions simultaneously (c) Figure Terminal connectivity classifications. (a) Simplex. (b) Half-duplex. (c) Full-duplex. Sklar P
8 Error detection and retransmission: Utilizes redundant bits added to the data to detect that an error has been made. The error symbols can be discovered, but the locations of the errors can t be determined. The receiving terminal does not attempt to correct the error; it simply requests that the transmitter retransmit the data. The communication systems need to have the bidirectional channels. Sklar P315 Fan P
9 Feedback check: The received symbols will be returned to the transmitter for comparison of them with the original transmitted symbols. Disadvantages: need of bidirectional channel and rather low transmission efficiency. Error detection and deletion: When the error symbols are discovered in the receiver, they will be deleted immediately. It is suitable only in systems where a lot of redundancy exists in the transmitting symbols, and the deleted part of the received symbols doesn t influence the application. Fan P
10 Error detection codes Detects the presence of an error Automatic repeat request(arq) protocols Block of data with error is discarded Transmitter retransmits that block of data Error correction codes, or forward correction codes (FEC) Designed to detect and correct errors Stallings P193
11 FEC: utilizes the error control symbols attached not only to discover the error symbols, but also to correct the error symbols. requires a one-way link only not all error patterns can be corrected; errorcorrecting codes are classified according to their error-correcting capabilities!!!! Fan P
12 Source Transmitter Channel Receiver Destination Encoder Transmit controller Modulation Demodulation Decoder Transmit controller Acknowledge
13 Transmitting data Retransmission Transmitter Transmission Receiver 1 ACK Received data ACK NAK ACK ACK NAK Error Error (a) Output data ACK: Acknowledge Time NAK: Negative ACK Figure Automatic repeat request (ARQ). (a) Stop-and-wait ARQ (half-duplex). Fan P280 Sklar P
14 Tomasi Advanced Electronic Communications Systems, 6e FIGURE Example of stop-and-wait flow control
15 Transmitter Transmitting data Transmission Receiver 1 2 Received data ACK ACK ACK NAK ACK ACK ACK ACK ACK Error (b) Go-back 4 Go-back 7 ACK ACK ACK Error NAK ACK ACK ACK 7 8 ACK ACK Figure Continuous ARQ with pullback (full-duplex). Fan P280 Sklar P316
16 Transmitting data Retransmission Retransmission Transmitter Transmission Receiver ACK Received data ACK ACK NAK ACK ACK ACK ACK Error (c) ACK ACK ACK Error NAK ACK ACK ACK ACK ACK Figure Continuous ARQ With selective repeat (full-duplex). Sklar P316
17 Advantages Less parity symbols, higher code rate The calculation complexity of error detection is low. It can adapt the different characteristics of the channels Disadvantages It requires duplex channels cannot be used in the unidirection communication systems or broadcasting systems. The transmission efficiency is decreased due to retransmission. When the channel interference is serious, communication is virtually interrupted. Fan P
18 The major advantage of ARQ over forward error correction (FEC) is that error detection requires much simpler decoding equipment and much less redundancy than does error correction. Also, ARQ is adaptive in the sense that information is retransmitted only when errors occur. On the other hand, FEC may be desirable in place of, or in addition to, error detection, for any of the following reasons: 1. A reverse channel is not available or the delay with ARQ would be excessive. 2. The retransmission strategy is not conveniently implemented. 3. The expected number of errors, without corrections, would require excessive retransmissions. Sklar P
19 Error detection requires retransmission Detection inadequate for wireless applications Error rate on wireless link can be high, results in a large number of retransmissions Long propagation delay compared to transmission time
20 The key idea of FEC is to transmit enough redundant data to allow receiver to recover from errors all by itself. No sender retransmission required A simple redundancy is to attach a parity bit
21 No errors present Codeword produced by decoder matches original codeword Decoder detects and corrects bit errors Decoder detects but cannot correct bit errors; reports uncorrectable error Decoder detects no bit errors, though errors are present
22 Transmitter For a given frame, an error-detecting code (check bits) is calculated from data bits Check bits are appended to data bits Receiver Separates incoming frame into data bits and check bits Calculates check bits from received data bits Compares calculated check bits against received check bits Detected error occurs if mismatch Stallings P194
23 Error Detection Process Beard P276
24 Forward Error Correction Process Beard P283
25 Adopting error-correction coding for decrease of error symbol probability, the price paid is increase of bandwidth. Figure Performance of digital systems with and without coding. Fan P284 Couch P54
26 The information capacity (or channel capacity) C of a continuous channel with bandwidth B Hertz can be perturbed by additive Gaussian white noise of power spectral density N 0 /2, provided bandwidth B satisfies P C Blog 2 1 bits / sec ond N0B where P is the average transmitted power P = E b R b (for an ideal system, R b = C) E b is the transmitted energy per bit R b is transmission rate
27 log 1 1 log lim 1 1 log lim 1 1 log 1 lim 1 1 log lim 1 log lim 1 log lim 0 n S e n S X n S X n S S W n S n S W n S n S W n Wn S W N S W C X X X X S W n W W W W
28 R b /B Region for which R b >C Capacity boundary R b =C 1 Shannon Limit Region for which R b <C E b /N 0 db 0.1 E b is the transmitted energy per bit N 0 is the Gaussian white noise of power spectral density R b is the transmission rate B is the channel with bandwidth C is the channel capacity
29 ISBN Some cash
30 1 st generation Group identifier Publisher identifier Title identifier Check digit ISBN: ((7*10+8*9+0*8+2*7+2*6+5*5+3*4+2*3+1* 2)%11)=7 10->X 11->0
31 2 nd generation ((9*1+7*3+8*1+7*3+8*1+0*3+2*1+2*3+5*1+ 3*3+2*1+1*3)%10)=6 10->0
32 =7
33 =16 1+6= =34 3+4=7
34 The major categories of FEC codes are Block codes Cyclic codes Convolutional codes, Turbo codes, etc.
35 Parameters of the code sequence n - total number of symbols in the code sequence k - number of information symbols in the code sequence r - number of error control symbols in the code sequence k/n - code rate (n - k) / k = r / k - redundancy Fan P279
36 0-> >
37 echo on ep=0.3; for i=1:2:61 p(i)=0; for j=(i+1)/2:i p(i)=p(i)+prod(1:i)/(prod(1:j)*prod(1:(i-j)))*ep^j*(1-ep)^(i-j); echo off ; end end echo on ; pause % Press a key to see the plot. stem((1:2:61),p(1:2:61)) xlabel('n') ylabel('pe') title('error probability as a function of n in simple repetition code')
38 pe 0.35 Error probability as a function of n in simple repetition code n
39 Assume that a sequence of eight bits is encoded using a (5,1,5) repetition encoder. Suppose that we receive the following bit sequence at the output of a binary channel that introduces occasional bit errors. Assume bit index 0 corresponds to the start of the received codeword corresponding to the first bit. If at most two bit errors occur within each codeword, what was the transmitted sequence of eight bits? Edx
40 Parity bit appended to a block of data One dimensional parity-check code Classified into odd parity code and even parity code. Even parity Added bit ensures an even number of 1s Odd parity Added bit ensures an odd number of 1s Example, 7-bit character [ ] Even parity [ ] Odd parity [ ] Fan P Beard P
41 In the even check code, the check bit is so designed that the summation of all the bits in the codeword yields an even result: an 1 an 2 a0 0 The check bit in odd check codes makes the number of 1s in the codeword be odd: an 1 an 2 a0 1 where a 0 is the check bit, other bits are information bits. In the parity-check code, there is only one check bit, so the code rate equals k/(k+1). Fan P
42 Consider a (n, k, 4) block code, where 6 parity bits [P1 P2 P3 P4 P5 P6] are generated for 6 data bits [D1 D2 D3 D4 D5 D6]. The values of the parity bits are computed by arranging the data and parity bits in a block as shown below. The first 5 parity bits are generated to ensure that all rows and columns containing data bits have even parity, and the last parity bit P6 ensures that the entire code word has even parity. The resulting codeword is[d1 D2 D3 D4 D5 D6 P1 P2 P3 P4 P5 P6]. Edx
43 What are the values of n and k for the code above? n=12 k=6 Assume we are interested in only detecting, but not correcting, bit errors. What is the maximum number of bit errors per codeword that can be detected using this coding scheme? 3 Edx
44 Suppose that the received codeword is [ ]. Assuming that at most one bit error occurred during transmission, what was the transmitted codeword? Edx
45 Suppose that the received codeword is [ ]. Assume that at most two bit errors have occurred. Which of the following statements is incorrect? The transmitted codeword could have been [ ]. The transmitted codeword could have been [ ]. The transmitted codeword could have been [ ]. The transmitted codeword could have been [ ]. Edx
46 Assume: there is a code composed of 3 binary symbols, so there are 2 3 = 8 different possible codewords: 000 fine 001 cloud 010 overcast 011 rain 100 snow 101 frost 110 fog 111 hail Now, if the error symbols occur, then error information will be received. Fan P281
47 If only 4 codewords among these 8 codewords are allowed to be used for transmission of the weather, e.g., let 000 fine 011 cloud 101 overcast 110 rain are permission codewords, other 4 kinds are forbidden codewords. Then, the receiver can detect one error symbol in a codeword. This code can only detect the error symbols, and cannot correct the error symbols. Fan P281
48 If only two permission codewords are defined: for example 000 fine 111 rain then the code can detect at most two error symbols, or correct one error symbol. Fan P281
49 Information is divided into blocks of length k, r parity bits or check bits are added to each block (total length n = k + r) Block codeword = information bits + check bits Expression of block code: (n, k) where n - total length of codeword k - number of information bits r = n k - number of check bits Code rate R = k/n Decoder looks for codeword closest to received vector (code vector + error vector) Fan P282
50 Consider a communication system using the block code illustrated below. Suppose we transmit bits using 25 samples per bit at a rate of Fs=1M samples per second. What is the net bit rate of our communication system in bits per second? Edx
51 a n-1 a n-2... a r a r-1 a n-2... a 0 t k information bits r check bits Code length n = k + r Fan P282
52 Tradeoffs between Efficiency Reliability Encoding/Decoding complexity Modulo 2 Addition
53 The codeword in the table is a (3, 2) code. Information bits Check bits Fine 00 0 Cloud 01 1 Overcast 10 1 Rain 11 0 Fan P282
54 Code weight: number of 1s in the codeword Code distance: the number of bits which have different values in the corresponding locations of two codewords, and also called Hamming distance Minimum code distance (d 0 ): minimum distance among the codewords Fan P282
55 Hamming distance for 2 n-bit binary sequences, the number of different bits E.g., v 1 =011011; v 2 =110001; d(v 1, v 2 )=3 Redundancy ratio of redundant bits to data bits Code rate ratio of data bits to total bits Coding gain the reduction in the required E b /N 0 to achieve a specified BER of an error-correcting coded system Beard P
56 Geometic meaning of code distance: by using a code with n = 3 as example a 1 (0,1,0) (1,1,0) (0,1,1) (1,1,1) (0,0,0) (1,0,0) a 2 a 0 (0,0,1) (1,0,1) General speaking, code distance is the Hamming distance between the vertexes of a unit regular polyhedron in an n dimensional space. 56 Fan P282
57 Error correction and detection abilities of a code are decided by the minimum code distance d 0. For detecting e error symbols, require d0 e A B e d 0 Hamming distance Two codewords with code distance 3 For correcting t error symbols, require d0 2t A B t d 0 t Hamming distance Fan P283
58 Figure (a) Hamming distance d(c i, c j ) 2t 1. (b) Hamming distance d(c i, c j ) 2t. The received vector is denoted by r. Haykin P638
59 For correcting t error symbols, and detecting e error symbols at the same time, require d e t 1 ( e ) 0 t A t e 1 B t Hamming distance (c) Two codewords with code distance (e + t + 1) Error correction and detection combination mode: When the number of error symbols is small, the system operates according to the FEC mode so as to save retransmission time and improve transmission efficiency. When the number of the error symbols is large, the system operates according to error detection with retransmission mode so as to reduce the total bit error probability. Fan P283
60 The figure illustrates, with a simple geometric analogy, the structure behind linear block codes. We can imagine the vector space V n comprising 2 n n-tuples. Within this vector space there exists a subset of 2 k n-tuples making up a subspace. These 2 k vectors or points, shown sprinkled among the more numerous 2 n points, represent the legitimate or allowable codeword assignments. Sklar P330
61 The basic goals in choosing a particular code, similar to the goals in selecting a set of modulation waveforms, can be stated as follows: 1. We strive for coding efficiency by packing the V n space with as many codewords as possible. This is tantamount to saying that we only want to expend a small amount of redundancy (excess bandwidth). 2. We want the codewords to be as far apart from one another as possible, so that even if the vectors experience some corruption during transmission, they may still be correctly decoded, with a high probability. Sklar P330
62 Examine the following coding assignment that describes a (6, 3) code. There are 2 k = 2 3 = 8 message vectors, and therefore eight codewords. There are 2 k = 2 6 = sixty-four 6-tuples in the V 6 vector space: Sklar P330
63 Suppose we receive the following bitstream If we assume that we can both detect and correct errors, what was the original bit stream?
64 For a (8, 4) block code with minimum code distance is 3, which one of the following statements is incorrect? Each codeword contains 4 message bits. The code rate is 0.5. We can detect 3 bit errors. We can detect and correct 1 bit errors. Edx
65 Consider a repetition code where codewords are formed by repeating each bit five times. What are the values of (n,k) and minimum code distance for this code? (5,1) D=5 Suppose we wish to detect, but not correct errors in each received codeword. What is the maximum number of bit errors that we can detect? 4
66 Suppose we wish to detect and correct errors in each received codeword. What is the maximum number of bit errors that we can detect and correct? 2
67 Which of the following statement(s) is(are) generally true about channel coding? Channel coding reduces the bit error rate of a communication system. Channel coding reduces bit errors by increasing the signal to noise ratio of the received signal. Channel coding relies on redundancy to detect or correct bit errors If there are two codewords in an error correcting code that differ by 3 bits, then this error correcting code can always detect errors in two bits per codeword. Edx
68 Designed to correct single bit errors Family of (n, k) block error-correcting codes with parameters: Block length: n = 2 m 1 Number of data bits: k = 2 m m 1 Number of check bits: n k = m Minimum distance: d min = 3 Single-error-correcting (SEC) code SEC double-error-detecting (SEC-DED) code Beard P
69 Concept of cyclic codes Cyclicity is designated in a way that any codeword obtained by an end-around shift of a codeword in a code is also a codeword in this code. Fan P
70 General condition If (a n-1 a n-2 a 0 ) is a codeword of a cyclic code, then the codewords after cyclic shift (a n-2 a n-3 a 0 a n-1 ) (a n-3 a n-4 a n-1 a n-2 ) (a 0 a n-1 a 2 a 1 ) are still the codewords of this code. Fan P292
71 Example: All codewords of a (7, 3) cyclic code are as follows: No. of codeword Information bit Paritycheck bit No. of codeword Information bit Paritycheck bit a 6 a 5 a 4 a 3 a 2 a 1 a 0 a 6 a 5 a 4 a 3 a 2 a 1 a If the second codeword in this table shifted one bit to the right, then it will become the fifth codeword; if the fifth codeword cyclic shifts one bit to the right, then it will become the seventh codeword. Fan P
72 Can be encoded and decoded using linear feedback shift registers (LFSRs) Takes fixed-length input (k) and produces fixedlength check code (n-k) In contrast, CRC error-detecting code accepts arbitrary length input for fixed-length check code Beard P291
73 Polynomial expression A codeword (a n-1 a n-2 a 0 ) with length n can be expressed as x in the above equation has not any meaning, and only its power is used to represent the location of the symbol. For example: the codeword can be expressed as ) ( a x a x a x a x T n n n n ) ( x x x x x x x x x x T Fan P
74 Cyclic Redundancy Code (CRC) is an error-checking code The transmitter appends an extra n-bit sequence to every frame called Frame Check Sequence (FCS). The FCS holds redundant information about the frame that helps the receivers detect errors in the frame CRC is based on polynomial manipulation using modulo arithmetic. Blocks of input bit as coefficient-sets for polynomials is called message polynomial. Polynomial with constant coefficients is called the generator polynomial
75
76 Generator polynomial is divided into the message polynomial, giving quotient and remainder, the coefficients of the remainder form the bits of final CRC Define: Q The original frame (k bits) to be transmitted F The resulting frame check sequence (FCS) of n-k bits to be added to Q (usually n = 8, 16, 32) J The cascading of Q and F P The predefined CRC generating polynomial The main idea in CRC algorithm is that the FCS is generated so that J should be exactly divisible by P Beard P
77 The CRC creation process is defined as follows: Get the block of raw message Left shift the raw message by n bits and then divide it by p Get the remainder R as FCS Append the R to the raw message. The result J is the frame to be transmitted J=Q.x n-k +R J should be exactly divisible by P Dividing Q.x n-k by P gives Q.x n-k /P=Q+R/P Where R is the reminder J=Q.x n-k +R. This value of J should yield a zero reminder for J/P Beard P
78 Widely used versions of P(X) CRC 12 X 12 + X 11 + X 3 + X 2 + X + 1 CRC 16 X 16 + X 15 + X CRC CCITT X 16 + X 12 + X CRC 32 X 32 + X 26 + X 23 + X 22 + X 16 + X 12 + X 11 + X 10 + X 8 + X 7 + X 5 + X 4 + X 2 + X + 1 Beard P280
79 Dividing circuit consisting of: XOR gates Up to n k XOR gates Presence of a gate corresponds to the presence of a term in the divisor polynomial P(X) A shift register String of 1-bit storage devices Register contains n k bits, equal to the length of the FCS Beard P280
80 Tomasi Advanced Electronic Communications Systems, 6e FIGURE CRC-16 generating circuit
81 Input msg: ( ) Using CRC-16 S(D)=D 7 +D 5 +D 4 +D 2 +D 1 +1 (K=8) g(d)=d 16 +D 15 +D 2 +1 (L=16)
82 1 1) ( ) ( Remainder 1 Remainder ) ( ) ( Remainder ) ( D D D D D D D D D D D D D D D D D D D D D D D D D D D g D D S D C L =D 9 +D 8 +D 7 +D 5 +D 4 +D = 0 D D D D D D D 9 +1 D 8 +1 D 7 +0 D 6 +1 D 5 +1 D 4 +0 D 3 +0 D 2 +1 D 1 +0
83 ( ) ( ) 0 ) ( ) ( mainder Re D g D R ) ( r r D D r D r D R L K L K L K L K
84 Most widely used channel code Encoding of information stream rather than information blocks Decoding is mostly performed by the Viterbi The constraint length K for a convolution code is defined as K=M+1 where M is the maximum number of stages in any shift register The code rate r is defined as r = k/n where k is the number of parallel information bits and n is the the number of parallel output encoded bits at one time interval
85 Generates redundant bits continuously Error checking and correcting carried out continuously (n, k, K) code Input processes k bits at a time Output produces n bits for every k input bits K = constraint factor k and n generally very small n-bit output of (n, k, K) code depends on: Current block of k input bits Previous K-1 blocks of k input bits Beard P299
86 Convolution codes Features of convolution code: The parity-check bits are not only related to the present information segment of k bits, and also related to the previous m = (N 1) information segments. N is called constraint length of the codeword. Convolution codes are denoted as (n, k, m), where the code rate is k/n. Fan P
87 Figure Convolutional encoding (k = 3, n = 4, K = 5, and R = 3/4). Couch P50
88 1 0 x Input 1 0 D1 D0 1 1 D2 D y 1 y1 2 Output c D 1, D 2 - Registers Input x: Output y 1 y 2 : Input x: Output y 1 y 2 :
89 10/1 01/ / /0 00/1 11/1 11/ /0
90 0 00 First input First output
91
92 Trellis diagram expanded encoder diagram Viterbi code error correction algorithm Compares received sequence with all possible transmitted sequences Algorithm chooses path through trellis whose coded sequence differs from received sequence in the fewest number of places Once a valid path is selected as the correct path, the decoder can recover the input data bits from the output code bits Beard P
93 The Viterbi algorithm removes from consideration those trellis paths that could not possibly be candidates for the maximum likelihood choice. When two paths enter the same state, the one having the best metric is chosen; this path is called the surviving path. This selection of surviving paths is performed for all the states. The decoder continues in this way to advance deeper into the trellis, making decisions by eliminating the least likely paths. Sklar P401
94 The early rejection of the unlikely paths reduces the decoding complexity. Note that the goal of selecting the optimum path can be expressed, equivalently, as choosing the codeword with the maximum likelihood metric, or as choosing the codeword with the minimum distance metric. Sklar P401
95 Sklar P
96 Sklar P404
97 Sklar P403
98 Some channels suffer from switching noise and other burst noise (e.g., telephone channels or channels disturbed by pulse jamming All of these time-correlated impairments result in statistical dependence among successive symbol transmissions. That is, the disturbances tend to cause errors that occur in bursts, instead of as isolated events. Sklar P461
99 Data written to and read from memory in different orders Data bits and corresponding check bits are interspersed with bits from other blocks At receiver, data are deinterleaved to recover original order A burst error that may occur is spread out over a number of blocks, making error correction possible Beard P298
100 Block Interleaving Beard P298
101 Write Read Input data a1, a2, a3, a4, a5, a6, a7, a8, a9, Interleaving a1, a2, a3, a4 a5, a6, a7, a8 a9, a10, a11, a12 a13, a14, a15, a16 Write Transmitting data Received data a1, a5, a9, a13, a2, a6, a10, a14, a3, Through Air a1, a5, a9, a13, a2, a6, a10, a14, a3, De-Interleaving a1, a2, a3, a4 a5, a6, a7, a8 a9, a10, a11, a12 a13, a14, a15, a16 Read Output data a1, a2, a3, a4, a5, a6, a7, a8, a9,
102 Write Burst error Transmitting data on air 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, Received data 0, 1, 0, 0 De-Interleaving 0, 1, 0, 0 0, 1, 0, 0 1, 0, 0, 0 Read Output data 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, Discrete errors
103 消息分组 交织 交织后的消息分组 第 1 帧 第 2 帧 第 3 帧 传输中第 2 帧丢失 解交织后的消息分组
104 A brief historic of turbo codes: The turbo code concept was first introduced by C. Berrou in Today, Turbo Codes are considered as the most efficient coding schemes for FEC Scheme with known components (simple convolutional or block codes, interleaver, soft-decision decoder, etc.) Performance close to the Shannon Limit (E b /N 0 = -1.6 db if R b 0) at modest complexity! Turbo codes have been proposed for low-power applications such as deep-space and satellite communications, as well as for interference limited applications such as third generation cellular, personal communication services, ad hoc and sensor networks Agrawal
105 Alain Glavieux Claude Berrou
106 Figure Block diagram of turbo encoder. Haykin P674
107 y 1 Convolutional Decoder 1 De-interleaving Interleaver x Interleaving Convolutional Decoder 2 De-interleaving y 2 x x : Decoded Information Agrawal
108
109 Figure Noise performances of 1/2 rate, turbo code and uncoded transmission for AWGN channel; the figure also includes Shannon s theoretical limit on channel capacity for code rate r 1/2. Haykin P677
110 Figure Results of the computer experiment on turbo decoding, for increasing number of iterations. Haykin P683
111 Developed in 1960s and re-discovered in 1990s Approach Shannon s limit Use very long codes(normally longer than 1000 bits) Check for errors by using many equations that each add at least three bits together Variable nodes correspond to bits Constraint nodes implement equations Uses iterative decoding Variable nodes estimate the bits And estimate the probabilities of being those bits Constraint nodes combine the estimates to see if they satisfy the equations If not, they determine which variable nodes are likely different than their estimates. Beard P297
112 Tanner Graph for LDPC Iterative Decoding Beard P297
113 Iterative procedure continued Estimates from several constraint nodes are sent back to each variable node to create new estimates These are sent again to constraint nodes to check against equations Procedure is called Message passing Belief propagation Beard P297
114 Introduction ARQ FEC Parity Check Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Turbo Codes
115 Beard s book P Review Questions 10.2 What is the CRC? Explain how go- back- N ARQ works Problems 10.5 For P = and M = , find the CRC Calculate the Hamming pairwise distances among the following codewords: a , 10101, b , , ,
116
Lecture 4: Wireless Physical Layer: Channel Coding. Mythili Vutukuru CS 653 Spring 2014 Jan 16, Thursday
Lecture 4: Wireless Physical Layer: Channel Coding Mythili Vutukuru CS 653 Spring 2014 Jan 16, Thursday Channel Coding Modulated waveforms disrupted by signal propagation through wireless channel leads
More informationLecture 3 Data Link Layer - Digital Data Communication Techniques
DATA AND COMPUTER COMMUNICATIONS Lecture 3 Data Link Layer - Digital Data Communication Techniques Mei Yang Based on Lecture slides by William Stallings 1 ASYNCHRONOUS AND SYNCHRONOUS TRANSMISSION timing
More informationECE 476/ECE 501C/CS Wireless Communication Systems Winter Lecture 9: Error Control Coding
ECE 476/ECE 501C/CS 513 - Wireless Communication Systems Winter 2005 Lecture 9: Error Control Coding Chapter 8 Coding and Error Control From: Wireless Communications and Networks by William Stallings,
More information6. FUNDAMENTALS OF CHANNEL CODER
82 6. FUNDAMENTALS OF CHANNEL CODER 6.1 INTRODUCTION The digital information can be transmitted over the channel using different signaling schemes. The type of the signal scheme chosen mainly depends on
More informationSignal Encoding Criteria
Signal Encoding Criteria What determines how successful a receiver will be in interpreting an incoming signal? Signal to noise ratio (or better E b /N 0 ) Data rate Bandwidth An increase in data rate increases
More informationDigital Television Lecture 5
Digital Television Lecture 5 Forward Error Correction (FEC) Åbo Akademi University Domkyrkotorget 5 Åbo 8.4. Error Correction in Transmissions Need for error correction in transmissions Loss of data during
More informationPhysical-Layer Services and Systems
Physical-Layer Services and Systems Figure Transmission medium and physical layer Figure Classes of transmission media GUIDED MEDIA Guided media, which are those that provide a conduit from one device
More informationIntroduction to Error Control Coding
Introduction to Error Control Coding 1 Content 1. What Error Control Coding Is For 2. How Coding Can Be Achieved 3. Types of Coding 4. Types of Errors & Channels 5. Types of Codes 6. Types of Error Control
More informationPhysical Layer: Modulation, FEC. Wireless Networks: Guevara Noubir. S2001, COM3525 Wireless Networks Lecture 3, 1
Wireless Networks: Physical Layer: Modulation, FEC Guevara Noubir Noubir@ccsneuedu S, COM355 Wireless Networks Lecture 3, Lecture focus Modulation techniques Bit Error Rate Reducing the BER Forward Error
More informationn Based on the decision rule Po- Ning Chapter Po- Ning Chapter
n Soft decision decoding (can be analyzed via an equivalent binary-input additive white Gaussian noise channel) o The error rate of Ungerboeck codes (particularly at high SNR) is dominated by the two codewords
More informationError Protection: Detection and Correction
Error Protection: Detection and Correction Communication channels are subject to noise. Noise distorts analog signals. Noise can cause digital signals to be received as different values. Bits can be flipped
More informationOutline. Communications Engineering 1
Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband channels Signal space representation Optimal
More informationDIGITAL DATA COMMUNICATION TECHNIQUES
6 CHAPTER DIGITAL DATA COMMUNICATION TECHNIQUES 6.1 Asynchronous and Synchronous Transmission 6.2 Types of Errors 6.3 Error Detection 6.4 Error Correction 6.5 Line Configurations 6.6 Recommended Reading
More informationLab/Project Error Control Coding using LDPC Codes and HARQ
Linköping University Campus Norrköping Department of Science and Technology Erik Bergfeldt TNE066 Telecommunications Lab/Project Error Control Coding using LDPC Codes and HARQ Error control coding is an
More informationECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013
ECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013 Lecture 18 Today: (1) da Silva Discussion, (2) Error Correction Coding, (3) Error Detection (CRC) HW 8 due Tue. HW 9 (on Lectures
More informationPROJECT 5: DESIGNING A VOICE MODEM. Instructor: Amir Asif
PROJECT 5: DESIGNING A VOICE MODEM Instructor: Amir Asif CSE4214: Digital Communications (Fall 2012) Computer Science and Engineering, York University 1. PURPOSE In this laboratory project, you will design
More informationECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013
ECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013 Lecture 18 Today: (1) da Silva Discussion, (2) Error Correction Coding, (3) Error Detection (CRC) HW 8 due Tue. HW 9 (on Lectures
More informationChapter 1 Coding for Reliable Digital Transmission and Storage
Wireless Information Transmission System Lab. Chapter 1 Coding for Reliable Digital Transmission and Storage Institute of Communications Engineering National Sun Yat-sen University 1.1 Introduction A major
More informationContents Chapter 1: Introduction... 2
Contents Chapter 1: Introduction... 2 1.1 Objectives... 2 1.2 Introduction... 2 Chapter 2: Principles of turbo coding... 4 2.1 The turbo encoder... 4 2.1.1 Recursive Systematic Convolutional Codes... 4
More informationRADIO SYSTEMS ETIN15. Channel Coding. Ove Edfors, Department of Electrical and Information Technology
RADIO SYSTEMS ETIN15 Lecture no: 7 Channel Coding Ove Edfors, Department of Electrical and Information Technology Ove.Edfors@eit.lth.se 2016-04-18 Ove Edfors - ETIN15 1 Contents (CHANNEL CODING) Overview
More informationSingle Error Correcting Codes (SECC) 6.02 Spring 2011 Lecture #9. Checking the parity. Using the Syndrome to Correct Errors
Single Error Correcting Codes (SECC) Basic idea: Use multiple parity bits, each covering a subset of the data bits. No two message bits belong to exactly the same subsets, so a single error will generate
More informationImplementation of Different Interleaving Techniques for Performance Evaluation of CDMA System
Implementation of Different Interleaving Techniques for Performance Evaluation of CDMA System Anshu Aggarwal 1 and Vikas Mittal 2 1 Anshu Aggarwal is student of M.Tech. in the Department of Electronics
More informationConvolutional Coding Using Booth Algorithm For Application in Wireless Communication
Available online at www.interscience.in Convolutional Coding Using Booth Algorithm For Application in Wireless Communication Sishir Kalita, Parismita Gogoi & Kandarpa Kumar Sarma Department of Electronics
More informationChannel Coding RADIO SYSTEMS ETIN15. Lecture no: Ove Edfors, Department of Electrical and Information Technology
RADIO SYSTEMS ETIN15 Lecture no: 7 Channel Coding Ove Edfors, Department of Electrical and Information Technology Ove.Edfors@eit.lth.se 2012-04-23 Ove Edfors - ETIN15 1 Contents (CHANNEL CODING) Overview
More informationChapter 10 Error Detection and Correction 10.1
Data communication and networking fourth Edition by Behrouz A. Forouzan Chapter 10 Error Detection and Correction 10.1 Note Data can be corrupted during transmission. Some applications require that errors
More informationIntuitive Guide to Principles of Communications By Charan Langton Coding Concepts and Block Coding
Intuitive Guide to Principles of Communications By Charan Langton www.complextoreal.com Coding Concepts and Block Coding It s hard to work in a noisy room as it makes it harder to think. Work done in such
More informationError Detection and Correction
. Error Detection and Companies, 27 CHAPTER Error Detection and Networks must be able to transfer data from one device to another with acceptable accuracy. For most applications, a system must guarantee
More informationDetecting and Correcting Bit Errors. COS 463: Wireless Networks Lecture 8 Kyle Jamieson
Detecting and Correcting Bit Errors COS 463: Wireless Networks Lecture 8 Kyle Jamieson Bit errors on links Links in a network go through hostile environments Both wired, and wireless: Scattering Diffraction
More informationAN INTRODUCTION TO ERROR CORRECTING CODES Part 2
AN INTRODUCTION TO ERROR CORRECTING CODES Part Jack Keil Wolf ECE 54 C Spring BINARY CONVOLUTIONAL CODES A binary convolutional code is a set of infinite length binary sequences which satisfy a certain
More informationPerformance comparison of convolutional and block turbo codes
Performance comparison of convolutional and block turbo codes K. Ramasamy 1a), Mohammad Umar Siddiqi 2, Mohamad Yusoff Alias 1, and A. Arunagiri 1 1 Faculty of Engineering, Multimedia University, 63100,
More informationRevision of Lecture Eleven
Revision of Lecture Eleven Previous lecture we have concentrated on carrier recovery for QAM, and modified early-late clock recovery for multilevel signalling as well as star 16QAM scheme Thus we have
More informationError Control Coding. Aaron Gulliver Dept. of Electrical and Computer Engineering University of Victoria
Error Control Coding Aaron Gulliver Dept. of Electrical and Computer Engineering University of Victoria Topics Introduction The Channel Coding Problem Linear Block Codes Cyclic Codes BCH and Reed-Solomon
More informationLecture 6: Reliable Transmission"
Lecture 6: Reliable Transmission" CSE 123: Computer Networks Alex C. Snoeren HW 2 out Wednesday! Lecture 6 Overview" Cyclic Remainder Check (CRC) Automatic Repeat Request (ARQ) Acknowledgements (ACKs)
More informationVolume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More informationChapter 3 Convolutional Codes and Trellis Coded Modulation
Chapter 3 Convolutional Codes and Trellis Coded Modulation 3. Encoder Structure and Trellis Representation 3. Systematic Convolutional Codes 3.3 Viterbi Decoding Algorithm 3.4 BCJR Decoding Algorithm 3.5
More informationECE 6640 Digital Communications
ECE 6640 Digital Communications Dr. Bradley J. Bazuin Assistant Professor Department of Electrical and Computer Engineering College of Engineering and Applied Sciences Chapter 8 8. Channel Coding: Part
More informationData and Computer Communications
Data and Computer Communications Error Detection Mohamed Khedr http://webmail.aast.edu/~khedr Syllabus Tentatively Week 1 Week 2 Week 3 Week 4 Week 5 Week 6 Week 7 Week 8 Week 9 Week 10 Week 11 Week 12
More informationDigital to Digital Encoding
MODULATION AND ENCODING Data must be transformed into signals to send them from one place to another Conversion Schemes Digital-to-Digital Analog-to-Digital Digital-to-Analog Analog-to-Analog Digital to
More informationSimulink Modeling of Convolutional Encoders
Simulink Modeling of Convolutional Encoders * Ahiara Wilson C and ** Iroegbu Chbuisi, *Department of Computer Engineering, Michael Okpara University of Agriculture, Umudike, Abia State, Nigeria **Department
More informationSpreading Codes and Characteristics. Error Correction Codes
Spreading Codes and Characteristics and Error Correction Codes Global Navigational Satellite Systems (GNSS-6) Short course, NERTU Prasad Krishnan International Institute of Information Technology, Hyderabad
More informationNotes 15: Concatenated Codes, Turbo Codes and Iterative Processing
16.548 Notes 15: Concatenated Codes, Turbo Codes and Iterative Processing Outline! Introduction " Pushing the Bounds on Channel Capacity " Theory of Iterative Decoding " Recursive Convolutional Coding
More informationChapter 4. Communication System Design and Parameters
Chapter 4 Communication System Design and Parameters CHAPTER 4 COMMUNICATION SYSTEM DESIGN AND PARAMETERS 4.1. Introduction In this chapter the design parameters and analysis factors are described which
More informationMATHEMATICS IN COMMUNICATIONS: INTRODUCTION TO CODING. A Public Lecture to the Uganda Mathematics Society
Abstract MATHEMATICS IN COMMUNICATIONS: INTRODUCTION TO CODING A Public Lecture to the Uganda Mathematics Society F F Tusubira, PhD, MUIPE, MIEE, REng, CEng Mathematical theory and techniques play a vital
More informationWhite Paper FEC In Optical Transmission. Giacomo Losio ProLabs Head of Technology
White Paper FEC In Optical Transmission Giacomo Losio ProLabs Head of Technology 2014 FEC In Optical Transmission When we introduced the DWDM optics, we left out one important ingredient that really makes
More informationCommunications Theory and Engineering
Communications Theory and Engineering Master's Degree in Electronic Engineering Sapienza University of Rome A.A. 2018-2019 Channel Coding The channel encoder Source bits Channel encoder Coded bits Pulse
More informationLecture #2. EE 471C / EE 381K-17 Wireless Communication Lab. Professor Robert W. Heath Jr.
Lecture #2 EE 471C / EE 381K-17 Wireless Communication Lab Professor Robert W. Heath Jr. Preview of today s lecture u Introduction to digital communication u Components of a digital communication system
More informationPerformance Evaluation of Low Density Parity Check codes with Hard and Soft decision Decoding
Performance Evaluation of Low Density Parity Check codes with Hard and Soft decision Decoding Shalini Bahel, Jasdeep Singh Abstract The Low Density Parity Check (LDPC) codes have received a considerable
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of OFDM under DWT, DCT based Image Processing Anshul Soni soni.anshulec14@gmail.com Ashok Chandra Tiwari Abstract In this paper, the performance of conventional discrete cosine transform
More informationA Survey of Advanced FEC Systems
A Survey of Advanced FEC Systems Eric Jacobsen Minister of Algorithms, Intel Labs Communication Technology Laboratory/ Radio Communications Laboratory July 29, 2004 With a lot of material from Bo Xia,
More informationPerformance of Combined Error Correction and Error Detection for very Short Block Length Codes
Performance of Combined Error Correction and Error Detection for very Short Block Length Codes Matthias Breuninger and Joachim Speidel Institute of Telecommunications, University of Stuttgart Pfaffenwaldring
More informationLecture 9b Convolutional Coding/Decoding and Trellis Code modulation
Lecture 9b Convolutional Coding/Decoding and Trellis Code modulation Convolutional Coder Basics Coder State Diagram Encoder Trellis Coder Tree Viterbi Decoding For Simplicity assume Binary Sym.Channel
More informationDatacommunication I. Layers of the OSI-model. Lecture 3. signal encoding, error detection/correction
Datacommunication I Lecture 3 signal encoding, error detection/correction Layers of the OSI-model repetition 1 The OSI-model and its networking devices repetition The OSI-model and its networking devices
More informationECE 6640 Digital Communications
ECE 6640 Digital Communications Dr. Bradley J. Bazuin Assistant Professor Department of Electrical and Computer Engineering College of Engineering and Applied Sciences Chapter 8 8. Channel Coding: Part
More informationBSc (Hons) Computer Science with Network Security, BEng (Hons) Electronic Engineering. Cohorts: BCNS/17A/FT & BEE/16B/FT
BSc (Hons) Computer Science with Network Security, BEng (Hons) Electronic Engineering Cohorts: BCNS/17A/FT & BEE/16B/FT Examinations for 2016-2017 Semester 2 & 2017 Semester 1 Resit Examinations for BEE/12/FT
More informationTSTE17 System Design, CDIO. General project hints. Behavioral Model. General project hints, cont. Lecture 5. Required documents Modulation, cont.
TSTE17 System Design, CDIO Lecture 5 1 General project hints 2 Project hints and deadline suggestions Required documents Modulation, cont. Requirement specification Channel coding Design specification
More informationBER Analysis of BPSK for Block Codes and Convolution Codes Over AWGN Channel
International Journal of Pure and Applied Mathematics Volume 114 No. 11 2017, 221-230 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu BER Analysis
More informationWireless Communications
3. Data Link Layer DIN/CTC/UEM 2018 Main Functions Handle transmission errors Adjust the data flow : Main Functions Split information into frames: Check if frames have arrived correctly Otherwise: Discard
More informationDigital Transmission using SECC Spring 2010 Lecture #7. (n,k,d) Systematic Block Codes. How many parity bits to use?
Digital Transmission using SECC 6.02 Spring 2010 Lecture #7 How many parity bits? Dealing with burst errors Reed-Solomon codes message Compute Checksum # message chk Partition Apply SECC Transmit errors
More informationInternational Journal of Scientific & Engineering Research Volume 9, Issue 3, March ISSN
International Journal of Scientific & Engineering Research Volume 9, Issue 3, March-2018 1605 FPGA Design and Implementation of Convolution Encoder and Viterbi Decoder Mr.J.Anuj Sai 1, Mr.P.Kiran Kumar
More informationDepartment of Electronics and Communication Engineering 1
UNIT I SAMPLING AND QUANTIZATION Pulse Modulation 1. Explain in detail the generation of PWM and PPM signals (16) (M/J 2011) 2. Explain in detail the concept of PWM and PAM (16) (N/D 2012) 3. What is the
More informationDecoding of Block Turbo Codes
Decoding of Block Turbo Codes Mathematical Methods for Cryptography Dedicated to Celebrate Prof. Tor Helleseth s 70 th Birthday September 4-8, 2017 Kyeongcheol Yang Pohang University of Science and Technology
More informationChapter 2 Overview - 1 -
Chapter 2 Overview Part 1 (last week) Digital Transmission System Frequencies, Spectrum Allocation Radio Propagation and Radio Channels Part 2 (today) Modulation, Coding, Error Correction Part 3 (next
More informationLecture 17 Components Principles of Error Control Borivoje Nikolic March 16, 2004.
EE29C - Spring 24 Advanced Topics in Circuit Design High-Speed Electrical Interfaces Lecture 17 Components Principles of Error Control Borivoje Nikolic March 16, 24. Announcements Project phase 1 is posted
More informationError-Correcting Codes
Error-Correcting Codes Information is stored and exchanged in the form of streams of characters from some alphabet. An alphabet is a finite set of symbols, such as the lower-case Roman alphabet {a,b,c,,z}.
More informationReduced Complexity by Incorporating Sphere Decoder with MIMO STBC HARQ Systems
I J C T A, 9(34) 2016, pp. 417-421 International Science Press Reduced Complexity by Incorporating Sphere Decoder with MIMO STBC HARQ Systems B. Priyalakshmi #1 and S. Murugaveni #2 ABSTRACT The objective
More informationb. When transmitting a message through a transmission medium, the equipment which receives the message should first find out whether it has received
b. When transmitting a message through a transmission medium, the equipment which receives the message should first find out whether it has received the message correctly. If there is an error the receive
More informationEFFECTIVE CHANNEL CODING OF SERIALLY CONCATENATED ENCODERS AND CPM OVER AWGN AND RICIAN CHANNELS
EFFECTIVE CHANNEL CODING OF SERIALLY CONCATENATED ENCODERS AND CPM OVER AWGN AND RICIAN CHANNELS Manjeet Singh (ms308@eng.cam.ac.uk) Ian J. Wassell (ijw24@eng.cam.ac.uk) Laboratory for Communications Engineering
More informationDigital Data Communication Techniques
Digital Data Communication Techniques Raj Jain Washington University Saint Louis, MO 63131 Jain@cse.wustl.edu These slides are available on-line at: http://www.cse.wustl.edu/~jain/cse473-05/ 6-1 Overview
More informationVITERBI ALGORITHM IN CONTINUOUS-PHASE FREQUENCY SHIFT KEYING
VITERBI ALGORITHM IN CONTINUOUS-PHASE FREQUENCY SHIFT KEYING A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Master of Technology In VLSI Design and Embedded System By L.
More informationMaximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm
Maximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm Presented to Dr. Tareq Al-Naffouri By Mohamed Samir Mazloum Omar Diaa Shawky Abstract Signaling schemes with memory
More informationTurbo coding (CH 16)
Turbo coding (CH 16) Parallel concatenated codes Distance properties Not exceptionally high minimum distance But few codewords of low weight Trellis complexity Usually extremely high trellis complexity
More informationIMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING.
IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING. COMPACT LECTURE NOTES on COMMUNICATION THEORY. Prof. Athanassios Manikas, version Spring 22 Digital
More informationSpread Spectrum. Chapter 18. FHSS Frequency Hopping Spread Spectrum DSSS Direct Sequence Spread Spectrum DSSS using CDMA Code Division Multiple Access
Spread Spectrum Chapter 18 FHSS Frequency Hopping Spread Spectrum DSSS Direct Sequence Spread Spectrum DSSS using CDMA Code Division Multiple Access Single Carrier The traditional way Transmitted signal
More informationChapter 2 Overview - 1 -
Chapter 2 Overview Part 1 (last week) Digital Transmission System Frequencies, Spectrum Allocation Radio Propagation and Radio Channels Part 2 (today) Modulation, Coding, Error Correction Part 3 (next
More informationAdvanced channel coding : a good basis. Alexandre Giulietti, on behalf of the team
Advanced channel coding : a good basis Alexandre Giulietti, on behalf of the T@MPO team Errors in transmission are fowardly corrected using channel coding e.g. MPEG4 e.g. Turbo coding e.g. QAM source coding
More informationChapter 10 Error Detection and Correction
Chapter 10 Error Detection and Correction 10.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 10.2 Note Data can be corrupted during transmission. Some applications
More informationEE521 Analog and Digital Communications
EE521 Analog and Digital Communications Questions Problem 1: SystemView... 3 Part A (25%... 3... 3 Part B (25%... 3... 3 Voltage... 3 Integer...3 Digital...3 Part C (25%... 3... 4 Part D (25%... 4... 4
More informationStudy of Turbo Coded OFDM over Fading Channel
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 3, Issue 2 (August 2012), PP. 54-58 Study of Turbo Coded OFDM over Fading Channel
More informationSIMULATIONS OF ERROR CORRECTION CODES FOR DATA COMMUNICATION OVER POWER LINES
SIMULATIONS OF ERROR CORRECTION CODES FOR DATA COMMUNICATION OVER POWER LINES Michelle Foltran Miranda Eduardo Parente Ribeiro mifoltran@hotmail.com edu@eletrica.ufpr.br Departament of Electrical Engineering,
More informationOutline. EECS 122, Lecture 6. Error Control Overview Where are Codes Used? Error Control Overview. Error Control Strategies ARQ versus FEC
Outline, Lecture 6 Kevin Fall kfall@cs.berkeley.edu Jean Walrand wlr@eecs.berkeley.edu Error Control Overview : n ARQ vs. FEC n Link vs. End-to-End : n Objectives n How Codes Work Code Examples: n Parity
More informationError Control Codes. Tarmo Anttalainen
Tarmo Anttalainen email: tarmo.anttalainen@evitech.fi.. Abstract: This paper gives a brief introduction to error control coding. It introduces bloc codes, convolutional codes and trellis coded modulation
More informationError Correcting Code
Error Correcting Code Robin Schriebman April 13, 2006 Motivation Even without malicious intervention, ensuring uncorrupted data is a difficult problem. Data is sent through noisy pathways and it is common
More informationUsing TCM Techniques to Decrease BER Without Bandwidth Compromise. Using TCM Techniques to Decrease BER Without Bandwidth Compromise. nutaq.
Using TCM Techniques to Decrease BER Without Bandwidth Compromise 1 Using Trellis Coded Modulation Techniques to Decrease Bit Error Rate Without Bandwidth Compromise Written by Jean-Benoit Larouche INTRODUCTION
More informationSerially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry
Serially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry c 2008 Kanagaraj Damodaran Submitted to the Department of Electrical Engineering & Computer Science and the Faculty of
More informationModulation and Coding Tradeoffs
0 Modulation and Coding Tradeoffs Contents 1 1. Design Goals 2. Error Probability Plane 3. Nyquist Minimum Bandwidth 4. Shannon Hartley Capacity Theorem 5. Bandwidth Efficiency Plane 6. Modulation and
More informationLayering and Controlling Errors
Layering and Controlling Errors Brad Karp (some slides contributed by Kyle Jamieson) UCL Computer Science CS 3035/GZ01 2 nd October 2014 Today s Agenda Layering Physical-layer encoding Link-layer framing
More informationTHE idea behind constellation shaping is that signals with
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 3, MARCH 2004 341 Transactions Letters Constellation Shaping for Pragmatic Turbo-Coded Modulation With High Spectral Efficiency Dan Raphaeli, Senior Member,
More informationRobust Reed Solomon Coded MPSK Modulation
ITB J. ICT, Vol. 4, No. 2, 2, 95-4 95 Robust Reed Solomon Coded MPSK Modulation Emir M. Husni School of Electrical Engineering & Informatics, Institut Teknologi Bandung, Jl. Ganesha, Bandung 432, Email:
More informationCT-516 Advanced Digital Communications
CT-516 Advanced Digital Communications Yash Vasavada Winter 2017 DA-IICT Lecture 17 Channel Coding and Power/Bandwidth Tradeoff 20 th April 2017 Power and Bandwidth Tradeoff (for achieving a particular
More informationReview of Lecture 2. Data and Signals - Theoretical Concepts. Review of Lecture 2. Review of Lecture 2. Review of Lecture 2. Review of Lecture 2
Data and Signals - Theoretical Concepts! What are the major functions of the network access layer? Reference: Chapter 3 - Stallings Chapter 3 - Forouzan Study Guide 3 1 2! What are the major functions
More informationTrellis-Coded Modulation [TCM]
Trellis-Coded Modulation [TCM] Limitations of conventional block and convolutional codes on bandlimited channels Basic principles of trellis coding: state, trellis, and set partitioning Coding gain with
More informationSimulink Modelling of Reed-Solomon (Rs) Code for Error Detection and Correction
Simulink Modelling of Reed-Solomon (Rs) Code for Error Detection and Correction Okeke. C Department of Electrical /Electronics Engineering, Michael Okpara University of Agriculture, Umudike, Abia State,
More informationCSC344 Wireless and Mobile Computing. Department of Computer Science COMSATS Institute of Information Technology
CSC344 Wireless and Mobile Computing Department of Computer Science COMSATS Institute of Information Technology Wireless Physical Layer Concepts Part II Electromagnetic Spectrum Frequency, Period, Phase
More informationMaximum Likelihood Detection of Low Rate Repeat Codes in Frequency Hopped Systems
MP130218 MITRE Product Sponsor: AF MOIE Dept. No.: E53A Contract No.:FA8721-13-C-0001 Project No.: 03137700-BA The views, opinions and/or findings contained in this report are those of The MITRE Corporation
More informationInternational Journal of Computer Trends and Technology (IJCTT) Volume 40 Number 2 - October2016
Signal Power Consumption in Digital Communication using Convolutional Code with Compared to Un-Coded Madan Lal Saini #1, Dr. Vivek Kumar Sharma *2 # Ph. D. Scholar, Jagannath University, Jaipur * Professor,
More informationIEEE C /02R1. IEEE Mobile Broadband Wireless Access <http://grouper.ieee.org/groups/802/mbwa>
23--29 IEEE C82.2-3/2R Project Title Date Submitted IEEE 82.2 Mobile Broadband Wireless Access Soft Iterative Decoding for Mobile Wireless Communications 23--29
More informationUNIT-1. Basic signal processing operations in digital communication
UNIT-1 Lecture-1 Basic signal processing operations in digital communication The three basic elements of every communication systems are Transmitter, Receiver and Channel. The Overall purpose of this system
More informationChapter-1: Introduction
Chapter-1: Introduction The purpose of a Communication System is to transport an information bearing signal from a source to a user destination via a communication channel. MODEL OF A COMMUNICATION SYSTEM
More informationVector-LDPC Codes for Mobile Broadband Communications
Vector-LDPC Codes for Mobile Broadband Communications Whitepaper November 23 Flarion Technologies, Inc. Bedminster One 35 Route 22/26 South Bedminster, NJ 792 Tel: + 98-947-7 Fax: + 98-947-25 www.flarion.com
More informationMULTILEVEL CODING (MLC) with multistage decoding
350 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 3, MARCH 2004 Power- and Bandwidth-Efficient Communications Using LDPC Codes Piraporn Limpaphayom, Student Member, IEEE, and Kim A. Winick, Senior
More information