Trellis Coded Modulation

Attribution Non-Commercial (BY-NC)

52 views

Trellis Coded Modulation

Attribution Non-Commercial (BY-NC)

- ec341
- Adc Syllabus
- ST7540 Power Line Modem Demokit
- ubiccjournalvolume2no3_Letter1_94
- Electronic Communication & Data Communication
- Individual Assignment DCS
- Inatel14-MSK
- InfThe-L1
- Modulation
- Modulazioni Rel 77
- Welcome to International Journal of Engineering Research and Development (IJERD)
- IJETAE_0212_08122
- Introduction to Spread Spectrum Communications
- Myth and realities
- Analysis and Simulation of Uhf Rfid System
- Modulation
- ch06-part 4
- Datasheet_MLX90121
- modulation
- ADAPTIVE MODULATION AND CODING.pptx

You are on page 1of 22

Multi-dimensional TCM

(TCM)

DESPOINA GEORGIADOU

Chania 2008

Introduction

Multi-dimensional TCM

Outline

Introduction About trellis coded modulation TCM code construction Steps of construction Mapping by set partitioning Multi-dimensional TCM

Multi-dimensional TCM

Introduction

Coding is a digital function and modulation is an analog function. These functions are done separately and independently in most common modulation schemes. In Trellis Coded Modulation (TCM), however the two are combined in one function, hence its name. The word trellis stands for the use of trellis (also called convolutional) codes.

Multi-dimensional TCM

General trellis coded modulation The functions of a TCM consist of a Trellis code and a constellation mapper as shown in Figure 3. TCM combines the functions of a convolutional coder of rate R = k / k + 1 and a M-ary signal mapper that maps M = 2k input points into a larger constellation of M = 2k +1 constellation points.

Multi-dimensional TCM

General information about TCM TCM is a bandwidth efcient modulation based on convolutional coding. It conserves bandwidth by doubling the number of constellation points of the signal. This way the bit rate increases but the symbol rate stays the same. Unlike a true Convolutional code, not all incoming bits are coded and only 1 extra bit is always added. Increasing the constellation size reduces Euclidean distances between the constellation points but sequence coding offers a coding gain that overcomes the power disadvantage of going to the higher constellation. The decoding metric is the Euclidean distance and not the Hamming distance. TCM uses set-partitioning and small number of states.

Introduction

Multi-dimensional TCM

TCM CODE CONSTRUCTION The main steps in designing a TCM system are:

1 2 3

Specically: We start with a given bandwidth B from which we determine the maximum possible symbol rate (never more than 2B). Then we determine the size of the alphabet that can deliver the needed signal BER at the given available power. Last, we assign binary labels, representing encoder output blocks, to the signal points in such a way that squared Euclidean distance d is maximized (set partitioning).

Multi-dimensional TCM

We can map k information bits to 2k +1 constellation points such that the signals get further apart increasing the Euclidean distance between the signals in that set. This mapping follows from successive partitioning of a channel-signal set into subsets with increasing minimum distances d0 < d1 < d2 ... between the signals of these subsets.

Multi-dimensional TCM

Mapping by set partitioning - Example Consider 8-PSK channel signals an with E |a2 n | = 1.

The 8 points are successively partioned into disjoint cosets such that the SEDs are increasing at each level. There are total of four partitions counting the rst unpartitioned set. At top-most level, the SED is 0.586. At the next level, where there are only four points in each of the two cosets, the SED has increased to 2.0 and at the last level, the SED is 4.0.

The distances above are Squared Euclidean and came up from the geometry of the constellation.

1

Multi-dimensional TCM

Mapping by set partitioning - Example Explanation There are 3 incoming bits from the code:

1 2

b1: the uncoded bit b2, b3: the coded bits Since the top levels have smaller distances and the errors at this level are more likely, we will use the coded bits to traverse through this part. So, with b3 and b2 we decide which partition to choose and then we can use the uncoded bit at the last level to pick the signal transmitted. Two symbols at last level that differ only at bit b1 have a large Euclidean distance and would require an error of 180 degrees to be corrupted.

