Constellation Shaping for Communication Channels with Quantized Outputs

Similar documents
Constellation Shaping for Communication Channels with Quantized Outputs

MODULATION AND CODING FOR QUANTIZED CHANNELS. Xiaoying Shao and Harm S. Cronie

One Lesson of Information Theory

Exercise 1. = P(y a 1)P(a 1 )

On the Limits of Communication with Low-Precision Analog-to-Digital Conversion at the Receiver

ECE Information theory Final

The PPM Poisson Channel: Finite-Length Bounds and Code Design

Chapter 7: Channel coding:convolutional codes

Lecture 2. Capacity of the Gaussian channel

Capacity of the Discrete-Time AWGN Channel Under Output Quantization

Channel capacity. Outline : 1. Source entropy 2. Discrete memoryless channel 3. Mutual information 4. Channel capacity 5.

CHANNEL CAPACITY CALCULATIONS FOR M ARY N DIMENSIONAL SIGNAL SETS

Notes on a posteriori probability (APP) metrics for LDPC

One-Bit LDPC Message Passing Decoding Based on Maximization of Mutual Information

Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation

Joint FEC Encoder and Linear Precoder Design for MIMO Systems with Antenna Correlation

Message-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras

Multicarrier transmission DMT/OFDM

Notes 3: Stochastic channels and noisy coding theorem bound. 1 Model of information communication and noisy channel

RCA Analysis of the Polar Codes and the use of Feedback to aid Polarization at Short Blocklengths

ELEC546 Review of Information Theory

Principles of Communications

Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes

Shannon Information Theory

Appendix B Information theory from first principles

Capacity of a channel Shannon s second theorem. Information Theory 1/33

C.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University

Compound Polar Codes

Blind phase/frequency synchronization with low-precision ADC: a Bayesian approach

ECE Information theory Final (Fall 2008)

JOINT ITERATIVE DETECTION AND DECODING IN THE PRESENCE OF PHASE NOISE AND FREQUENCY OFFSET

Space-Time Coding for Multi-Antenna Systems

Digital Modulation 1

COMBINING DECODED-AND-FORWARDED SIGNALS IN GAUSSIAN COOPERATIVE CHANNELS

Capacity of the Discrete Memoryless Energy Harvesting Channel with Side Information

Chapter 9 Fundamental Limits in Information Theory

QAM Constellations for BICM-ID

Shannon s noisy-channel theorem

Digital communication system. Shannon s separation principle

Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes and Applications

Network coding for multicast relation to compression and generalization of Slepian-Wolf

Channel Dependent Adaptive Modulation and Coding Without Channel State Information at the Transmitter

Chapter 4: Continuous channel and its capacity

Graph-based Codes for Quantize-Map-and-Forward Relaying

Entropy, Inference, and Channel Coding

Rapport technique #INRS-EMT Exact Expression for the BER of Rectangular QAM with Arbitrary Constellation Mapping

SOFT DECISION FANO DECODING OF BLOCK CODES OVER DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM

Lecture 5: Channel Capacity. Copyright G. Caire (Sample Lectures) 122

Revision of Lecture 5

Soft-Decision Demodulation Design for COVQ over White, Colored, and ISI Gaussian Channels

The Poisson Channel with Side Information

Optimal Power Allocation for Distributed BLUE Estimation with Linear Spatial Collaboration

On Dependence Balance Bounds for Two Way Channels

Maximum Likelihood Decoding of Codes on the Asymmetric Z-channel

Optimization of Modulation Constrained Digital Transmission Systems

On the Capacity of the Two-Hop Half-Duplex Relay Channel

Computation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems

NAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR. Sp ' 00

Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes and Applications

Lattice Reduction Aided Precoding for Multiuser MIMO using Seysen s Algorithm

Noisy channel communication

Bit-Interleaved Coded Modulation With Mismatched Decoding Metrics

Optimum Soft Decision Decoding of Linear Block Codes

On the Joint Decoding of LDPC Codes and Finite-State Channels via Linear Programming

The Method of Types and Its Application to Information Hiding

Revision of Lecture 4

Cut-Set Bound and Dependence Balance Bound

Coding Techniques for Data Storage Systems

EE4512 Analog and Digital Communications Chapter 4. Chapter 4 Receiver Design

Efficient LLR Calculation for Non-Binary Modulations over Fading Channels

Optimized Symbol Mappings for Bit-Interleaved Coded Modulation with Iterative Decoding

Error Floors of LDPC Coded BICM

Soft-Output Trellis Waveform Coding

AALTO UNIVERSITY School of Electrical Engineering. Sergio Damian Lembo MODELING BLER PERFORMANCE OF PUNCTURED TURBO CODES

Turbo Compression. Andrej Rikovsky, Advisor: Pavol Hanus

OPTIMUM fixed-rate scalar quantizers, introduced by Max

Variable Length Codes for Degraded Broadcast Channels

II. THE TWO-WAY TWO-RELAY CHANNEL

Lecture 8: Channel Capacity, Continuous Random Variables

Analytical Bounds on Maximum-Likelihood Decoded Linear Codes: An Overview

Convolutional Codes. Telecommunications Laboratory. Alex Balatsoukas-Stimming. Technical University of Crete. November 6th, 2008

