Chapter 3 Convolutional Codes and Trellis Coded Modulation

Size: px
Start display at page:

Download "Chapter 3 Convolutional Codes and Trellis Coded Modulation"

Transcription

1 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 Trellis Coded Modulation

2 3. Encoder Structure and Trellis Representation Introduction Encoder: contains memory (order m: m memory units); Output: encoder output at time unit t depends on the input and the memory units status at time unit t; By increasing the memory order m, one can increase the convolutional code s minimum distance (d min ) and achieve low bit error rate performance (P b ); Decoding Methods: Viterbi algorithm []: Maximum Likelihood (ML) decoding algorithm; Bahl, Cocke, Jelinek, and Raviv (BCJR) [] algorithm: Maximum A Posteriori Probability (MAP) decoding algorithm, used for iterative decoding process, e.g. turbo decoding. [] A. J. Viterbi, Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Trans. Inform. Theory, IT-3, 6-69, April, 967. [] L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate, IEEE Trans, Inform. Theory, IT-; 84-87, March, 974.

3 3. Encoder Structure and Trellis Representation - The (7, 5) 8 conv. code Encoder structure: c Input a S S Encoding Process: c (Initialised state s s = ) At time t At time t At time t 3 Code rate: ½; Memory: m = ; Constraint length: m + = 3 Output calculation: c = a S S ; c = a S ; Registers update: S = S. S = a.

4 3. Encoder Structure and Trellis Representation At time t 4 At time t 6 At time t 5 Input sequence [m m m 3 m 4 m 5 m 6 ] = [ ]

5 3. Encoder Structure and Trellis Representation A state transition diagram of the (7, 5) 8 conv. code / / d / / State definition (s s ) a = b = c = c b d = / / a / / Interpretation of the state diagram c Input bit () / output bits () The current state of the encoder is c. If the input bit is, it will output and the next state of the encoder is a. a

6 3. Encoder Structure and Trellis Representation Tree Representation of the (7, 5) 8 conv. code Time unit: 3 4 Initialised state: a a b a b c d a b c d a b c d Tree diagram interpretation: The current state of the encoder is b. If the input bit is, the output will be, and the next state of the encoder is c. Input bit as Input bit as State after transition Output from transition Example 3. Determine the codeword that corresponds to message [ ]

7 3. Encoder Structure and Trellis Representation Trellis of the (7, 5) 8 conv. code State Table IN Current State Next State Out ID Trellis Remark: A trellis tells the state transition and IN/OUT relationship. It can be used to yield a convolutional codeword of a sequential input. Example 3. Use the above trellis to determine the codeword that corresponds to message [ ]. OUT IN: IN: 4 5 6

8 3. Encoder Structure and Trellis Representation A number of conv. codes (7, 5) 8 conv. code (5, 3) 8 conv. code 4 states 8 states (3, 35) 8 conv. code (7, 33) 8 conv. code 6 states 64 states Remark: A convolutional code s error-correction capability improves by increasing the number of the encoder states.

9 3. Encoder Structure and Trellis Representation Remark: The encoder structure can also be represented by generator sequences or transfer functions. Example 3.3:

10 3. Systematic Convolutional Codes - The (7, 5) 8 conv. code s systematic counterpart is: (7, 5) 8 conv. code c a (, 5/7) 8 conv. code c c a S S S S Nonsystematic code c Systematic code Encoding and Registers updating rules: [S S ] are initialization as [ ]; c = a ; (systematic feature) feedback = S S ; c = a feedback S ; S = S ; S = a feedback; Remark: Systematic encoding structure is important for iterative decoding, e.g., the decoding of turbo codes.

11 3. Systematic Convolutional Codes For the (, 5/7) 8 conv. code State Table IN Current State Next State Out ID OUT Trellis IN: IN:

12 3.3 Viterbi Decoding Algorithm Let us extend the trellis of the (7, 5) 8 conv. code as if there is a sequential input. - Such an extension results in a Viterbi trellis - A path in the Viterbi trellis represents a convolutional codeword that corresponds to a sequential input (message).

13 3.3 Viterbi Decoding Algorithm - Branch metrics: Hamming distance between a transition branch s output and the corresponding received symbol (or bits). - Path metrics: Accumulated Hamming distance of the previous branch metrics.

14 3.3 Viterbi Decoding Algorithm Example 3.4. Given the (7, 5) 8 conv. code as in Examples The transmitted codeword is Step : Calculate all the branch metrics.

15 3.3 Viterbi Decoding Algorithm Step : Calculate the path metrics When two paths join in a node, keep the smaller accumulated Hamming distance. When the two joining paths give the same accumulated Hamming distance, pick up one randomly.

16 3.3 Viterbi Decoding Algorithm Step 3: Pick up the minimal path metric and trace back to determine the message. Tracing rules: () Trellis connection; () The previous path metric should NOT be greater than the current path metric; (3) The tracing route should match the trellis transition ID.,,, 3,5, 3,6,6 3,3,3,5,7,,4, 3,5,4,6 3,8 Decoding output:

17 3.3 Viterbi Decoding Algorithm Branch Metrics Table Path Metrics Table Trellis Transition ID Table