Multi-dimensional TCM

There is no partition of 8-PSK into two equal-size subsets that achieves a larger SED. Each subset is partitioned into two isomorphic subsets (the one is obtained by rotating the other by x o ). (the second property is not always feasible!)

Introduction

Multi-dimensional TCM

Multi-dimensional TCM

Generally about multi-dimensional TCM We are about to consider the more general case of designing TCM systems that use multidimensional signal sets. Let L the dimension of modulations (for 8-PSK L=2). With L = 1, we transmit just one TCM symbol. With L = 2, we transmit 2 symbols, so that the number of symbols transmitted is equal to L. The main concept in multi-dimensionality is increasing the number of symbols created in one processing period. The transmitted symbols are generated together and this co-generation creates dependence and allows better performance.

Introduction

Multi-dimensional TCM

Multi-dimensional TCM

1

We can transmit fractional information rates. Instead of the effective code rate being 2/3 as it is in 1 x 8PSK, here it can be higher. We can reduce the code overhead by effecting more than one symbol so we can use code rates like 5/6, 8/9 and 11/12. Better bit efciency is possible. We dene bit efciency as number of input information bits divided by the number of symbols transmitted in one processing period. No additional hardware complexity, we can use standard rate 1/2 codes.

Introduction

Multi-dimensional TCM

Multi-dimensional TCM

Example of generating a 2 x 8PSK signal. 4 bits come in and 2 of these go into a rate 1/2 encoder and generate 2 parity bits, for a total of 6 bits. These six bits are then mapped in a special way by the constellation mapper. It is this mapping function that creates the symbol inter-dependency.

Introduction

Multi-dimensional TCM

00 10 20 30 40 50 60 70 01 11 21 31 41 51 61 71 02 12 22 32 42 52 62 72 03 13 23 33 43 53 63 73 04 14 24 34 44 54 64 74 05 15 25 35 45 55 65 75 06 16 26 36 46 56 66 76 07 17 27 37 47 57 67 77

= S L = S*S 2 , L=2

S = {0,1,2,3,4,5,6,7}

Introduction

Multi-dimensional TCM

Partitioning top level The previous table is the top level of our partitioning. Now we partition the top level into two cosets by this way: starting from 00 choose the neighbor points that the SED between them is the biggest possible

00 11 20 31 40 51 60 71 02 13 22 33 42 53 62 73 04 15 24 35 44 55 64 75 06 17 26 37 46 57 66 77 01 10 21 30 41 50 61 70 03 12 23 32 43 52 63 72 05 14 25 34 45 54 65 74 07 16 27 36 47 56 67 76

coset 0 =

coset 1 =

Introduction

Multi-dimensional TCM

00 10 20 30 40 50 60 70 01 11 21 31 41 51 61 71 02 12 22 32 42 52 62 72 03 13 23 33 43 53 63 73 04 14 24 34 44 54 64 74 05 15 25 35 45 55 65 75 06 16 26 36 46 56 66 76 07 17 27 37 47 57 67 77

x0=1 01 10 21 30 41 50 61 70 03 12 23 32 43 52 63 72 05 14 25 34 45 54 65 74 07 16 27 36 47 56 67 76

x0=0 00 11 20 31 40 51 60 71 02 13 22 33 42 53 62 73 04 15 24 35 44 55 64 75 06 17 26 37 46 57 66 77

Introduction

Multi-dimensional TCM

Partitioning level-1 and level-2 Now we partition the 2 cosets of level-1 into four cosets. As an example, the coset0 is partitioned into: coset 00 =

00 20 40 60 02 22 42 62 04 24 44 64 06 26 46 66

coset 01 =

11 31 51 71

13 33 53 73 02 20 42 60

15 35 55 75 06 24 46 64

17 37 57 77

00 22 40 62 04 26 44 66

Introduction

Multi-dimensional TCM

