© Tallal Elshabrawy Trellis Coded Modulation. © Tallal Elshabrawy Trellis Coded Modulation: Introduction Increases the constellation size compared to.

Slides:



Advertisements
Similar presentations
Convolutional Codes Mohammad Hanaysheh Mahdi Barhoush.
Advertisements

II. Modulation & Coding. © Tallal Elshabrawy Design Goals of Communication Systems 1.Maximize transmission bit rate 2.Minimize bit error probability 3.Minimize.
Coherent phase shift keying In coherent phase shift keying different phase modulation schemes will be covered i.e. binary PSK, quadrature phase shift keying.
Maximum Likelihood Sequence Detection (MLSD) and the Viterbi Algorithm
Submission May, 2000 Doc: IEEE / 086 Steven Gray, Nokia Slide Brief Overview of Information Theory and Channel Coding Steven D. Gray 1.
Cellular Communications
EEE377 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.
Coding and Error Control
Multiple-input multiple-output (MIMO) communication systems
Figure 6.1. A convolutional encoder. Figure 6.2. Structure of a systematic convolutional encoder of rate.
Coded Modulation in Fading Channels Ryan Aures Matthew Holland ECE 492 Mobile Communications.
IASTED- WOC- Canada 07 1 CONVOLUTIONAL CODED DPIM FOR INDOOR NON-DIFFUSE OPTICAL WIRELESS LINK S. Rajbhandari, Z. Ghassemlooy, N. M. Adibbiat, M. Amiri.
1 Today, we are going to talk about: Shannon limit Comparison of different modulation schemes Trade-off between modulation and coding.
Improving the Performance of Turbo Codes by Repetition and Puncturing Youhan Kim March 4, 2005.
Super-Orthogonal Space- Time BPSK Trellis Code Design for 4 Transmit Antennas in Fast Fading Channels Asli Birol Yildiz Technical University,Istanbul,Turkey.
Multilevel Coding and Iterative Multistage Decoding ELEC 599 Project Presentation Mohammad Jaber Borran Rice University April 21, 2000.
Channel Coding and Error Control
BER of BPSK Figure 6.3 Signal-space diagram for coherent binary PSK system. The waveforms depicting the transmitted signals s1(t) and s2(t),
I. Previously on IET.
III. Turbo Codes.
1 Chapter 8. Coding and Error Control Wen-Shyang Hwang KUAS EE.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 12.
Basic Characteristics of Block Codes
Introduction of Low Density Parity Check Codes Mong-kai Ku.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Coded Modulation for Multiple Antennas over Fading Channels
TI Cellular Mobile Communication Systems Lecture 4 Engr. Shahryar Saleem Assistant Professor Department of Telecom Engineering University of Engineering.
1 Coded modulation So far: Binary coding Binary modulation Will send R bits/symbol (spectral efficiency = R) Constant transmission rate: Requires bandwidth.
Real-Time Turbo Decoder Nasir Ahmed Mani Vaya Elec 434 Rice University.
Last time, we talked about:
Introduction to Digital Communication
802.11b PHY Wireless LANs Page 1 of 23 IEEE b WLAN Physical Layer Svetozar Broussev 16-Feb-2005.
APAN ‘06, July, 2006Ng Chee Kyun1 Performance Analysis of TPSK in CDMA System Ng Chee Kyun Department of Computer and Communication Systems Engineering,
Sujan Rajbhandari LCS Convolutional Coded DPIM for Indoor Optical Wireless Links S. Rajbhandari, N. M. Aldibbiat and Z. Ghassemlooy Optical Communications.
Wireless Communication Research Lab. CGU What is Convolution Code? 指導教授:黃文傑 博士 學生:吳濟廷
SNS COLLEGE OF ENGINEERING Department of Electronics and Communication Engineering Subject: Digital communication Sem: V Convolutional Codes.
Error Control Coding. Purpose To detect and correct error(s) that is introduced during transmission of digital signal.
Overview of MB-OFDM UWB Baseband Channel Codec for MB-OFDM UWB 2006/10/27 Speaker: 蔡佩玲.
Block Coded Modulation Tareq Elhabbash, Yousef Yazji, Mahmoud Amassi.
1 Code design: Computer search Low rate: Represent code by its generator matrix Find one representative for each equivalence class of codes Permutation.
II. Linear Block Codes. © Tallal Elshabrawy 2 Digital Communication Systems Source of Information User of Information Source Encoder Channel Encoder Modulator.
Classical Coding for Forward Error Correction Prof JA Ritcey Univ of Washington.
V. Non-Binary Codes: Introduction to Reed Solomon Codes
DIGITAL SYTEM DESIGN MINI PROJECT CONVOLUTION CODES
The Viterbi Decoding Algorithm
Space Time Codes.
Error Detection and Correction
I. Previously on IET.
Pipelined Architectures for High-Speed and Area-Efficient Viterbi Decoders Chen, Chao-Nan Chu, Hsi-Cheng.
Shi Cheng and Matthew C. Valenti Lane Dept. of CSEE
Coding and Interleaving
Interleaver-Division Multiple Access on the OR Channel
Trellis Coded Modulation
PBCC-22 Chris Heegard, Ph.D.,
Chapter 6.
PBCC-22 Chris Heegard, Ph.D.,
Error Correction Code (2)
Error Correction Code (2)
I. Previously on IET.
Digital Communication Chapter 1: Introduction
Chapter 10 Error-Control Coding.
IV. Convolutional Codes
Chapter 10: Error-Control Coding
Coding and Error Control
II. Modulation & Coding.
Error Correction Code (2)
COS 463: Wireless Networks Lecture 9 Kyle Jamieson
9-July-2007 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [DecaWave Proposal for TG3c Alternative PHY]
Homework #2 Due May 29 , Consider a (2,1,4) convolutional code with g(1) = 1+ D2, g(2) = 1+ D + D2 + D3 a. Draw the.
IV. Convolutional Codes
Presentation transcript:

