Constellation Shaping for Communication Channels with Quantized Outputs
|
|
- Antonia Brooks
- 6 years ago
- Views:
Transcription
1 Constellation Shaping for Communication Channels with Quantized Outputs, Dr. Matthew C. Valenti and Xingyu Xiang Lane Department of Computer Science and Electrical Engineering West Virginia University CISS - March 24, 2 Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and Electrical - March 24, Engineering 2 West / 3 Virg
2 Outline Introduction 2 Constellation Shaping 3 Quantization 4 Discrete Memoryless Channel 5 Optimization Results 6 Implementation 7 Conclusion Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and Electrical - March 24, Engineering 2 West 2 / 3 Virg
3 Outline Introduction Introduction 2 Constellation Shaping 3 Quantization 4 Discrete Memoryless Channel 5 Optimization Results 6 Implementation 7 Conclusion Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and Electrical - March 24, Engineering 2 West 3 / 3 Virg
4 Introduction Transmitter Side Optimization Receiver Side Optimization Constellation Shaping - Stephane Y. Le Goff 27 IEEE, T. Wireless Quantizer Optimization - Jaspreet Singh 28 ISIT Our Contribution - Joint optimization CISS 2 Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and Electrical - March 24, Engineering 2 West 4 / 3 Virg
5 Introduction Mutual Information( MI ) and Channel Capacity MI between two random variables, X and Y is given by, [ ( )] p(y X) I(X; Y ) = E log p(y ) Channel Capacity is the highest rate at which information can be transmitted over the channel with low error probability. Given the channel and the receiver, capacity is defined as C = max p(x) I(X; Y ) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and Electrical - March 24, Engineering 2 West 5 / 3 Virg
6 Introduction The mutual information between output Y and input X is M p(y x j ) I(X; Y ) = p(x j ) p(y x j ) log 2 p(y) dy. j= M - number of input symbols. This can be solved using Gauss - Hermite Quadratures Information rate results of 6 PAM under continuous output and uniform constellation INFORMATION RATE SNR(dB) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and Electrical - March 24, Engineering 2 West 6 / 3 Virg
7 Outline Constellation Shaping Introduction 2 Constellation Shaping 3 Quantization 4 Discrete Memoryless Channel 5 Optimization Results 6 Implementation 7 Conclusion Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and Electrical - March 24, Engineering 2 West 7 / 3 Virg
8 Constellation Shaping Constellation Shaping for PAM Our strategy is from S. LeGoff, IEEE T. Wireless, 27. Transmit low-energy symbols more frequently than high-energy symbols. Shaping encoder helps in achieving the desired symbol distribution. For a fixed average energy, shaping spreads out the symbols with uniform spacing maintained. High Energy Low Energy High Energy.5 High Energy Symbols Low Energy Symbols High Energy Symbols (a) Probability of picking low-energy subconstellation =.5 (b) Probability of picking low-energy subconstellation =.9 ( E s = Σ M i= p(x i)e i = ) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and Electrical - March 24, Engineering 2 West 8 / 3 Virg
9 Shaping Encoder Constellation Shaping We design the shaping encoder to output more zeros than ones. One example is, Table: (5,3) shaping code. 3 input bits 5 output bits If p, p represents the probability of the shaping encoder giving out a zero and one respectively, then from the table, p = 3 4 and p = 9 4 Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and Electrical - March 24, Engineering 2 West 9 / 3 Virg
10 Constellation Shaping 6-PAM Constellation and its symbol-labeling map Each symbol is selected with probability Each symbol is selected with probability p 8 p 8 Shaping Operation Channel Encoder Splitter thrd 3 bit st nd 2 bit bit E N C rd 3 bit C O D E W O R D S Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 West / 3 Virg
11 Constellation Shaping 6-PAM results with continuous output optimized over p INFORMATION RATE db.5 shaping uniform SNR(dB) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 West / 3 Virg
12 Outline Quantization Introduction 2 Constellation Shaping 3 Quantization 4 Discrete Memoryless Channel 5 Optimization Results 6 Implementation 7 Conclusion Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 2 West / 3 Virg
13 Quantization Basics Quantization The output of most communications channels must be quantized prior to processing. Quantizer approximates its input to one of the predefined levels. results in loss of precision. The idea of improving information rate by optimizing the quantizer is from the ISIT 28 paper by Jaspreet Singh. Quantizer Spacing y Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 3 West / 3 Virg
14 Quantization Importance of Quantizer Spacing INFORMATION RATE QUANTIZER SPACING (c) Information Variation with quantizer spacing at SNR = db, uniformly-distributed inputs and 6 quantization levels INFORMATION RATE optimum quantizer non-optimum quantizer SNR(dB) (d) Variation of information rate with SNR under quantizer spacing =., 6 quantization levels and uniformlydistributed inputs Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 4 West / 3 Virg
15 Outline Discrete Memoryless Channel Introduction 2 Constellation Shaping 3 Quantization 4 Discrete Memoryless Channel 5 Optimization Results 6 Implementation 7 Conclusion Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 5 West / 3 Virg
16 Discrete Memoryless Channel Discrete Memoryless Channel AWGN channel with discrete inputs and outputs can be modelled by a DMC. Channel described by transition or crossover probabilities. y x y x y 2 x 2 y 3 p(y i x j ) = x M bi+ b i 2πσ exp y N ( (y xj ) 2 2σ 2 ) dy where b i, b i+ are the boundaries of the quantization region associated with level y i. Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 6 West / 3 Virg
17 Discrete Memoryless Channel Information Rate Evaluation For the DMC and one-dimensional modulation, where, I(X; Y ) = M j= N i= ( ) p(yi x j ) p(x j )p(y i x j ) log 2 p(y i ) p(y i ) is the probability of observing output y i. For finding p(y i ), we use, p(y i ) = M j= p(y i x j )p(x j ) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 7 West / 3 Virg
18 Outline Optimization Results Introduction 2 Constellation Shaping 3 Quantization 4 Discrete Memoryless Channel 5 Optimization Results 6 Implementation 7 Conclusion Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 8 West / 3 Virg
19 Optimization Results Joint Optimization( Our Contribution ) The variation of information rate with quantizer spacing follows a pattern. We have two values to optimize over, δ and p, given the SNR and number of quantization bits(l = log 2 (N)). The algorithm used is, Fix the SNR and number of quantization bits(l). 2 Vary p from.5 to.99 in increments of.5. 3 For each value of p, find the optimum quantizer spacing and compute the corresponding information rate. 4 By the end of step 3, we have an array of information rate values. We then go over the array and find the highest information rate that can be achieved, and the combination of p and δ that will produce it. Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 9 West / 3 Virg
20 Capacity Results Optimization Results INFORMATION RATE Cont l=8 l=7 l=6 l=5 l=4 INFORMATION RATE Cont l=8 l=7 l=6 l=5 l= SNR(dB) (e) Uniform Distribution SNR(dB) (f) Shaped Distribution Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 2 West / 3 Virg
21 Optimization Results Shaping Gain and its evaluation.8 4 SHAPING GAIN(dB) Cont l=8 l=7 l=6 l=5 l=4 INFORMATION RATE shaped l=7 uniform l=7 shaped l=4 uniform l= INFORMATION RATE SNR(dB) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 2 West / 3 Virg
22 Optimization Results Quantization Loss and its evaluation QUANTIZATION LOSS(dB).5.5 l=4 l=5 l=6 l=7 l=8 INFORMATION RATE shaped cont shaped l=5 shaped l= INFORMATION RATE SNR(dB) (i) Shaped Distribution Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 22 West / 3 Virg
23 Quantization Loss Optimization Results.5 QUANTIZATION LOSS(dB).5 l=4 l=5 l=6 l=7 l= INFORMATION RATE Figure: Uniform Distribution Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 23 West / 3 Virg
24 Optimization Results Optimization Results.8.9 QUANTIZER SPACING l=4 l=5 l=6 l=7 l=8 OPTIMUM P Cont l=8 l=7 l=6 l=5 l= SNR(dB) (a) Optimal Quantizer Spacing SNR(dB) (b) Optimal p (probability of selecting lower-energy subconstellation) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 24 West / 3 Virg
25 Outline Implementation Introduction 2 Constellation Shaping 3 Quantization 4 Discrete Memoryless Channel 5 Optimization Results 6 Implementation 7 Conclusion Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 25 West / 3 Virg
26 Implementation Implementation BICM - ID System Information sequence Turbo Encoder Bit Separator Shaping Encoder Modulator Estimated bit probabilities Turbo Decoder Shaping Decoder Bit Separator Demodulator Channel - Feedback Information Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 26 West / 3 Virg
27 BER Curves Implementation Table: Parameters used for simulation of a 6PAM system. R r c r s Quantizer Spacing l = 8 l = 7 l = 6 l = 5 l = 4 Uniform / Shaping /2479 7/ BER - -2 uniform l=4 shaped l=4 uniform l=5 shaped l=5 uniform l=6 shaped l=6 BER - -2 uniform l=7 uniform cont uniform l=8 shaped l=7 shaped cont shaped l= Eb/No(dB) Eb/No(dB) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 27 West / 3 Virg
28 Implementation Theoretical Actual Table: SNR required by 6PAM at rate R = 3. E b /N in db Cont l = 8 l = 7 l = 6 l = 5 l = 4 Uniform Shaping Uniform Shaping The E b /N values in actual case are taken at BER = 5 Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 28 West / 3 Virg
29 Outline Conclusion Introduction 2 Constellation Shaping 3 Quantization 4 Discrete Memoryless Channel 5 Optimization Results 6 Implementation 7 Conclusion Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 29 West / 3 Virg
30 Conclusion Conclusion The simple constellation-shaping strategy considered in this paper can achieve shaping gains of over.7 db. When a finite-resolution quantizer is used, there will necessarily be a quantization loss. The loss can be minimized by using an optimal quantizer spacing. When properly optimized, a resolution of 8 bits is sufficient to provide performance that is very close to that of an unquantized system. This work can be further extended to a more-complex two-dimensional modulations like 6-APSK and to higher-dimensional modulations. Using a non-uniform vector quantizer can also be investigated for such systems. Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 3 West / 3 Virg
31 Conclusion Questions Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 3 West / 3 Virg
Constellation Shaping for Communication Channels with Quantized Outputs
Constellation Shaping for Communication Channels with Quantized Outputs Chandana Nannapaneni, Matthew C. Valenti, and Xingyu Xiang Lane Department of Computer Science and Electrical Engineering West Virginia
More informationMODULATION AND CODING FOR QUANTIZED CHANNELS. Xiaoying Shao and Harm S. Cronie
MODULATION AND CODING FOR QUANTIZED CHANNELS Xiaoying Shao and Harm S. Cronie x.shao@ewi.utwente.nl, h.s.cronie@ewi.utwente.nl University of Twente, Faculty of EEMCS, Signals and Systems Group P.O. box
More informationOne Lesson of Information Theory
Institut für One Lesson of Information Theory Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/
More informationExercise 1. = P(y a 1)P(a 1 )
Chapter 7 Channel Capacity Exercise 1 A source produces independent, equally probable symbols from an alphabet {a 1, a 2 } at a rate of one symbol every 3 seconds. These symbols are transmitted over a
More informationOn the Limits of Communication with Low-Precision Analog-to-Digital Conversion at the Receiver
1 On the Limits of Communication with Low-Precision Analog-to-Digital Conversion at the Receiver Jaspreet Singh, Onkar Dabeer, and Upamanyu Madhow, Abstract As communication systems scale up in speed and
More informationECE Information theory Final
ECE 776 - Information theory Final Q1 (1 point) We would like to compress a Gaussian source with zero mean and variance 1 We consider two strategies In the first, we quantize with a step size so that the
More informationThe PPM Poisson Channel: Finite-Length Bounds and Code Design
August 21, 2014 The PPM Poisson Channel: Finite-Length Bounds and Code Design Flavio Zabini DEI - University of Bologna and Institute for Communications and Navigation German Aerospace Center (DLR) Balazs
More informationChapter 7: Channel coding:convolutional codes
Chapter 7: : Convolutional codes University of Limoges meghdadi@ensil.unilim.fr Reference : Digital communications by John Proakis; Wireless communication by Andreas Goldsmith Encoder representation Communication
More informationLecture 2. Capacity of the Gaussian channel
Spring, 207 5237S, Wireless Communications II 2. Lecture 2 Capacity of the Gaussian channel Review on basic concepts in inf. theory ( Cover&Thomas: Elements of Inf. Theory, Tse&Viswanath: Appendix B) AWGN
More informationCapacity of the Discrete-Time AWGN Channel Under Output Quantization
Capacity of the Discrete-Time AWGN Channel Under Output Quantization Jaspreet Singh, Onkar Dabeer and Upamanyu Madhow Abstract We investigate the limits of communication over the discrete-time Additive
More informationChannel capacity. Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5.
Channel capacity Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5. Exercices Exercise session 11 : Channel capacity 1 1. Source entropy Given X a memoryless
More informationCHANNEL CAPACITY CALCULATIONS FOR M ARY N DIMENSIONAL SIGNAL SETS
THE UNIVERSITY OF SOUTH AUSTRALIA SCHOOL OF ELECTRONIC ENGINEERING CHANNEL CAPACITY CALCULATIONS FOR M ARY N DIMENSIONAL SIGNAL SETS Philip Edward McIllree, B.Eng. A thesis submitted in fulfilment of the
More informationNotes on a posteriori probability (APP) metrics for LDPC
Notes on a posteriori probability (APP) metrics for LDPC IEEE 802.3an Task Force November, 2004 Raju Hormis, Xiaodong Wang Columbia University, NY e-mail: raju@ee.columbia.edu Outline Section 55.3.11.3
More informationOne-Bit LDPC Message Passing Decoding Based on Maximization of Mutual Information
One-Bit LDPC Message Passing Decoding Based on Maximization of Mutual Information ZOU Sheng and Brian M. Kurkoski kurkoski@ice.uec.ac.jp University of Electro-Communications Tokyo, Japan University of
More informationBandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation
Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation Georg Böcherer, Patrick Schulte, Fabian Steiner Chair for Communications Engineering patrick.schulte@tum.de April 29, 2015
More informationJoint FEC Encoder and Linear Precoder Design for MIMO Systems with Antenna Correlation
Joint FEC Encoder and Linear Precoder Design for MIMO Systems with Antenna Correlation Chongbin Xu, Peng Wang, Zhonghao Zhang, and Li Ping City University of Hong Kong 1 Outline Background Mutual Information
More informationMessage-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras
Message-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras e-mail: hari_jethanandani@yahoo.com Abstract Low-density parity-check (LDPC) codes are discussed
More informationMulticarrier transmission DMT/OFDM
W. Henkel, International University Bremen 1 Multicarrier transmission DMT/OFDM DMT: Discrete Multitone (wireline, baseband) OFDM: Orthogonal Frequency Division Multiplex (wireless, with carrier, passband)
More informationNotes 3: Stochastic channels and noisy coding theorem bound. 1 Model of information communication and noisy channel
Introduction to Coding Theory CMU: Spring 2010 Notes 3: Stochastic channels and noisy coding theorem bound January 2010 Lecturer: Venkatesan Guruswami Scribe: Venkatesan Guruswami We now turn to the basic
More informationRCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths
RCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths Kasra Vakilinia, Dariush Divsalar*, and Richard D. Wesel Department of Electrical Engineering, University
More informationELEC546 Review of Information Theory
ELEC546 Review of Information Theory Vincent Lau 1/1/004 1 Review of Information Theory Entropy: Measure of uncertainty of a random variable X. The entropy of X, H(X), is given by: If X is a discrete random
More informationPrinciples of Communications
Principles of Communications Weiyao Lin Shanghai Jiao Tong University Chapter 10: Information Theory Textbook: Chapter 12 Communication Systems Engineering: Ch 6.1, Ch 9.1~ 9. 92 2009/2010 Meixia Tao @
More informationLower Bounds on the Graphical Complexity of Finite-Length LDPC Codes
Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes Igal Sason Department of Electrical Engineering Technion - Israel Institute of Technology Haifa 32000, Israel 2009 IEEE International
More informationShannon Information Theory
Chapter 3 Shannon Information Theory The information theory established by Shannon in 948 is the foundation discipline for communication systems, showing the potentialities and fundamental bounds of coding.
More informationAppendix B Information theory from first principles
Appendix B Information theory from first principles This appendix discusses the information theory behind the capacity expressions used in the book. Section 8.3.4 is the only part of the book that supposes
More informationCapacity of a channel Shannon s second theorem. Information Theory 1/33
Capacity of a channel Shannon s second theorem Information Theory 1/33 Outline 1. Memoryless channels, examples ; 2. Capacity ; 3. Symmetric channels ; 4. Channel Coding ; 5. Shannon s second theorem,
More informationC.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University
Quantization C.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University http://www.csie.nctu.edu.tw/~cmliu/courses/compression/ Office: EC538 (03)5731877 cmliu@cs.nctu.edu.tw
More informationCompound Polar Codes
Compound Polar Codes Hessam Mahdavifar, Mostafa El-Khamy, Jungwon Lee, Inyup Kang Mobile Solutions Lab, Samsung Information Systems America 4921 Directors Place, San Diego, CA 92121 {h.mahdavifar, mostafa.e,
More informationBlind phase/frequency synchronization with low-precision ADC: a Bayesian approach
Blind phase/frequency synchronization with low-precision ADC: a Bayesian approach Aseem Wadhwa, Upamanyu Madhow Department of ECE, UCSB 1/26 Modern Communication Receiver Architecture Analog Digital TX
More informationECE Information theory Final (Fall 2008)
ECE 776 - Information theory Final (Fall 2008) Q.1. (1 point) Consider the following bursty transmission scheme for a Gaussian channel with noise power N and average power constraint P (i.e., 1/n X n i=1
More informationJOINT ITERATIVE DETECTION AND DECODING IN THE PRESENCE OF PHASE NOISE AND FREQUENCY OFFSET
JOINT ITERATIVE DETECTION AND DECODING IN THE PRESENCE OF PHASE NOISE AND FREQUENCY OFFSET Alan Barbieri, Giulio Colavolpe and Giuseppe Caire Università di Parma Institut Eurecom Dipartimento di Ingegneria
More informationSpace-Time Coding for Multi-Antenna Systems
Space-Time Coding for Multi-Antenna Systems ECE 559VV Class Project Sreekanth Annapureddy vannapu2@uiuc.edu Dec 3rd 2007 MIMO: Diversity vs Multiplexing Multiplexing Diversity Pictures taken from lectures
More informationDigital Modulation 1
Digital Modulation 1 Lecture Notes Ingmar Land and Bernard H. Fleury Navigation and Communications () Department of Electronic Systems Aalborg University, DK Version: February 5, 27 i Contents I Basic
More informationCOMBINING DECODED-AND-FORWARDED SIGNALS IN GAUSSIAN COOPERATIVE CHANNELS
COMBINING DECODED-AND-FORWARDED SIGNALS IN GAUSSIAN COOPERATIVE CHANNELS Brice Djeumou, Samson Lasaulce, Andrew Klein To cite this version: Brice Djeumou, Samson Lasaulce, Andrew Klein. COMBINING DECODED-AND-FORWARDED
More informationCapacity of the Discrete Memoryless Energy Harvesting Channel with Side Information
204 IEEE International Symposium on Information Theory Capacity of the Discrete Memoryless Energy Harvesting Channel with Side Information Omur Ozel, Kaya Tutuncuoglu 2, Sennur Ulukus, and Aylin Yener
More informationChapter 9 Fundamental Limits in Information Theory
Chapter 9 Fundamental Limits in Information Theory Information Theory is the fundamental theory behind information manipulation, including data compression and data transmission. 9.1 Introduction o For
More informationQAM Constellations for BICM-ID
Efficient Multi-Dimensional Mapping Using 1 QAM Constellations for BICM-ID Hassan M. Navazi and Md. Jahangir Hossain, Member, IEEE arxiv:1701.01167v1 [cs.it] 30 Dec 2016 The University of British Columbia,
More informationShannon s noisy-channel theorem
Shannon s noisy-channel theorem Information theory Amon Elders Korteweg de Vries Institute for Mathematics University of Amsterdam. Tuesday, 26th of Januari Amon Elders (Korteweg de Vries Institute for
More informationDigital communication system. Shannon s separation principle
Digital communication system Representation of the source signal by a stream of (binary) symbols Adaptation to the properties of the transmission channel information source source coder channel coder modulation
More informationTightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes and Applications
on the ML Decoding Error Probability of Binary Linear Block Codes and Department of Electrical Engineering Technion-Israel Institute of Technology An M.Sc. Thesis supervisor: Dr. Igal Sason March 30, 2006
More informationNetwork coding for multicast relation to compression and generalization of Slepian-Wolf
Network coding for multicast relation to compression and generalization of Slepian-Wolf 1 Overview Review of Slepian-Wolf Distributed network compression Error exponents Source-channel separation issues
More informationChannel Dependent Adaptive Modulation and Coding Without Channel State Information at the Transmitter
Channel Dependent Adaptive Modulation and Coding Without Channel State Information at the Transmitter Bradford D. Boyle, John MacLaren Walsh, and Steven Weber Modeling & Analysis of Networks Laboratory
More informationChapter 4: Continuous channel and its capacity
meghdadi@ensil.unilim.fr Reference : Elements of Information Theory by Cover and Thomas Continuous random variable Gaussian multivariate random variable AWGN Band limited channel Parallel channels Flat
More informationGraph-based Codes for Quantize-Map-and-Forward Relaying
20 IEEE Information Theory Workshop Graph-based Codes for Quantize-Map-and-Forward Relaying Ayan Sengupta, Siddhartha Brahma, Ayfer Özgür, Christina Fragouli and Suhas Diggavi EPFL, Switzerland, UCLA,
More informationEntropy, Inference, and Channel Coding
Entropy, Inference, and Channel Coding Sean Meyn Department of Electrical and Computer Engineering University of Illinois and the Coordinated Science Laboratory NSF support: ECS 02-17836, ITR 00-85929
More informationRapport technique #INRS-EMT Exact Expression for the BER of Rectangular QAM with Arbitrary Constellation Mapping
Rapport technique #INRS-EMT-010-0604 Exact Expression for the BER of Rectangular QAM with Arbitrary Constellation Mapping Leszek Szczeciński, Cristian González, Sonia Aïssa Institut National de la Recherche
More informationSOFT DECISION FANO DECODING OF BLOCK CODES OVER DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM
Journal of ELECTRICAL ENGINEERING, VOL. 63, NO. 1, 2012, 59 64 SOFT DECISION FANO DECODING OF BLOCK CODES OVER DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM H. Prashantha Kumar Udupi Sripati K. Rajesh
More informationLecture 5: Channel Capacity. Copyright G. Caire (Sample Lectures) 122
Lecture 5: Channel Capacity Copyright G. Caire (Sample Lectures) 122 M Definitions and Problem Setup 2 X n Y n Encoder p(y x) Decoder ˆM Message Channel Estimate Definition 11. Discrete Memoryless Channel
More informationRevision of Lecture 5
Revision of Lecture 5 Information transferring across channels Channel characteristics and binary symmetric channel Average mutual information Average mutual information tells us what happens to information
More informationSoft-Decision Demodulation Design for COVQ over White, Colored, and ISI Gaussian Channels
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL 48, NO 9, SEPTEMBER 2000 1499 Soft-Decision Demodulation Design for COVQ over White, Colored, and ISI Gaussian Channels Nam Phamdo, Senior Member, IEEE, and Fady
More informationThe Poisson Channel with Side Information
The Poisson Channel with Side Information Shraga Bross School of Enginerring Bar-Ilan University, Israel brosss@macs.biu.ac.il Amos Lapidoth Ligong Wang Signal and Information Processing Laboratory ETH
More informationOptimal Power Allocation for Distributed BLUE Estimation with Linear Spatial Collaboration
Optimal Power Allocation for Distributed BLUE Estimation with Linear Spatial Collaboration Mohammad Fanaei, Matthew C. Valenti Abbas Jamalipour, and Natalia A. Schmid Dept. of Computer Science and Electrical
More informationOn Dependence Balance Bounds for Two Way Channels
On Dependence Balance Bounds for Two Way Channels Ravi Tandon Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 20742 ravit@umd.edu ulukus@umd.edu
More informationMaximum Likelihood Decoding of Codes on the Asymmetric Z-channel
Maximum Likelihood Decoding of Codes on the Asymmetric Z-channel Pål Ellingsen paale@ii.uib.no Susanna Spinsante s.spinsante@univpm.it Angela Barbero angbar@wmatem.eis.uva.es May 31, 2005 Øyvind Ytrehus
More informationOptimization of Modulation Constrained Digital Transmission Systems
University of Ottawa Optimization of Modulation Constrained Digital Transmission Systems by Yu Han A thesis submitted in fulfillment for the degree of Master of Applied Science in the Faculty of Engineering
More informationOn the Capacity of the Two-Hop Half-Duplex Relay Channel
On the Capacity of the Two-Hop Half-Duplex Relay Channel Nikola Zlatanov, Vahid Jamali, and Robert Schober University of British Columbia, Vancouver, Canada, and Friedrich-Alexander-University Erlangen-Nürnberg,
More informationComputation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems
Computation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems Department of Electrical Engineering, College of Engineering, Basrah University Basrah Iraq,
More informationNAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR. Sp ' 00
NAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR Sp ' 00 May 3 OPEN BOOK exam (students are permitted to bring in textbooks, handwritten notes, lecture notes
More informationTightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes and Applications
on the ML Decoding Error Probability of Binary Linear Block Codes and Moshe Twitto Department of Electrical Engineering Technion-Israel Institute of Technology Haifa 32000, Israel Joint work with Igal
More informationLattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm
Lattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm HongSun An Student Member IEEE he Graduate School of I & Incheon Korea ahs3179@gmail.com Manar Mohaisen Student Member IEEE
More informationNoisy channel communication
Information Theory http://www.inf.ed.ac.uk/teaching/courses/it/ Week 6 Communication channels and Information Some notes on the noisy channel setup: Iain Murray, 2012 School of Informatics, University
More informationBit-Interleaved Coded Modulation With Mismatched Decoding Metrics
Bit-Interleaved Coded Modulation With Mismatched Decoding Metrics 1 Trung Thanh Nguyen and Lutz Lampe Department of Electrical and Computer Engineering The University of British Columbia, Vancouver, Canada
More informationOptimum Soft Decision Decoding of Linear Block Codes
Optimum Soft Decision Decoding of Linear Block Codes {m i } Channel encoder C=(C n-1,,c 0 ) BPSK S(t) (n,k,d) linear modulator block code Optimal receiver AWGN Assume that [n,k,d] linear block code C is
More informationOn the Joint Decoding of LDPC Codes and Finite-State Channels via Linear Programming
On the Joint Decoding of LDPC Codes and Finite-State Channels via Linear Programming Byung-Hak Kim (joint with Henry D. Pfister) Texas A&M University College Station International Symposium on Information
More informationThe Method of Types and Its Application to Information Hiding
The Method of Types and Its Application to Information Hiding Pierre Moulin University of Illinois at Urbana-Champaign www.ifp.uiuc.edu/ moulin/talks/eusipco05-slides.pdf EUSIPCO Antalya, September 7,
More informationRevision of Lecture 4
Revision of Lecture 4 We have completed studying digital sources from information theory viewpoint We have learnt all fundamental principles for source coding, provided by information theory Practical
More informationCut-Set Bound and Dependence Balance Bound
Cut-Set Bound and Dependence Balance Bound Lei Xiao lxiao@nd.edu 1 Date: 4 October, 2006 Reading: Elements of information theory by Cover and Thomas [1, Section 14.10], and the paper by Hekstra and Willems
More informationCoding Techniques for Data Storage Systems
Coding Techniques for Data Storage Systems Thomas Mittelholzer IBM Zurich Research Laboratory /8 Göttingen Agenda. Channel Coding and Practical Coding Constraints. Linear Codes 3. Weight Enumerators and
More informationEE4512 Analog and Digital Communications Chapter 4. Chapter 4 Receiver Design
Chapter 4 Receiver Design Chapter 4 Receiver Design Probability of Bit Error Pages 124-149 149 Probability of Bit Error The low pass filtered and sampled PAM signal results in an expression for the probability
More informationEfficient LLR Calculation for Non-Binary Modulations over Fading Channels
Efficient LLR Calculation for Non-Binary Modulations over Fading Channels Raman Yazdani, Student Member, IEEE, and arxiv:12.2164v1 [cs.it] 1 Feb 21 Masoud Ardaani, Senior Member, IEEE Department of Electrical
More informationOptimized Symbol Mappings for Bit-Interleaved Coded Modulation with Iterative Decoding
Optimized Symbol Mappings for Bit-nterleaved Coded Modulation with terative Decoding F. Schreckenbach, N. Görtz, J. Hagenauer nstitute for Communications Engineering (LNT) Munich University of Technology
More informationError Floors of LDPC Coded BICM
Electrical and Computer Engineering Conference Papers, Posters and Presentations Electrical and Computer Engineering 2007 Error Floors of LDPC Coded BICM Aditya Ramamoorthy Iowa State University, adityar@iastate.edu
More informationSoft-Output Trellis Waveform Coding
Soft-Output Trellis Waveform Coding Tariq Haddad and Abbas Yongaçoḡlu School of Information Technology and Engineering, University of Ottawa Ottawa, Ontario, K1N 6N5, Canada Fax: +1 (613) 562 5175 thaddad@site.uottawa.ca
More informationAALTO UNIVERSITY School of Electrical Engineering. Sergio Damian Lembo MODELING BLER PERFORMANCE OF PUNCTURED TURBO CODES
AALTO UNIVERSITY School of Electrical Engineering Sergio Damian Lembo MODELING BLER PERFORMANCE OF PUNCTURED TURBO CODES Thesis submitted for examination for the degree of Master of Science in Technology
More informationTurbo Compression. Andrej Rikovsky, Advisor: Pavol Hanus
Turbo Compression Andrej Rikovsky, Advisor: Pavol Hanus Abstract Turbo codes which performs very close to channel capacity in channel coding can be also used to obtain very efficient source coding schemes.
More informationOPTIMUM fixed-rate scalar quantizers, introduced by Max
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL 54, NO 2, MARCH 2005 495 Quantizer Design for Channel Codes With Soft-Output Decoding Jan Bakus and Amir K Khandani, Member, IEEE Abstract A new method of
More informationVariable Length Codes for Degraded Broadcast Channels
Variable Length Codes for Degraded Broadcast Channels Stéphane Musy School of Computer and Communication Sciences, EPFL CH-1015 Lausanne, Switzerland Email: stephane.musy@ep.ch Abstract This paper investigates
More informationII. THE TWO-WAY TWO-RELAY CHANNEL
An Achievable Rate Region for the Two-Way Two-Relay Channel Jonathan Ponniah Liang-Liang Xie Department of Electrical Computer Engineering, University of Waterloo, Canada Abstract We propose an achievable
More informationLecture 8: Channel Capacity, Continuous Random Variables
EE376A/STATS376A Information Theory Lecture 8-02/0/208 Lecture 8: Channel Capacity, Continuous Random Variables Lecturer: Tsachy Weissman Scribe: Augustine Chemparathy, Adithya Ganesh, Philip Hwang Channel
More informationAnalytical Bounds on Maximum-Likelihood Decoded Linear Codes: An Overview
Analytical Bounds on Maximum-Likelihood Decoded Linear Codes: An Overview Igal Sason Department of Electrical Engineering, Technion Haifa 32000, Israel Sason@ee.technion.ac.il December 21, 2004 Background
More informationConvolutional Codes. Telecommunications Laboratory. Alex Balatsoukas-Stimming. Technical University of Crete. November 6th, 2008
Convolutional Codes Telecommunications Laboratory Alex Balatsoukas-Stimming Technical University of Crete November 6th, 2008 Telecommunications Laboratory (TUC) Convolutional Codes November 6th, 2008 1
More informationX 1 : X Table 1: Y = X X 2
ECE 534: Elements of Information Theory, Fall 200 Homework 3 Solutions (ALL DUE to Kenneth S. Palacio Baus) December, 200. Problem 5.20. Multiple access (a) Find the capacity region for the multiple-access
More informationIntroduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.
Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information
More informationLecture 6 I. CHANNEL CODING. X n (m) P Y X
6- Introduction to Information Theory Lecture 6 Lecturer: Haim Permuter Scribe: Yoav Eisenberg and Yakov Miron I. CHANNEL CODING We consider the following channel coding problem: m = {,2,..,2 nr} Encoder
More informationEE 5345 Biomedical Instrumentation Lecture 12: slides
EE 5345 Biomedical Instrumentation Lecture 1: slides 4-6 Carlos E. Davila, Electrical Engineering Dept. Southern Methodist University slides can be viewed at: http:// www.seas.smu.edu/~cd/ee5345.html EE
More informationExpectation propagation for symbol detection in large-scale MIMO communications
Expectation propagation for symbol detection in large-scale MIMO communications Pablo M. Olmos olmos@tsc.uc3m.es Joint work with Javier Céspedes (UC3M) Matilde Sánchez-Fernández (UC3M) and Fernando Pérez-Cruz
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationState-of-the-Art Channel Coding
Institut für State-of-the-Art Channel Coding Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/
More informationOn the Use of Division Algebras for Wireless Communication
On the Use of Division Algebras for Wireless Communication frederique@systems.caltech.edu California Institute of Technology AMS meeting, Davidson, March 3rd 2007 Outline A few wireless coding problems
More informationLecture 5 Channel Coding over Continuous Channels
Lecture 5 Channel Coding over Continuous Channels I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw November 14, 2014 1 / 34 I-Hsiang Wang NIT Lecture 5 From
More informationBER Performance Analysis of Cooperative DaF Relay Networks and a New Optimal DaF Strategy
144 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 1, NO. 4, APRIL 11 BER Performance Analysis of Cooperative DaF Relay Networks and a New Optimal DaF Strategy George A. Ropokis, Athanasios A. Rontogiannis,
More informationLECTURE 15. Last time: Feedback channel: setting up the problem. Lecture outline. Joint source and channel coding theorem
LECTURE 15 Last time: Feedback channel: setting up the problem Perfect feedback Feedback capacity Data compression Lecture outline Joint source and channel coding theorem Converse Robustness Brain teaser
More informationMaximum mutual information vector quantization of log-likelihood ratios for memory efficient HARQ implementations
Downloaded from orbit.dtu.dk on: Apr 29, 2018 Maximum mutual information vector quantization of log-likelihood ratios for memory efficient HARQ implementations Danieli, Matteo; Forchhammer, Søren; Andersen,
More informationComplex Gaussian Ratio Distribution with Applications for Error Rate Calculation in Fading Channels with Imperfect CSI
Complex Gaussian Ratio Distribution with Applications for Error Rate Calculation in Fading Channels with Imperfect CSI Robert J. Baxley, Brett T. Walkenhorst, Guillermo Acosta-Marum Georgia Tech Research
More informationThe Effect of Memory Order on the Capacity of Finite-State Markov and Flat-Fading Channels
The Effect of Memory Order on the Capacity of Finite-State Markov and Flat-Fading Channels Parastoo Sadeghi National ICT Australia (NICTA) Sydney NSW 252 Australia Email: parastoo@student.unsw.edu.au Predrag
More informationMultiple Description Coding for quincunx images.
Multiple Description Coding for quincunx images. Application to satellite transmission. Manuela Pereira, Annabelle Gouze, Marc Antonini and Michel Barlaud { pereira, gouze, am, barlaud }@i3s.unice.fr I3S
More informationOn the Performance of SC-MMSE-FD Equalization for Fixed-Point Implementations
On the Performance of SC-MMSE-FD Equalization for Fixed-Point Implementations ISTC 2014, Bremen, Tamal Bose and Friedrich K. Jondral KIT Universität des Landes Baden-Württemberg und nationales Forschungszentrum
More informationChalmers Publication Library. Copyright Notice
Chalmers Publication Library Copyright Notice " ACM, 009. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive
More informationNew Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding
1 New Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding Alireza Kenarsari-Anhari, Student Member, IEEE, and Lutz Lampe, Senior Member, IEEE Abstract Bit-interleaved
More information