00 10 20 30 40 50 60 70 01 11 21 31 41 51 61 71 02 12 22 32 42 52 62 72 03 13 23 33 43 53 63 73 04 14 24 34 44 54 64 74 05 15 25 35 45 55 65 75 06 16 26 36 46 56 66 76 07 17 27 37 47 57 67 77

x0=1 01 10 21 30 41 50 61 70 03 12 23 32 43 52 63 72 05 14 25 34 45 54 65 74 07 16 27 36 47 56 67 76

x0=0 00 11 20 31 40 51 60 71 02 13 22 33 42 53 62 73 04 15 24 35 44 55 64 75 06 17 26 37 46 57 66 77

x1=0

x1=1 x1=0 11 31 51 71 13 33 53 73 15 35 55 75 17 37 57 77

x1=1

x2=0 00 22 40 62 04 26 44 66

00 20 40 60

02 22 42 62

04 24 44 64

06 26 46 66

x2=1

02 22 42 60

06 26 46 64

Introduction

Multi-dimensional TCM

The partitioning goes on until all single pairs consist a new coset.

00 10 20 30 40 50 60 70 01 11 21 31 41 51 61 71 02 12 22 32 42 52 62 72 03 13 23 33 43 53 63 73 04 14 24 34 44 54 64 74 05 15 25 35 45 55 65 75 06 16 26 36 46 56 66 76 07 17 27 37 47 57 67 77

x0=1 01 10 21 30 41 50 61 70 03 12 23 32 43 52 63 72 05 14 25 34 45 54 65 74 07 16 27 36 47 56 67 76

x0=0 00 11 20 31 40 51 60 71 02 13 22 33 42 53 62 73 04 15 24 35 44 55 64 75 06 17 26 37 46 57 66 77

x1=0

x1=1 x1=0 11 31 51 71 13 33 53 73 15 35 55 75 17 37 57 77

x1=1

x2=0

00 20 40 60 04 26 44 66

02 22 42 62

04 24 44 64

06 26 46 66

x2=1

x3=0 00 04 x 4 = 0 40 44 00 x 5 = 0 44 x 5 = 1 00 44

00 22 40 62

x3=1 22 26 62 66

02 22 42 60

06 26 46 64

x4=1 04 40

Introduction

Multi-dimensional TCM

Coset Generators Each 2 cosets below the same coset can be generated by having only the one of them. The other is generated by adding a signal pair gi to each member of the coset we have. Example coset0 + g0 = coset1, where g0 =01= 0 0

01 05 14 25 34 45 54 65 74 07 16 27 36 47 56 67 76 00 11 20 31 40 51 60 71 02 13 22 33 42 53 62 73 04 15 24 35 44 55 64 75 06 17 26 37 46 57 66 77 01 10 21 30 41 50 61 70 03 12 23 32 43 52 63 72 00

coset 0 + 01 =

+ 01 =

=coset1

Introduction

Multi-dimensional TCM

Partitioning in multi-dimensional TCM All the coset generators are: g0 = (0,1)=[(000),(001)] g2 = (0,2)=[(000),(010)] g4 = (0,4)=[(000),(100)] g1 = (1,1)=[(001),(001)] g3 = (2,2)=[(010),(010)] g5 = (4,4)=[(100),(100)]

The coset generators are more useful than you may thought: Take for example an incoming vector x = (x5 , x4 , x3 , x2 , x1 , x0 ) = (0,1,0,1,0,1) We multiply each bit by its coset generator to determine which coset it falls in, let Y. Y=x5 g5 + x4 g4 + x3 g3 + x2 g2 + x1 g1 + x0 g0 = x5 (4, 4)+ x4 (0, 4)+ x3 (2, 2)+ x2 (0, 2)+ x1 (1, 1)+ x0 (0, 1) = (0,7) = [(000)T , (111)T ]=[Y1 , Y2 ]

Introduction

Multi-dimensional TCM