© Tallal Elshabrawy Trellis Coded Modulation

© Tallal Elshabrawy Trellis Coded Modulation: Introduction Increases the constellation size compared to uncoded communication Increases in throughput (b/s/Hz) Decline in BER performance due to decrease of d min Trellis Coded Modulation (TCM) is used to offset loss resulting from constellation size increase TCM achieves this higher gain by jointly using the distance properties of the code and the distance properties of the constellation, by carefully mapping coded and uncoded bits to the constellation points. TCM uses “set partitioning” to map the bits to the constellation points

© Tallal Elshabrawy Ungerboek Set Partitioning Ungerboeck Set partitioning: Partition a constellation such that in each partition the minimum distance increases. For binary data, in each stage we partition the constellation (signal set) into two subsets. The number of stages depends on the particular TCM scheme.

© Tallal Elshabrawy Ungerboek Partitioning of 8-PSK Constellation A0A0 B0B0 B1B1 C0C0 C1C1 C2C2 C3C

© Tallal Elshabrawy Convolutional Codes (Reminder)

© Tallal Elshabrawy Introduction Block Codes: Code words are produced on a block by block basis. In Block Codes, the encoder must buffer an entire block before generating the associated codeword. Some applications have bits arrive serially rather than in large blocks Convolutional codes operate on the incoming message sequence continuously in a serial manner

© Tallal Elshabrawy Convolutional Codes Specification A convolutional code is specified by three parameters (n, k, K), where k/n is the coding rate and determines the number of data bits per coded bit K is called the constraint length of the encoder where the encoder has K-1 memory elements

© Tallal Elshabrawy Convolutional Encoder: Example Input Output Rate ½ Convolutional Encoder c1c1 c2c2

© Tallal Elshabrawy Convolutional Encoder: Example Input Output Rate ½ Convolutional Encoder c1c1 c2c2 1

© Tallal Elshabrawy Convolutional Encoder: Example Input Output Rate ½ Convolutional Encoder c1c1 c2c

© Tallal Elshabrawy Convolutional Encoder: Example Input Output Rate ½ Convolutional Encoder c1c1 c2c

© Tallal Elshabrawy b0b0 b1b1 States (b 0 b 1 ) s 0 00 s 1 10 s 2 01 s 3 11 S0S0 S3S3 S1S1 S2S2 0/00 1/11 1/00 0/01 1/10 1/01 0/10 0/11 Input 0 Input 1 State Diagram Representation