18 3.3 Viterbi Decoding Algorithm Soft-decision Viterbi decoding While we are performing the hard-decision Viterbi decoding, we have the scenario that two joining paths yield the same accumulated Hamming distance. This would cause decoding ambiguity and performance penalty; Such a performance loss can be compensated by utilizing soft-decision decoding, e.g., soft-decision Viterbi decoding Modulation and Demodulation (e.g., BPSK) Modulation: mapping binary information into a transmitted symbol; Demodulation: determining the binary information with a received symbol; information (-, ) (, ) Channel (-, ) (.5,.9) (, ) Received symbol Transmitted symbol Modulation Demodulation

19 3.3 Viterbi Decoding Algorithm Modulation and Demodulation (e.g., BPSK) (.5,.9) (-, ) (, ) Demodulation Received symbol Hard-decision: the information bit is. The Hamming distance becomes the Viterbi decoding metrics; Soft-decision: the information bit has Pr. of.7 being and Pr. of.3 bing. The Euclidean distance (or probability) becomes the Viterbi decoding metrics; Euclidean Distance Definition: The Euclidean distance between points p and q is the length of the line segment connecting them. p(x, y ) q(x, y ) d Eud x) ( y ) ( x y

20 3.3 Viterbi Decoding Algorithm Example 3.5. Given the (7, 5) 8 conv. code as in Examples The transmitted codeword is After BPSK modulation, the transmitted symbols are: (, ), (, ), (-, ), (-, ), (, ), (-, ), (, ), (-, ), (, ), (, ). After the channel, the received symbols are: (.8,.), (., -.4), (-.3,.3), (-.9, -.), (-.5,.4), (-.,.), (.,.4), (-.7, -.), (.,.), (.9,.3).

21 3.3 Viterbi Decoding Algorithm Step : Calculate all the branch metrics. (.8,.) (., -.4) (-.3,.3) (-.5,.4) (.,.4) (.,.) (-.9, -.) (-.,.) (-.7, -.) (.9,.3) (, ) (-, ).93.94

22 3.3 Viterbi Decoding Algorithm Step : Calculate the path metrics. (.8,.) (., -.4) (-.3,.3) (-.5,.4) (.,.4) (.,.) (-.9, -.) (-.,.) (-.7, -.) (.9,.3) When two paths join in a node, keep the smaller accumulated Euclidean distance.

23 3.3 Viterbi Decoding Algorithm Step 3: Pick up the minimal path metric and trace back to determine the message. Tracing rules: The same as hard-decision Viterbi decoding algorithm. (.8,.) (., -.4) (-.3,.3) (-.5,.4) (.,.4) (.,.) (-.9, -.) (-.,.) (-.7, -.) (.9,.3) , , , ,5 3.8,5 3.64, ,.98, 4.8, 4.84, ,6..54, , , , , , ,8 Decoding output:

24 3.3 Viterbi Decoding Algorithm Branch Metrics Table Path Metrics Table Trellis Transition ID Table

25 3.3 Viterbi Decoding Algorithm Free distance of convolutional code - A convolutional code s performance is determined by its free distance. - Free distance - With knowing is also a convolutional codeword. Hence, it is the minimum weight of all finite length paths in the Viterbi trellis that diverge from and emerge with the all zero state.

26 3.3 Viterbi Decoding Algorithm Hence, it is the minimum weight of all finite length paths in the Viterbi trellis that diverge from and emerge with the all zero state.

27 3.3 Viterbi Decoding Algorithm Remark: Convolutional code is more competent in correcting spread errors, but not bursty errors. error

28 3.4 BCJR Decoding Algorithm - Hard-decision Viterbi algorithm: a Hard-In-Hard-Out (HIHO) decoding. Soft-decision Viterbi algorithm: a Soft-In-Hard-Out (SIHO) decoding. BCJR Algorithm: a Soft-In-Soft-Out (SISO) decoding. - A Soft-In-Soft-Out (SISO) decoding algorithm that takes probabilities as the input and delivers probabilities as the output.

29 3.4 BCJR Decoding Algorithm - In a trellis (e.g., trellis of the (7, 5) 8 conv. code). (a) (a) IN: IN: (b) (c) (d) (b) (c) (d) The (IN, OUT, current state, next state) tuple happens as an entity. θ θ θ θ θ θ θ θ θ θ

30 3.4 BCJR Decoding Algorithm (a) (a) IN: IN: (b) (c) (b) (c) (d) (d) - For a rate half conv. code, - Trellis state transition probability:

31 3.4 BCJR Decoding Algorithm - Determine the state transition probabilities. (a) (a) IN: IN: (b) (c) (b) (c) BPSK (d) (d) P ch ( c ) P( y c ) ' t t t ' P ch ( c ) P( y c ) ' t t t '

32 3.4 BCJR Decoding Algorithm - Determine the probability of each beginning state. a a a IN: IN: b c d b c d b c d - Knowing the Viterbi trellis starts from the all-zero state, we initialize: - E.g., in the highlighted trellis transition

33 3.4 BCJR Decoding Algorithm - Determine the probability of each ending state. a Ω a a IN: IN: b c d b c d b c d - By ensuring after encoding, the shift registers (encoder) are restored to the all zero state (achieved by bit tailing), we can initialize: - E.g., in the highlighted trellis transition

34 3.4 BCJR Decoding Algorithm a a IN: IN: b c b c d d State transition indicated by State transition indicated by

35 3.4 BCJR Decoding Algorithm - E.g., - Decision based on the a posteriori probabilities.

36 3.4 BCJR Decoding Algorithm Example 3.6. With the same transmitted codeword and received symbols of Example 3.5, use the BCJR algorithm to decode it. With the received symbols, we can determine

37 3.4 BCJR Decoding Algorithm (.8,.) (., -.4) (-.3,.3) (-.5,.4) (.,.4) (.,.) (-.9, -.) (-.,.) (-.7, -.) (.9,.3) a b c d a b c d

38 3.4 BCJR Decoding Algorithm a b c d.... (.8,.) (., -.4) (-.3,.3) (-.5,.4) (.,.4) (.,.) (-.9, -.) (-.,.) (-.7, - (.9,.3).) a b c d

39 3.4 BCJR Decoding Algorithm (.8,.) (., -.4) (-.3,.3) (-.5,.4) (.,.4) (.,.) (-.9, -.) (-.,.) (-.7, -.) (.9,.3) a b c d a b c d Assume we know the trellis ends at state c.

40 3.4 BCJR Decoding Algorithm Step 4: Determine the a posteriori probabilities of each information bit.

41 3.4 BCJR Decoding Algorithm BER performance of (7, 5) 8 conv. code over AWGN channel using BPSK..E+.E-.E- uncoded Hard decision Viterbi Soft decision Viterbi BCJR SNR threshold BER.E-3.E-4.E-5.E E b /N (db)

42 3.4 BCJR Decoding Algorithm BER performance of different conv. code over AWGN channel using BPSK..E+.E-.E- 4-state (7, 5) 8 conv. code 8-state (5, 3) 8 conv. code 6-state (3, 35) 8 conv. code 64-state (7, 33) 8 conv. code BER.E-3.E-4.E-5.E E b /N (db)

43 3.5 Trellis Coded Modulation - Convolutional code enables reliable communications. But as a channel code, its error-correction function is on the expense of spectral efficiency. - E.g., an uncoded system using BPSK η = info bits/symbol A rate / conv. coded system using BPSK η =.5 info bits/symbol - Can we achieve reliable and yet spectrally efficient communication? Solution: Trellis Coded Modulation (TCM) that integrates a conv. code with a high order modulation [3]. [3] G. Ungerboeck, "Channel coding with multilevel/phase signals," IEEE Trans. Inform. Theory, vol. IT-8, pp , 98.

44 3.5 Trellis Coded Modulation - A general structure of the TCM scheme a a a k a k+ a k+v Rate k/(k+) conv. encoder c c c k+ Select a subset from the constellation Select a point from the subset Output symbol

45 3.5 Trellis Coded Modulation - A rate /3 TCM code. a a S S c 3 c c Select a subset from 8PSK Select a point from the subset Output Rate ½ 4-state Convolutional Code (4) (3) 8PSK Constellation (5) () () () (6) (7)

46 3.5 Trellis Coded Modulation - State table of the rate /3 TCM code a a S S S S c c c 3 8PSK sym Input Current State Next State Output Symbol

47 3.5 Trellis Coded Modulation - Set Partitioning 8PSK ' sin.765 ' 8 c 3 c c = c = c = ' 6 Original constellation Subset c = c = c = c = ' (, 4) (, 6) (, 5) (3, 7) Subset

48 3.5 Trellis Coded Modulation - Set Partitioning 8PSK By doing set partitioning, the minimum distance between point within a subset is increasing as: Δ < Δ < Δ. Original constellation Set Partitioning Subset Subset

49 3.5 Trellis Coded Modulation - Viterbi trellis of the rate /3 TCM code 6 4 For diverse/remerge transition: For parallel transition: Choose the smaller one as the free distance of the code: Remark: Bit c 3 = and c 3 = result in two parallel transition branches. By doing set partitioning, we are trying to maximize the Euclidean distance between the two parallel branches. So that the free distance of the TCM code can be maximized.

50 3.5 Trellis Coded Modulation - Asymptotic coding gain over an uncoded system. - Spectral efficiency (η) = info bits/sym. uncoded QPSK rate /3 coded 8PSK Remark: With the same transmission spectral efficiency of info bits/sym, the TCM coded system achieves 3 db coding gain over the uncoded system asymptotically.

Lecture 9b Convolutional Coding/Decoding and Trellis Code modulation

Lecture 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 information

Digital Communications I: Modulation and Coding Course. Term Catharina Logothetis Lecture 12

Digital Communications I: Modulation and Coding Course. Term Catharina Logothetis Lecture 12 Digital Communications I: Modulation and Coding Course Term 3-8 Catharina Logothetis Lecture Last time, we talked about: How decoding is performed for Convolutional codes? What is a Maximum likelihood

More information

n Based on the decision rule Po- Ning Chapter Po- Ning Chapter

n 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 information

Department of Electronic Engineering FINAL YEAR PROJECT REPORT

Department of Electronic Engineering FINAL YEAR PROJECT REPORT Department of Electronic Engineering FINAL YEAR PROJECT REPORT BEngECE-2009/10-- Student Name: CHEUNG Yik Juen Student ID: Supervisor: Prof.

More information

IN 1993, powerful so-called turbo codes were introduced [1]

IN 1993, powerful so-called turbo codes were introduced [1] 206 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 16, NO. 2, FEBRUARY 1998 Bandwidth-Efficient Turbo Trellis-Coded Modulation Using Punctured Component Codes Patrick Robertson, Member, IEEE, and

More information

Outline. Communications Engineering 1

Outline. 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 information

AN INTRODUCTION TO ERROR CORRECTING CODES Part 2

AN 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 information

Serially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry

Serially 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 information

Using 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. 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 information

designing the inner codes Turbo decoding performance of the spectrally efficient RSCC codes is further evaluated in both the additive white Gaussian n

designing the inner codes Turbo decoding performance of the spectrally efficient RSCC codes is further evaluated in both the additive white Gaussian n Turbo Decoding Performance of Spectrally Efficient RS Convolutional Concatenated Codes Li Chen School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China Email: chenli55@mailsysueducn

More information

Advanced channel coding : a good basis. Alexandre Giulietti, on behalf of the team

Advanced 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 information

Intro to coding and convolutional codes

Intro to coding and convolutional codes Intro to coding and convolutional codes Lecture 11 Vladimir Stojanović 6.973 Communication System Design Spring 2006 Massachusetts Institute of Technology 802.11a Convolutional Encoder Rate 1/2 convolutional

More information

Trellis-Coded Modulation [TCM]

Trellis-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 information

6. FUNDAMENTALS OF CHANNEL CODER

6. 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 information

Maximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm

Maximum 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 information

Decoding of Block Turbo Codes

Decoding 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 information

Near-Optimal Low Complexity MLSE Equalization

Near-Optimal Low Complexity MLSE Equalization Near-Optimal Low Complexity MLSE Equalization Abstract An iterative Maximum Likelihood Sequence Estimation (MLSE) equalizer (detector) with hard outputs, that has a computational complexity quadratic in

More information

Convolutional Coding Using Booth Algorithm For Application in Wireless Communication

Convolutional 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 information

ISSN: International Journal of Innovative Research in Science, Engineering and Technology

ISSN: International Journal of Innovative Research in Science, Engineering and Technology ISSN: 39-8753 Volume 3, Issue 7, July 4 Graphical User Interface for Simulating Convolutional Coding with Viterbi Decoding in Digital Communication Systems using Matlab Ezeofor C. J., Ndinechi M.C. Lecturer,

More information

A Survey of Advanced FEC Systems

A 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 information

Goa, India, October Question: 4/15 SOURCE 1 : IBM. G.gen: Low-density parity-check codes for DSL transmission.

Goa, India, October Question: 4/15 SOURCE 1 : IBM. G.gen: Low-density parity-check codes for DSL transmission. ITU - Telecommunication Standardization Sector STUDY GROUP 15 Temporary Document BI-095 Original: English Goa, India, 3 7 October 000 Question: 4/15 SOURCE 1 : IBM TITLE: G.gen: Low-density parity-check

More information

A Novel and Efficient Mapping of 32-QAM Constellation for BICM-ID Systems

A Novel and Efficient Mapping of 32-QAM Constellation for BICM-ID Systems Wireless Pers Commun DOI 10.1007/s11277-014-1848-2 A Novel and Efficient Mapping of 32-QAM Constellation for BICM-ID Systems Hassan M. Navazi Ha H. Nguyen Springer Science+Business Media New York 2014

More information

Turbo Codes for Pulse Position Modulation: Applying BCJR algorithm on PPM signals

Turbo Codes for Pulse Position Modulation: Applying BCJR algorithm on PPM signals Turbo Codes for Pulse Position Modulation: Applying BCJR algorithm on PPM signals Serj Haddad and Chadi Abou-Rjeily Lebanese American University PO. Box, 36, Byblos, Lebanon serj.haddad@lau.edu.lb, chadi.abourjeily@lau.edu.lb

More information

INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATION ENGINEERING & TECHNOLOGY (IJECET)

INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATION ENGINEERING & TECHNOLOGY (IJECET) INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATION ENGINEERING & TECHNOLOGY (IJECET) International Journal of Electronics and Communication Engineering & Technology (IJECET), ISSN 0976 ISSN 0976 6464(Print)

More information

Near-Optimal Low Complexity MLSE Equalization

Near-Optimal Low Complexity MLSE Equalization Near-Optimal Low Complexity MLSE Equalization HC Myburgh and Jan C Olivier Department of Electrical, Electronic and Computer Engineering, University of Pretoria RSA Tel: +27-12-420-2060, Fax +27 12 362-5000

More information

Study of Turbo Coded OFDM over Fading Channel

Study 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 information

NOVEL 6-PSK TRELLIS CODES

NOVEL 6-PSK TRELLIS CODES NOVEL 6-PSK TRELLIS CODES Gerhard Fet tweis Teknekron Communications Systems, 2121 Allston Way, Berkeley, CA 94704, USA phone: (510)649-3576, fax: (510)848-885 1, fet t weis@ t cs.com Abstract The use

More information

PROJECT 5: DESIGNING A VOICE MODEM. Instructor: Amir Asif

PROJECT 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 information

Adaptive Sequence Detection of Channel-Interleaved Trellis-Coded Modulation Signals over Multipath Fading ISI Channels

Adaptive Sequence Detection of Channel-Interleaved Trellis-Coded Modulation Signals over Multipath Fading ISI Channels 1/6 Adaptive Sequence Detection of Channel-Interleaved Trellis-Coded Modulation Signals over Multipath Fading ISI Channels Heung-No Lee and Gregory J. Pottie Electrical Engineering Department, University

More information

ECE 6640 Digital Communications

ECE 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 information

Channel Coding RADIO SYSTEMS ETIN15. Lecture no: Ove Edfors, Department of Electrical and Information Technology

Channel 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 information

THE computational complexity of optimum equalization of

THE computational complexity of optimum equalization of 214 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 53, NO. 2, FEBRUARY 2005 BAD: Bidirectional Arbitrated Decision-Feedback Equalization J. K. Nelson, Student Member, IEEE, A. C. Singer, Member, IEEE, U. Madhow,

More information

Performance comparison of convolutional and block turbo codes

Performance 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 information

ANALYSIS OF ADSL2 s 4D-TCM PERFORMANCE

ANALYSIS OF ADSL2 s 4D-TCM PERFORMANCE ANALYSIS OF ADSL s 4D-TCM PERFORMANCE Mohamed Ghanassi, Jean François Marceau, François D. Beaulieu, and Benoît Champagne Department of Electrical & Computer Engineering, McGill University, Montreal, Quebec

More information

TCM-coded OFDM assisted by ANN in Wireless Channels

TCM-coded OFDM assisted by ANN in Wireless Channels 1 Aradhana Misra & 2 Kandarpa Kumar Sarma Dept. of Electronics and Communication Technology Gauhati University Guwahati-781014. Assam, India Email: aradhana66@yahoo.co.in, kandarpaks@gmail.com Abstract

More information

THE idea behind constellation shaping is that signals with

THE 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 information

Robust Reed Solomon Coded MPSK Modulation

Robust 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 information

RADIO SYSTEMS ETIN15. Channel Coding. Ove Edfors, Department of Electrical and Information Technology

RADIO 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 information

FOR applications requiring high spectral efficiency, there

FOR applications requiring high spectral efficiency, there 1846 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 11, NOVEMBER 2004 High-Rate Recursive Convolutional Codes for Concatenated Channel Codes Fred Daneshgaran, Member, IEEE, Massimiliano Laddomada, Member,

More information

Error Control Codes. Tarmo Anttalainen

Error 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 information

Bit-Interleaved Coded Modulation for Delay-Constrained Mobile Communication Channels

Bit-Interleaved Coded Modulation for Delay-Constrained Mobile Communication Channels Bit-Interleaved Coded Modulation for Delay-Constrained Mobile Communication Channels Hugo M. Tullberg, Paul H. Siegel, IEEE Fellow Center for Wireless Communications UCSD, 9500 Gilman Drive, La Jolla CA

More information

Turbo coding (CH 16)

Turbo 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 information

ECE 6640 Digital Communications

ECE 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 information

Simulink Modeling of Convolutional Encoders

Simulink 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 information

Novel BICM HARQ Algorithm Based on Adaptive Modulations

Novel BICM HARQ Algorithm Based on Adaptive Modulations Novel BICM HARQ Algorithm Based on Adaptive Modulations Item Type text; Proceedings Authors Kumar, Kuldeep; Perez-Ramirez, Javier Publisher International Foundation for Telemetering Journal International

More information

Know your Algorithm! Architectural Trade-offs in the Implementation of a Viterbi Decoder. Matthias Kamuf,

Know your Algorithm! Architectural Trade-offs in the Implementation of a Viterbi Decoder. Matthias Kamuf, Know your Algorithm! Architectural Trade-offs in the Implementation of a Viterbi Decoder Matthias Kamuf, 2009-12-08 Agenda Quick primer on communication and coding The Viterbi algorithm Observations to

More information

Notes 15: Concatenated Codes, Turbo Codes and Iterative Processing

Notes 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 information

Master s Thesis Defense

Master s Thesis Defense Master s Thesis Defense Serially Concatenated Coded Continuous Phase Modulation for Aeronautical Telemetry Kanagaraj Damodaran August 14, 2008 Committee Dr. Erik Perrins (Chair) Dr. Victor Frost Dr. James

More information

Bit-Interleaved Coded Modulation with Iterative Decoding in Impulsive Noise

Bit-Interleaved Coded Modulation with Iterative Decoding in Impulsive Noise Bit-Interleaved Coded Modulation with Iterative Decoding in Impulsive Noise Trung Q. Bui and Ha H. Nguyen Department of Electrical Engineering, University of Saskatchewan 57 Campus Drive, Saskatoon, SK,

More information

Collaborative decoding in bandwidth-constrained environments

Collaborative decoding in bandwidth-constrained environments 1 Collaborative decoding in bandwidth-constrained environments Arun Nayagam, John M. Shea, and Tan F. Wong Wireless Information Networking Group (WING), University of Florida Email: arun@intellon.com,

More information

Pragmatic Trellis Coded Modulation: A Simulation Using 24-Sector Quantized 8-PSK

Pragmatic Trellis Coded Modulation: A Simulation Using 24-Sector Quantized 8-PSK Southern Illinois University Carbondale OpenSIUC Conference Proceedings Department of Electrical and Computer Engineering 4-1992 Pragmatic Trellis Coded Modulation: A Simulation Using 24-Sector Quantized

More information

Disclaimer. Primer. Agenda. previous work at the EIT Department, activities at Ericsson

Disclaimer. Primer. Agenda. previous work at the EIT Department, activities at Ericsson Disclaimer Know your Algorithm! Architectural Trade-offs in the Implementation of a Viterbi Decoder This presentation is based on my previous work at the EIT Department, and is not connected to current

More information

Physical-Layer Network Coding Using GF(q) Forward Error Correction Codes

Physical-Layer Network Coding Using GF(q) Forward Error Correction Codes Physical-Layer Network Coding Using GF(q) Forward Error Correction Codes Weimin Liu, Rui Yang, and Philip Pietraski InterDigital Communications, LLC. King of Prussia, PA, and Melville, NY, USA Abstract

More information

On Iterative Multistage Decoding of Multilevel Codes for Frequency Selective Channels

On Iterative Multistage Decoding of Multilevel Codes for Frequency Selective Channels On terative Multistage Decoding of Multilevel Codes for Frequency Selective Channels B.Baumgartner, H-Griesser, M.Bossert Department of nformation Technology, University of Ulm, Albert-Einstein-Allee 43,

More information

MULTILEVEL CODING (MLC) with multistage decoding

MULTILEVEL 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

Error 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 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 information

EFFECTIVE 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 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 information

An Improved Rate Matching Method for DVB Systems Through Pilot Bit Insertion

An Improved Rate Matching Method for DVB Systems Through Pilot Bit Insertion Research Journal of Applied Sciences, Engineering and Technology 4(18): 3251-3256, 2012 ISSN: 2040-7467 Maxwell Scientific Organization, 2012 Submitted: December 28, 2011 Accepted: March 02, 2012 Published:

More information

Optimized Codes for the Binary Coded Side-Information Problem

Optimized Codes for the Binary Coded Side-Information Problem Optimized Codes for the Binary Coded Side-Information Problem Anne Savard, Claudio Weidmann ETIS / ENSEA - Université de Cergy-Pontoise - CNRS UMR 8051 F-95000 Cergy-Pontoise Cedex, France Outline 1 Introduction

More information

COMBINED TRELLIS CODED QUANTIZATION/CONTINUOUS PHASE MODULATION (TCQ/TCCPM)

COMBINED TRELLIS CODED QUANTIZATION/CONTINUOUS PHASE MODULATION (TCQ/TCCPM) COMBINED TRELLIS CODED QUANTIZATION/CONTINUOUS PHASE MODULATION (TCQ/TCCPM) Niyazi ODABASIOGLU 1, OnurOSMAN 2, Osman Nuri UCAN 3 Abstract In this paper, we applied Continuous Phase Frequency Shift Keying

More information

Master s Thesis Defense

Master s Thesis Defense Master s Thesis Defense Comparison of Noncoherent Detectors for SOQPSK and GMSK in Phase Noise Channels Afzal Syed August 17, 2007 Committee Dr. Erik Perrins (Chair) Dr. Glenn Prescott Dr. Daniel Deavours

More information

BER and PER estimation based on Soft Output decoding

BER and PER estimation based on Soft Output decoding 9th International OFDM-Workshop 24, Dresden BER and PER estimation based on Soft Output decoding Emilio Calvanese Strinati, Sébastien Simoens and Joseph Boutros Email: {strinati,simoens}@crm.mot.com, boutros@enst.fr

More information

ECE 8771, Information Theory & Coding for Digital Communications Summer 2010 Syllabus & Outline (Draft 1 - May 12, 2010)

ECE 8771, Information Theory & Coding for Digital Communications Summer 2010 Syllabus & Outline (Draft 1 - May 12, 2010) ECE 8771, Information Theory & Coding for Digital Communications Summer 2010 Syllabus & Outline (Draft 1 - May 12, 2010) Instructor: Kevin Buckley, Tolentine 433a, 610-519-5658 (W), 610-519-4436 (F), buckley@ece.vill.edu,

More information

Performance of Turbo Product Code in Wimax

Performance of Turbo Product Code in Wimax Performance of Turbo Product Code in Wimax Trushita Chaware Department of Information Technology Thakur College of Engineering and Technology Kandivali(E), Mumbai, India Nileema Pathak Computer Engineering

More information

ERROR CONTROL CODING From Theory to Practice

ERROR CONTROL CODING From Theory to Practice ERROR CONTROL CODING From Theory to Practice Peter Sweeney University of Surrey, Guildford, UK JOHN WILEY & SONS, LTD Contents 1 The Principles of Coding in Digital Communications 1.1 Error Control Schemes

More information

Study of turbo codes across space time spreading channel

Study of turbo codes across space time spreading channel University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2004 Study of turbo codes across space time spreading channel I.

More information

Information Processing and Combining in Channel Coding

Information Processing and Combining in Channel Coding Information Processing and Combining in Channel Coding Johannes Huber and Simon Huettinger Chair of Information Transmission, University Erlangen-Nürnberg Cauerstr. 7, D-958 Erlangen, Germany Email: [huber,

More information

Combined Transmitter Diversity and Multi-Level Modulation Techniques

Combined Transmitter Diversity and Multi-Level Modulation Techniques SETIT 2005 3rd International Conference: Sciences of Electronic, Technologies of Information and Telecommunications March 27 3, 2005 TUNISIA Combined Transmitter Diversity and Multi-Level Modulation Techniques

More information

Physical Layer: Modulation, FEC. Wireless Networks: Guevara Noubir. S2001, COM3525 Wireless Networks Lecture 3, 1

Physical 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 information

Performance Analysis of MIMO Equalization Techniques with Highly Efficient Channel Coding Schemes

Performance Analysis of MIMO Equalization Techniques with Highly Efficient Channel Coding Schemes Performance Analysis of MIMO Equalization Techniques with Highly Efficient Channel Coding Schemes Neha Aggarwal 1 Shalini Bahel 2 Teglovy Singh Chohan 3 Jasdeep Singh 4 1,2,3,4 Department of Electronics

More information

SNR Estimation in Nakagami Fading with Diversity for Turbo Decoding

SNR Estimation in Nakagami Fading with Diversity for Turbo Decoding SNR Estimation in Nakagami Fading with Diversity for Turbo Decoding A. Ramesh, A. Chockalingam Ý and L. B. Milstein Þ Wireless and Broadband Communications Synopsys (India) Pvt. Ltd., Bangalore 560095,

More information

Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes

Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 9, SEPTEMBER 2003 2141 Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes Jilei Hou, Student

More information

Statistical Communication Theory

Statistical Communication Theory Statistical Communication Theory Mark Reed 1 1 National ICT Australia, Australian National University 21st February 26 Topic Formal Description of course:this course provides a detailed study of fundamental

More information

Pragmatic Trellis Coded Modulation: A Hardware Implementation Using 24-sector 8-PSK

Pragmatic Trellis Coded Modulation: A Hardware Implementation Using 24-sector 8-PSK Southern Illinois University Carbondale OpenSIUC Conference Proceedings Department of Electrical and Computer Engineering 6-1992 Pragmatic Trellis Coded Modulation: A Hardware Implementation Using 24-sector

More information

AN IMPROVED NEURAL NETWORK-BASED DECODER SCHEME FOR SYSTEMATIC CONVOLUTIONAL CODE. A Thesis by. Andrew J. Zerngast

AN IMPROVED NEURAL NETWORK-BASED DECODER SCHEME FOR SYSTEMATIC CONVOLUTIONAL CODE. A Thesis by. Andrew J. Zerngast AN IMPROVED NEURAL NETWORK-BASED DECODER SCHEME FOR SYSTEMATIC CONVOLUTIONAL CODE A Thesis by Andrew J. Zerngast Bachelor of Science, Wichita State University, 2008 Submitted to the Department of Electrical

More information

Bit-Interleaved Coded Modulation: Low Complexity Decoding

Bit-Interleaved Coded Modulation: Low Complexity Decoding Bit-Interleaved Coded Modulation: Low Complexity Decoding Enis Aay and Ender Ayanoglu Center for Pervasive Communications and Computing Department of Electrical Engineering and Computer Science The Henry

More information

On the performance of Turbo Codes over UWB channels at low SNR

On the performance of Turbo Codes over UWB channels at low SNR On the performance of Turbo Codes over UWB channels at low SNR Ranjan Bose Department of Electrical Engineering, IIT Delhi, Hauz Khas, New Delhi, 110016, INDIA Abstract - In this paper we propose the use

More information

Reliability-Based Hybrid ARQ as an Adaptive Response to Jamming

Reliability-Based Hybrid ARQ as an Adaptive Response to Jamming IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 23, NO. 5, MAY 2005 1045 Reliability-Based Hybrid ARQ as an Adaptive Response to Jamming Abhinav Roongta, Student Member, IEEE, Jang-Wook Moon, Student

More information

T efficient coded modulation scheme [ 13, has found

T efficient coded modulation scheme [ 13, has found 874 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 41, NO. 6, JUNE 1993 A Modified Design of Trellis-Coded MPSK for the Fading Channel Shalini S. Periyalwar, Member, IEEE, and Solomon M. Fleisher, Senior Member,

More information

Contents Chapter 1: Introduction... 2

Contents 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 information

Polar Codes for Magnetic Recording Channels

Polar Codes for Magnetic Recording Channels Polar Codes for Magnetic Recording Channels Aman Bhatia, Veeresh Taranalli, Paul H. Siegel, Shafa Dahandeh, Anantha Raman Krishnan, Patrick Lee, Dahua Qin, Moni Sharma, and Teik Yeo University of California,

More information

The BICM Capacity of Coherent Continuous-Phase Frequency Shift Keying

The BICM Capacity of Coherent Continuous-Phase Frequency Shift Keying The BICM Capacity of Coherent Continuous-Phase Frequency Shift Keying Rohit Iyer Seshadri, Shi Cheng and Matthew C. Valenti Lane Dept. of Computer Sci. and Electrical Eng. West Virginia University Morgantown,

More information

Department of Electronics and Communication Engineering 1

Department 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 information

Turbo-coding of Coherence Multiplexed Optical PPM CDMA System With Balanced Detection

Turbo-coding of Coherence Multiplexed Optical PPM CDMA System With Balanced Detection American Journal of Applied Sciences 4 (5): 64-68, 007 ISSN 1546-939 007 Science Publications Turbo-coding of Coherence Multiplexed Optical PPM CDMA System With Balanced Detection K. Chitra and V.C. Ravichandran

More information

Constellation Shaping for LDPC-Coded APSK

Constellation Shaping for LDPC-Coded APSK Constellation Shaping for LDPC-Coded APSK Matthew C. Valenti Lane Department of Computer Science and Electrical Engineering West Virginia University U.S.A. Mar. 14, 2013 ( Lane Department LDPCof Codes

More information

VITERBI ALGORITHM IN CONTINUOUS-PHASE FREQUENCY SHIFT KEYING

VITERBI 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 information

THE rapid growth of the laptop and handheld computer

THE rapid growth of the laptop and handheld computer IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 5, NO. 4, APRIL 004 643 Trellis-Coded Multiple-Pulse-Position Modulation for Wireless Infrared Communications Hyuncheol Park, Member, IEEE, and John R. Barry Abstract

More information

Coding for the Slepian-Wolf Problem With Turbo Codes

Coding for the Slepian-Wolf Problem With Turbo Codes Coding for the Slepian-Wolf Problem With Turbo Codes Jan Bajcsy and Patrick Mitran Department of Electrical and Computer Engineering, McGill University Montréal, Québec, HA A7, Email: {jbajcsy, pmitran}@tsp.ece.mcgill.ca

More information

CT-516 Advanced Digital Communications

CT-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 information

WITH the introduction of space-time codes (STC) it has

WITH the introduction of space-time codes (STC) it has IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 59, NO. 6, JUNE 2011 2809 Pragmatic Space-Time Trellis Codes: GTF-Based Design for Block Fading Channels Velio Tralli, Senior Member, IEEE, Andrea Conti, Senior

More information

TSTE17 System Design, CDIO. General project hints. Behavioral Model. General project hints, cont. Lecture 5. Required documents Modulation, cont.

TSTE17 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 information

Lecture 17 Components Principles of Error Control Borivoje Nikolic March 16, 2004.

Lecture 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 information

TURBO codes are an exciting new channel coding scheme

TURBO codes are an exciting new channel coding scheme IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 46, NO. 11, NOVEMBER 1998 1451 Turbo Codes for Noncoherent FH-SS With Partial Band Interference Joseph H. Kang, Student Member, IEEE, and Wayne E. Stark, Fellow,

More information

Noisy Index Coding with Quadrature Amplitude Modulation (QAM)

Noisy Index Coding with Quadrature Amplitude Modulation (QAM) Noisy Index Coding with Quadrature Amplitude Modulation (QAM) Anjana A. Mahesh and B Sundar Rajan, arxiv:1510.08803v1 [cs.it] 29 Oct 2015 Abstract This paper discusses noisy index coding problem over Gaussian

More information

Turbo Coded Pulse Position Modulation for Optical Communications

Turbo Coded Pulse Position Modulation for Optical Communications Turbo Coded Pulse Position Modulation for Optical Communications A THESIS Presented to The Academic Faculty By Abdallah Said Alahmari In Partial Fulfillment of the Requirements for the Degree of Doctor

More information

Soft Channel Encoding; A Comparison of Algorithms for Soft Information Relaying

Soft Channel Encoding; A Comparison of Algorithms for Soft Information Relaying IWSSIP, -3 April, Vienna, Austria ISBN 978-3--38-4 Soft Channel Encoding; A Comparison of Algorithms for Soft Information Relaying Mehdi Mortazawi Molu Institute of Telecommunications Vienna University

More information

Symbol-by-Symbol MAP Decoding of Variable Length Codes

Symbol-by-Symbol MAP Decoding of Variable Length Codes Symbol-by-Symbol MA Decoding of Variable Length Codes Rainer Bauer and Joachim Hagenauer Institute for Communications Engineering (LNT) Munich University of Technology (TUM) e-mail: Rainer.Bauer@ei.tum.de,

More information

On Bit-Wise Decoders for Coded Modulation. Mikhail Ivanov

On Bit-Wise Decoders for Coded Modulation. Mikhail Ivanov Thesis for the Degree of Licentiate of Engineering On Bit-Wise Decoders for Coded Modulation Mikhail Ivanov Communication Systems Group Department of Signals and Systems Chalmers University of Technology

More information

a) Abasebanddigitalcommunicationsystemhasthetransmitterfilterg(t) thatisshowninthe figure, and a matched filter at the receiver.

a) Abasebanddigitalcommunicationsystemhasthetransmitterfilterg(t) thatisshowninthe figure, and a matched filter at the receiver. DIGITAL COMMUNICATIONS PART A (Time: 60 minutes. Points 4/0) Last Name(s):........................................................ First (Middle) Name:.................................................

More information

Background Dirty Paper Coding Codeword Binning Code construction Remaining problems. Information Hiding. Phil Regalia

Background Dirty Paper Coding Codeword Binning Code construction Remaining problems. Information Hiding. Phil Regalia Information Hiding Phil Regalia Department of Electrical Engineering and Computer Science Catholic University of America Washington, DC 20064 regalia@cua.edu Baltimore IEEE Signal Processing Society Chapter,

More information