Partitioning in multi-dimensional TCM For x = (x5 , x4 , x3 , x2 , x1 , x0 ) = (1,0,0,0,0,0) we get: Y=x5 (4, 4) + x4 (0, 4) + x3 (2, 2) + x2 (0, 2) + x1 (1, 1) + x0 (0, 1)=(4,4)=[(100)T , (100)T ]

00 10 20 30 40 50 60 70 01 11 21 31 41 51 61 71 02 12 22 32 42 52 62 72 03 13 23 33 43 53 63 73 04 14 24 34 44 54 64 74 05 15 25 35 45 55 65 75 06 16 26 36 46 56 66 76 07 17 27 37 47 57 67 77

x0=1 01 10 21 30 41 50 61 70 03 12 23 32 43 52 63 72 05 14 25 34 45 54 65 74 07 16 27 36 47 56 67 76

x0=0 00 11 20 31 40 51 60 71 02 13 22 33 42 53 62 73 04 15 24 35 44 55 64 75 06 17 26 37 46 57 66 77

x1=0

x1=1 x1=0 11 31 51 71 13 33 53 73 15 35 55 75 17 37 57 77

x1=1

x2=0

00 20 40 60 04 26 44 66

02 22 42 62

04 24 44 64

06 26 46 66

x2=1

x3=0 00 04 x 4 = 0 40 44 00 x 5 = 0 44 x 5 = 1 00

00 22 40 62

x3=1 22 26 62 66

02 22 42 60

06 26 46 64

x4=1 04 40

4 4 =(100,100)

- ec341Uploaded bynagendra90
- Adc SyllabusUploaded byM.S.Anandhi
- ST7540 Power Line Modem DemokitUploaded byapi-3697475
- ubiccjournalvolume2no3_Letter1_94Uploaded byUsman Tariq
- Electronic Communication & Data CommunicationUploaded byGuruKPO
- Individual Assignment DCSUploaded byPrem Pandey
- Inatel14-MSKUploaded byDayan Adionel Guimarães
- InfThe-L1Uploaded byEngr Pius Odaba
- ModulationUploaded bysushil4056
- Modulazioni Rel 77Uploaded byAnggoro Adi Sucipto
- Welcome to International Journal of Engineering Research and Development (IJERD)Uploaded byIJERD
- IJETAE_0212_08122Uploaded byShankar Ganesh
- Introduction to Spread Spectrum CommunicationsUploaded bySriram
- Myth and realitiesUploaded bysriblue7
- Analysis and Simulation of Uhf Rfid SystemUploaded byDuc Duc
- ModulationUploaded byDikshit Tomer
- ch06-part 4Uploaded byIndira Karimova
- Datasheet_MLX90121Uploaded byorlandomask
- modulationUploaded byGeorges M. Karam
- ADAPTIVE MODULATION AND CODING.pptxUploaded byAnamika Yadav
- Introduction to digital communicationUploaded bylokeshwarrvrjc
- Runcom OFDMA Tutorial.pdfUploaded byPankaj Kumar Rai
- Orthogonal FrequencyUploaded byPalak Dave
- Unit 4 newUploaded byVishal Iyer
- Digicomms Take Home Exam-1Uploaded byPaula Jane
- dt analUploaded byبطاهر محمد
- Seeber-BlindSignalAnalysisUploaded bykidus
- 2009-08-20-wimaxUploaded byAaissa Aaiss
- DCLABUploaded byshockwave
- CHAPTER 9 ReviewerUploaded byAdrien raye Alcoriza