© Tallal Elshabrawy s 0 (0 0) s 1 (1 0) s 2 (0 1) s 3 (1 1) S 0 S 3 S 1 S 2 0/00 1/11 1/00 0/01 1/10 1/01 0/10 0/11 Trellis Representation

© Tallal Elshabrawy s 0 (0 0) s 1 (1 0) s 2 (0 1) s 3 (1 1) Input: 101  Output: S 0 S 3 S 1 S 2 0/00 1/11 1/00 0/01 1/10 1/01 0/10 0/ Trellis Representation

© Tallal Elshabrawy Trellis Representation of QPSK Trellis Representation

© Tallal Elshabrawy Trellis Representation of QPSK D min for 3 Consecutive Symbols

© Tallal Elshabrawy Trellis Representation of QPSK D min for 3 Consecutive Symbols

© Tallal Elshabrawy Trellis Representation of QPSK D min for 3 Consecutive Symbols

© Tallal Elshabrawy Trellis Representation of QPSK D min for 3 Consecutive Symbols

© Tallal Elshabrawy Trellis Representation of QPSK D min for 3 Consecutive Symbols

© Tallal Elshabrawy Trellis Representation of QPSK D min for 3 Consecutive Symbols

© Tallal Elshabrawy Trellis Representation of QPSK D min for 3 Consecutive Symbols

© Tallal Elshabrawy Trellis Representation of QPSK Summary) d min for 3 Consecutive Symbols S0S0 S0S0

© Tallal Elshabrawy Four State Trellis with Parallel Paths

© Tallal Elshabrawy Four State Trellis with Parallel Paths D min for 3 Consecutive Symbols 0 0 0

© Tallal Elshabrawy Four State Trellis with Parallel Paths D min for 3 Consecutive Symbols 0 0 0

© Tallal Elshabrawy Four State Trellis with Parallel Paths D min for 3 Consecutive Symbols Distance between and 2 1 2

© Tallal Elshabrawy Four State Trellis with Parallel Paths D min for 3 Consecutive Symbols Distance between and Is this D min ?

© Tallal Elshabrawy Four State Trellis with Parallel Paths D min for 3 Consecutive Symbols Distance between and 0 0 4

© Tallal Elshabrawy Four State Trellis with Parallel Paths D min for 3 Consecutive Symbols Distance between and Is this D min ?  YES & it is better than that of uncoded QPSK

© Tallal Elshabrawy Coding Gain Four State Trellis TCM 31 Union Bound Coding Gain Four State Trellis TCM

© Tallal Elshabrawy Eight State Trellis without Parallel Paths 32 S0S0 S1S1 S2S2 S3S3 S4S4 S5S5 S6S6 S7S

© Tallal Elshabrawy Eight State Trellis without Parallel Paths d min for 3 Consecutive Symbols Distance between and 6 7 6

© Tallal Elshabrawy Coding Gain Eight State Trellis TCM 34 Union Bound Coding Gain Four State Trellis TCM

© Tallal Elshabrawy Encoder for Four State Trellis TCM m1m1 m2m2 u1u1 u2u2 u3u3

© Tallal Elshabrawy Encoder for Four State Trellis TCM m1m1 m2m2 u1u1 u2u2 u3u3 0 S 0 (00) S 1 (10) S 2 (01) S 3 (11)

© Tallal Elshabrawy Encoder for Four State Trellis TCM m1m1 m2m2 u1u1 u2u2 u3u3 1 S 0 (00) S 1 (10) S 2 (01) S 3 (11)

© Tallal Elshabrawy Encoder for Four State Trellis TCM m1m1 m2m2 u1u1 u2u2 u3u3 0 S 0 (00) S 1 (10) S 2 (01) S 3 (11)

© Tallal Elshabrawy Encoder for Four State Trellis TCM m1m1 m2m2 u1u1 u2u2 u3u3 S 0 (00) S 1 (10) S 2 (01) S 3 (11)

© Tallal Elshabrawy Encoder for Four State Trellis TCM m1m1 m2m2 u1u1 u2u2 u3u3 S 0 (00) S 1 (10) S 2 (01) S 3 (11)