X 1 : X Table 1: Y = X X 2

Introduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.

Lecture 6 I. CHANNEL CODING. X n (m) P Y X

EE 5345 Biomedical Instrumentation Lecture 12: slides

Expectation propagation for symbol detection in large-scale MIMO communications

Lecture 12. Block Diagram

State-of-the-Art Channel Coding

On the Use of Division Algebras for Wireless Communication

Lecture 5 Channel Coding over Continuous Channels

BER Performance Analysis of Cooperative DaF Relay Networks and a New Optimal DaF Strategy

LECTURE 15. Last time: Feedback channel: setting up the problem. Lecture outline. Joint source and channel coding theorem

Maximum mutual information vector quantization of log-likelihood ratios for memory efficient HARQ implementations

Complex Gaussian Ratio Distribution with Applications for Error Rate Calculation in Fading Channels with Imperfect CSI

The Effect of Memory Order on the Capacity of Finite-State Markov and Flat-Fading Channels

Multiple Description Coding for quincunx images.

On the Performance of SC-MMSE-FD Equalization for Fixed-Point Implementations

Chalmers Publication Library. Copyright Notice

New Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding

Transcription:

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

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

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

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

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

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. 4 3.5 Information rate results of 6 PAM under continuous output and uniform constellation INFORMATION RATE 3 2.5 2.5.5 - -5 5 5 2 25 3 SNR(dB) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and Electrical - March 24, Engineering 2 West 6 / 3 Virg

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

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 -.5 - -3-2 - 2 3 - -3-2 - 2 3 (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

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

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

Constellation Shaping 6-PAM results with continuous output optimized over p 4 3.5 INFORMATION RATE 3 2.5 2.5.77 db.5 shaping uniform - -5 5 5 2 25 3 SNR(dB) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 West / 3 Virg

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

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 -6-2 2 6 Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 3 West / 3 Virg

Quantization Importance of Quantizer Spacing INFORMATION RATE.5.95.9.85.8.75.7.65.6.55.5.5 QUANTIZER SPACING (c) Information Variation with quantizer spacing at SNR = db, uniformly-distributed inputs and 6 quantization levels INFORMATION RATE 4 3.5 3 2.5 2.5.5 optimum quantizer non-optimum quantizer - -5 5 5 2 25 3 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

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

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

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

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

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

Capacity Results Optimization Results 4 3.5 3. 3.5 3.5 INFORMATION RATE 3 2.5 2.5.5 3 2.99 6. 6.2 6.3 Cont l=8 l=7 l=6 l=5 l=4 INFORMATION RATE 3 2.5 2.5.5 3 2.995 5.35 5.4 5.45 Cont l=8 l=7 l=6 l=5 l=4 - -5 5 5 2 25 3 SNR(dB) (e) Uniform Distribution -5 5 5 2 25 3 SNR(dB) (f) Shaped Distribution Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 2 West / 3 Virg

Optimization Results Shaping Gain and its evaluation.8 4 SHAPING GAIN(dB).7.6.5.4.3.2. Cont l=8 l=7 l=6 l=5 l=4 INFORMATION RATE 3.5 3 2.5 2.5.5 shaped l=7 uniform l=7 shaped l=4 uniform l=4.5.5 2 2.5 3 3.5 4 INFORMATION RATE - -5 5 5 2 25 3 SNR(dB) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 2 West / 3 Virg

Optimization Results Quantization Loss and its evaluation QUANTIZATION LOSS(dB).5.5 l=4 l=5 l=6 l=7 l=8 INFORMATION RATE 4 3.5 3 2.5 2.5.5 shaped cont shaped l=5 shaped l=4.5.5 2 2.5 3 3.5 4 INFORMATION RATE - -5 5 5 2 25 3 SNR(dB) (i) Shaped Distribution Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 22 West / 3 Virg

Quantization Loss Optimization Results.5 QUANTIZATION LOSS(dB).5 l=4 l=5 l=6 l=7 l=8.5.5 2 2.5 3 3.5 4 INFORMATION RATE Figure: Uniform Distribution Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 23 West / 3 Virg

Optimization Results Optimization Results.8.9 QUANTIZER SPACING.7.6.5.4.3.2 l=4 l=5 l=6 l=7 l=8 OPTIMUM P.85.8.75.7.65.6 Cont l=8 l=7 l=6 l=5 l=4..55 - -5 5 5 2 25 3 SNR(dB) (a) Optimal Quantizer Spacing.5 - -5 5 5 2 25 3 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

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

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

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 2.994 2/2672.39.272.534.58.265 Shaping 2.9836 2/2479 7/.72.339.67.27.278 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=8-3 -3-4 -4-5 -5 2 3 4 5 6 7 Eb/No(dB).5 2 2.5 3 3.5 4 4.5 Eb/No(dB) Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 27 West / 3 Virg

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.387.393.4.476.75 2.74 Shaping.63.68.64.728.82 2.5 Uniform 3.378 3.394 3.585 3.73 4.84 5.524 Shaping 2.789 2.8 2.922 3.54 3.742 5.2 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

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

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

Conclusion Questions Constellation ( Lane Shaping Department with Quantization of Computer ScienceCISS and-electrical March 24, Engineering 2 3 West / 3 Virg