- The unix programming environmentUploaded byGrayShadow
- Red Hat Training Certification Sales PresentationUploaded byMohamed Hussien Hamed
- GPRS - Quick GuideUploaded byMohamed Hussien Hamed
- Seat_LeonUploaded byMohamed Hussien Hamed
- lte-protocol-signaling.pdfUploaded bysud_mishra
- RSA 768 Bit Crypto CrackedUploaded byHTD
- Competitive Comparison-Application ServersUploaded byMohamed Hussien Hamed
- Rectenna White PaperUploaded byMohamed Hussien Hamed
- Modified Truncated Patch Antenna for S-Band Wireless Power Transmission RectennaUploaded byMohamed Hussien Hamed
- Wireless Power TransmissionUploaded byMohamed Hussien Hamed
- Design and implementation of a rectenna for satelliteUploaded byMohamed Hussien Hamed
- Printed Folded Dipole Antenna Design for RectennaUploaded byMohamed Hussien Hamed
- Trellis for UMTSUploaded byemanfat
- 2.0-Intro to FirewallsUploaded byMohamed Hussien Hamed
- 1.0-SEC-1N20Uploaded byMohamed Hussien Hamed
- wireless power transmissionUploaded bybudigondaraju
- MWSYM.1997.602852Uploaded byMohamed Hussien Hamed
- A review of rectenna models for electromagnetic energy harvesting.pdfUploaded byMohamed Hussien Hamed
- UWB CIRCULAR SLOT ANTENNA PROVIDED WITH AN INVERTED-L NOTCH FILTER FOR THE 5GHz WLAN BANDUploaded byMohamed Hussien Hamed
- UnixUploaded byAbhishek Siroya
- UWB AntennaUploaded byAshok Ramavath
- 1632100Uploaded byChristopher Praveen Kumar
- Errata 2nd EditionUploaded byMohamed Hussien Hamed
- 3gpp Lte MacUploaded byarghadas
- LTE_Sim_DocUploaded byMohamed Hussien Hamed
- The Vienna LTE SimulatorsUploaded byMohamed Hussien Hamed
- Rohde_and_Schwarz_LTE_tutorialUploaded byAlan Will
- DESIGN & IMPLEMENTATION OF RECONFIGURABLE FRONT END FOR MIMO-OFDMUploaded byMohamed Hussien Hamed
- Computer NetworksUploaded byMohamed Hussien Hamed

- dpUploaded byhmthant
- Artificial Intelligence for Game DesignUploaded byq2tpro
- Week 5, Security and AuthenticationUploaded byCyn Syjuco
- Introduction to Machine LearningUploaded bysongcohieu
- Efficiency of Entropy Coding as well as Dictionary based Technique for Lossless Data CompressionUploaded byijrdt
- List of Journals - April 2017Uploaded byJorge Salas
- -Control theory pdf-Uploaded byapi-3755845
- queu Solution7Uploaded byLukman Iskanderia
- ID 26Uploaded byZellagui Energy
- Uncertainty Budget TemplateUploaded bydonkalonk
- 1. Linear Programming, First Examples (1)Uploaded byHassan Nathani
- Cluster Rank AlgorithmUploaded by2009uit110
- SOA+Manual+Survival+Models.pdfUploaded byAlexis Krauss
- Chapter 5 Numerical IntegrationUploaded bymuhd munzir
- apresentacao_CIDMA_2010Uploaded byimmsilvam
- Control Tutorials for MATLAB and Simulink - Introduction_ Simulink ControlUploaded bygravity_eng
- 05 - Second Order System and Higher OrderUploaded byStella
- Modern Symmetric Key CipherUploaded byprabardash
- Turbo Coding for Satellite and Wireless CommunicationsUploaded byCảnh Hưng
- 16 Newton Cotes QuadratureUploaded byRay Tan
- Part2_1.9.14-2Uploaded byian
- Arabic keyphrase ExtractionUploaded byMohab El-Shishtawy
- Efficient Spam Classification by Appropriate Feature SelectionUploaded byRamdas Mandare
- TORA output.TxtUploaded byPratyushSharma
- CNN Vision ApplicationsUploaded byali
- Performance Analysis of Different Classification Methods in Data Mining for Diabetes Dataset Using WEKA ToolUploaded byEditor IJRITCC
- An Analytic Solution for Finding the Natural Frequency of a Nonlinear Oscillating SystemUploaded bySanda Pyae Sone
- 07A70501-DIGITALIMAGEPROCESSINGUploaded by9010469071
- cryptography-intro-1208982511694551-8.pptUploaded bydeepa367ymailcom
- Lecture2.pdfUploaded byParul Trivedi