Notes on a posteriori probability (APP) metrics for LDPC

Size: px
Start display at page:

Download "Notes on a posteriori probability (APP) metrics for LDPC"

Transcription

1 Notes on a posteriori probability (APP) metrics for LDPC IEEE 802.3an Task Force November, 2004 Raju Hormis, Xiaodong Wang Columbia University, NY raju@ee.columbia.edu

2 Outline Section of draft D1.1 discusses decoding of LDPC code groups. This presentation outlines a method for calculation of exact LDPC metrics, with examples. General definition of APP metrics for iterative decoders. A simple example: PAM-2. APP metric for 1-D lattices. APP metric for 2-D and N-D lattices. Conclusions. 2

3 APP calculation for iterative decoders Iterative decoders for LDPC and turbo-codes require a posteriori probabilities (APP s) as metrics, rather than direct channel observations. Usually expressed as a log ratio, and often referred to as LLR (log likelihood ratio). Let {b 0, b 1, b 2,..., b n } be the set of bits mapped to a symbol a k in constellation A. We will denote the APP for, say bit b 0, as L b0. Consider the AWGN channel model: channel observation, and υ is AWGN. y = a k + υ, where a k is the transmitted symbol, y is the We can write the definition of L b0 as [ ] p(b0 = 0/y) L b0 log e, and applying Bayes rule, we get p(b 0 = 1/y) [ ] p(y/b0 = 0)p(b 0 = 0) p(y) = log e, p(y) p(y/b 0 = 1)p(b 0 = 1) [ ] p(y/b0 = 0) = log e. p(y/b 0 = 1) 3

4 APP computation for PAM-2 in AWGN Consider the case of PAM-2 which takes a 0 = +1 when b 0 = 0, a 1 = 1 when b 0 = 1. We will make use of the conditional Gaussian pdf of a received symbol y in AWGN: 1 p(y/a) = 2πσ 2 e (y a)2 2σ 2, where σ 2 is the noise variance. We can now derive the APP value for b 0 as p(y/b 0 = 0) L b0 = log e, as derived earlier, p(y/b 0 = 1) e (y a 0) 2 /2σ 2 = log e e, (y a 1) 2 /2σ 2 = log e e (y 1)2 /2σ 2 e (y+1)2 /2σ 2, L b0 = 2 σ 2 y. The APP value is a simpe scaled version of channel observation y. Notice that scaling is inversely proportional to noise variance. 4

5 APP for 1-D lattice: PAM-8 constellation 1 To compute the APP s for PAM-8, notice that b 2 b 1 b 0 PAM level p(b 0 = 1/y) = k p(b 0 = 0/y) = j p(a k /y), where a k A, s.t. b 0 = 1 p(a j /y), where a j A, s.t. b 0 = 0 Using the above, we can now define the LLR for b 0 as [ ] p(b0 = 0/y) L b0 log e, p(b 0 = 1/y) [ a = log k A, b 0 =0 p(a ] k/y) e a j A, b 0 =1 p(a. Now, applying Bayes rule we get, j/y) L b0 = log e a k {,+7,+1, 1, 7, } e (y a k ) 2 2σ 2 j)2 a j {,+5,+3, 3, 5, } e (y a 2σ 2. 1 S. Rao, R. Hormis, and E. Krouk, The 4-D PAM-8 proposal for 10G-Base-T, pdf, Nov

6 APP for 1-D lattice: PAM-8 constellation 500 L b0 400 L b APP channel observation y PAM-8: APP for bits b 0 and b 1, noise σ =

7 APP calculation for 2-D and N-D lattices In this case, the received symbol y and the constellation symbols, a k A, can be viewed as vectors. Let us denote the components of vector a k as [a k0 a k1 ]. Similarly, y = [y 0 y 1 ]. We can write the APP for bit b 0 as [ a L b0 = log k A,b 0 =0 p(a ] k/y) e a j A,b 0 =1 p(a, j/y) [ a = log k A, b 0 =0 p(y/a ] k) e a j A, b 0 =1 p(y/a, assuming that p(a n ) constant n. j) Notice that p(y/a k ) = p(y 0 /a k0 ). p(y 1 /a k1 ), since y 0, y 1, are conditionally independent given a k0, a k1, respectively. We can then simplify the APP for b 0 as [ a L b0 = log k A, b 0 =0 p(y ] 0/a k0 ) p(y 1 /a k1 ) e a j A, b 0 =1 p(y 0/a j0 ) p(y 1 /a j1 ) which involves products of 1-D conditional Gaussian pdf s., 7

8 APP for 2D-lattice: 2D-PAM12 Key-eye proposal Points - Cross Constellation uncoded co-set /27/ Weizhuang Xin, Modified 128 point cross constellation mapping, Aug

9 APP for 2D-lattice: 2D-PAM12 Key-eye proposal 2-D APP function of b 0, noise σ =

10 APP for 2D-lattice: 2D-PAM12 Key-eye proposal 200 cross section of LLR(b 0 ), y 1 = APP(b 0 ) horiz. 1 D PAM 12 symbol y cross section of LLR(b 0 ), y 1 = APP(b 0 ) horiz. 1 D PAM 12 symbol y 0 Cross-sections of 2-D APP function of b 0, at y 0 = +11 and y 0 = 0, noise σ =

11 APP for 2D-lattices: 2D-PAM12 Teranetics proposal 3 One Dimensional Map The Mapping of the Uncoded Bits in Two Dimensions 0.5 One Dimensional Map for 12 PAM Coset Labels L L Point Labels L L C C C C R R R R D. Dabiri and J. Tellado, Modifications to LDPC proposal offering lower symbol rate and lower latency, pdf, Mar

12 APP for 2D-lattices: 2D-PAM12 Teranetics proposal 2-D APP function for bit b 0, noise σ =

13 APP for 2D-lattices: 2D-PAM12 Teranetics proposal 600 cross section of LLR(b 0 ), y 1 = APP(b 0 ) horiz. 1 D PAM 12 symbol y cross section of LLR(b 0 ), y 1 = APP(b 0 ) horiz. 1 D PAM 12 symbol y 0 Cross-section of APP function of b 0, y 0 = +11 and y 0 = 0, noise σ =

14 Conclusions From first principles, we derived the generalized APP metric for multi-dimensional constellations. Non-rectangular constellations lead to APP s that are not always separable into 1-D functions... the 1-D functions would be approximations. Recommendations: Use of 2-D (N-D) APP metrics, depending on the dimensionality of the constellation. The APP metrics tend to be approximately piece-wise linear (planar) perhaps easy to map using LUT s or digital gates. The piece-wise linear APP metric surface should be documented. 14

Chapter 7: Channel coding:convolutional codes

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

The E8 Lattice and Error Correction in Multi-Level Flash Memory

The E8 Lattice and Error Correction in Multi-Level Flash Memory The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M. Kurkoski kurkoski@ice.uec.ac.jp University of Electro-Communications Tokyo, Japan ICC 2011 IEEE International Conference on Communications

More information

Constellation Shaping for Communication Channels with Quantized Outputs

Constellation Shaping for Communication Channels with Quantized Outputs 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

More information

Mapper & De-Mapper System Document

Mapper & De-Mapper System Document Mapper & De-Mapper System Document Mapper / De-Mapper Table of Contents. High Level System and Function Block. Mapper description 2. Demodulator Function block 2. Decoder block 2.. De-Mapper 2..2 Implementation

More information

UTA EE5362 PhD Diagnosis Exam (Spring 2011)

UTA EE5362 PhD Diagnosis Exam (Spring 2011) EE5362 Spring 2 PhD Diagnosis Exam ID: UTA EE5362 PhD Diagnosis Exam (Spring 2) Instructions: Verify that your exam contains pages (including the cover shee. Some space is provided for you to show your

More information

Performance of small signal sets

Performance of small signal sets 42 Chapter 5 Performance of small signal sets In this chapter, we show how to estimate the performance of small-to-moderate-sized signal constellations on the discrete-time AWGN channel. With equiprobable

More information

Efficient Computation of EXIT Functions for Non-Binary Iterative Decoding

Efficient Computation of EXIT Functions for Non-Binary Iterative Decoding TO BE PUBLISHED IN IEEE TRANSACTIONS ON COMMUNCATIONS, DECEMBER 2006 Efficient Computation of EXIT Functions for Non-Binary Iterative Decoding Jörg Kliewer, Senior Member, IEEE, Soon Xin Ng, Member, IEEE,

More information

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

Blind Equalization via Particle Filtering

Blind Equalization via Particle Filtering Blind Equalization via Particle Filtering Yuki Yoshida, Kazunori Hayashi, Hideaki Sakai Department of System Science, Graduate School of Informatics, Kyoto University Historical Remarks A sequential Monte

More information

Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels

Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Jilei Hou, Paul H. Siegel and Laurence B. Milstein Department of Electrical and Computer Engineering

More information

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

New 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

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

Introduction to Low-Density Parity Check Codes. Brian Kurkoski

Introduction to Low-Density Parity Check Codes. Brian Kurkoski Introduction to Low-Density Parity Check Codes Brian Kurkoski kurkoski@ice.uec.ac.jp Outline: Low Density Parity Check Codes Review block codes History Low Density Parity Check Codes Gallager s LDPC code

More information

LDPC Codes. Intracom Telecom, Peania

LDPC Codes. Intracom Telecom, Peania LDPC Codes Alexios Balatsoukas-Stimming and Athanasios P. Liavas Technical University of Crete Dept. of Electronic and Computer Engineering Telecommunications Laboratory December 16, 2011 Intracom Telecom,

More information

Turbo Codes. Manjunatha. P. Professor Dept. of ECE. June 29, J.N.N. College of Engineering, Shimoga.

Turbo Codes. Manjunatha. P. Professor Dept. of ECE. June 29, J.N.N. College of Engineering, Shimoga. Turbo Codes Manjunatha. P manjup.jnnce@gmail.com Professor Dept. of ECE J.N.N. College of Engineering, Shimoga June 29, 2013 [1, 2, 3, 4, 5, 6] Note: Slides are prepared to use in class room purpose, may

More information

Codes on Graphs. Telecommunications Laboratory. Alex Balatsoukas-Stimming. Technical University of Crete. November 27th, 2008

Codes on Graphs. Telecommunications Laboratory. Alex Balatsoukas-Stimming. Technical University of Crete. November 27th, 2008 Codes on Graphs Telecommunications Laboratory Alex Balatsoukas-Stimming Technical University of Crete November 27th, 2008 Telecommunications Laboratory (TUC) Codes on Graphs November 27th, 2008 1 / 31

More information

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

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

Layered Orthogonal Lattice Detector for Two Transmit Antenna Communications

Layered Orthogonal Lattice Detector for Two Transmit Antenna Communications Layered Orthogonal Lattice Detector for Two Transmit Antenna Communications arxiv:cs/0508064v1 [cs.it] 12 Aug 2005 Massimiliano Siti Advanced System Technologies STMicroelectronics 20041 Agrate Brianza

More information

SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land

SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land Ingmar Land, SIPCom8-1: Information Theory and Coding (2005 Spring) p.1 Overview Basic Concepts of Channel Coding Block Codes I:

More information

Error Floors of LDPC Coded BICM

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

Trellis-based Detection Techniques

Trellis-based Detection Techniques Chapter 2 Trellis-based Detection Techniques 2.1 Introduction In this chapter, we provide the reader with a brief introduction to the main detection techniques which will be relevant for the low-density

More information

Revision of Lecture 5

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

Single-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes

Single-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes Single-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes Brian M. Kurkoski, Kazuhiko Yamaguchi and Kingo Kobayashi kurkoski@ice.uec.ac.jp Dept. of Information and Communications Engineering

More information

RANDOM DISCRETE MEASURE OF THE PHASE POSTERIOR PDF IN TURBO SYNCHRONIZATION

RANDOM DISCRETE MEASURE OF THE PHASE POSTERIOR PDF IN TURBO SYNCHRONIZATION RANDOM DISCRETE MEASURE OF THE PHASE POSTERIOR PDF IN TURBO SYNCHRONIZATION Nicolas Paul, Didier Le Ruyet, Tanya Bertozzi * Michel Terre Electronique et Communications, CNAM, 292 rue Saint Martin, 75141

More information

On the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding

On the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding On the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding Jörg Kliewer, Soon Xin Ng 2, and Lajos Hanzo 2 University of Notre Dame, Department of Electrical Engineering, Notre Dame,

More information

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

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

A Simple Example Binary Hypothesis Testing Optimal Receiver Frontend M-ary Signal Sets Message Sequences. possible signals has been transmitted.

A Simple Example Binary Hypothesis Testing Optimal Receiver Frontend M-ary Signal Sets Message Sequences. possible signals has been transmitted. Introduction I We have focused on the problem of deciding which of two possible signals has been transmitted. I Binary Signal Sets I We will generalize the design of optimum (MPE) receivers to signal sets

More information

Constellation Shaping for Communication Channels with Quantized Outputs

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 information

Lecture 12. Block Diagram

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

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

General BER Expression for One-Dimensional Constellations

General BER Expression for One-Dimensional Constellations General BER Expression for One-Dimensional Constellations Mikhail Ivanov, Fredrik Brännström, Alex Alvarado, and Erik Agrell Department of Signals and Systems, Chalmers University of Technology, Gothenburg,

More information

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

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

Improved Methods for Search Radius Estimation in Sphere Detection Based MIMO Receivers

Improved Methods for Search Radius Estimation in Sphere Detection Based MIMO Receivers Improved Methods for Search Radius Estimation in Sphere Detection Based MIMO Receivers Patrick Marsch, Ernesto Zimmermann, Gerhard Fettweis Vodafone Chair Mobile Communications Systems Department of Electrical

More information

Recitation 2: Probability

Recitation 2: Probability Recitation 2: Probability Colin White, Kenny Marino January 23, 2018 Outline Facts about sets Definitions and facts about probability Random Variables and Joint Distributions Characteristics of distributions

More information

Chapter 2 Signal Processing at Receivers: Detection Theory

Chapter 2 Signal Processing at Receivers: Detection Theory Chapter Signal Processing at Receivers: Detection Theory As an application of the statistical hypothesis testing, signal detection plays a key role in signal processing at receivers of wireless communication

More information

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

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

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

BASICS OF DETECTION AND ESTIMATION THEORY

BASICS OF DETECTION AND ESTIMATION THEORY BASICS OF DETECTION AND ESTIMATION THEORY 83050E/158 In this chapter we discuss how the transmitted symbols are detected optimally from a noisy received signal (observation). Based on these results, optimal

More information

The Turbo Principle in Wireless Communications

The Turbo Principle in Wireless Communications The Turbo Principle in Wireless Communications Joachim Hagenauer Institute for Communications Engineering () Munich University of Technology (TUM) D-80290 München, Germany Nordic Radio Symposium, Oulu,

More information

Lecture 4 : Introduction to Low-density Parity-check Codes

Lecture 4 : Introduction to Low-density Parity-check Codes Lecture 4 : Introduction to Low-density Parity-check Codes LDPC codes are a class of linear block codes with implementable decoders, which provide near-capacity performance. History: 1. LDPC codes were

More information

6.451 Principles of Digital Communication II Wednesday, May 4, 2005 MIT, Spring 2005 Handout #22. Problem Set 9 Solutions

6.451 Principles of Digital Communication II Wednesday, May 4, 2005 MIT, Spring 2005 Handout #22. Problem Set 9 Solutions 6.45 Principles of Digital Communication II Wednesda, Ma 4, 25 MIT, Spring 25 Hand #22 Problem Set 9 Solutions Problem 8.3 (revised) (BCJR (sum-product) decoding of SPC codes) As shown in Problem 6.4 or

More information

MMSE DECODING FOR ANALOG JOINT SOURCE CHANNEL CODING USING MONTE CARLO IMPORTANCE SAMPLING

MMSE DECODING FOR ANALOG JOINT SOURCE CHANNEL CODING USING MONTE CARLO IMPORTANCE SAMPLING MMSE DECODING FOR ANALOG JOINT SOURCE CHANNEL CODING USING MONTE CARLO IMPORTANCE SAMPLING Yichuan Hu (), Javier Garcia-Frias () () Dept. of Elec. and Comp. Engineering University of Delaware Newark, DE

More information

IEEE C80216m-09/0079r1

IEEE C80216m-09/0079r1 Project IEEE 802.16 Broadband Wireless Access Working Group Title Efficient Demodulators for the DSTTD Scheme Date 2009-01-05 Submitted M. A. Khojastepour Ron Porat Source(s) NEC

More information

On Turbo-Schedules for LDPC Decoding

On Turbo-Schedules for LDPC Decoding On Turbo-Schedules for LDPC Decoding Alexandre de Baynast, Predrag Radosavljevic, Victor Stolpman, Joseph R. Cavallaro, Ashutosh Sabharwal Department of Electrical and Computer Engineering Rice University,

More information

Soft-Output Trellis Waveform Coding

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

Expectation propagation for signal detection in flat-fading channels

Expectation propagation for signal detection in flat-fading channels Expectation propagation for signal detection in flat-fading channels Yuan Qi MIT Media Lab Cambridge, MA, 02139 USA yuanqi@media.mit.edu Thomas Minka CMU Statistics Department Pittsburgh, PA 15213 USA

More information

Low Density Lattice Codes

Low Density Lattice Codes Low Density Lattice Codes Naftali Sommer,, Meir Feder, Ofir Shalvi Department of Electrical Engineering - Systems Tel-Aviv University, Tel-Aviv, Israel, Email: meir@eng.tau.ac.il Texas Instruments, Herzlia,

More information

Summary: SER formulation. Binary antipodal constellation. Generic binary constellation. Constellation gain. 2D constellations

Summary: SER formulation. Binary antipodal constellation. Generic binary constellation. Constellation gain. 2D constellations TUTORIAL ON DIGITAL MODULATIONS Part 8a: Error probability A [2011-01-07] 07] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello 1 Part 8a: Error

More information

Methods and tools to optimize the trade-off performance versus complexity of error control codes architectures.

Methods and tools to optimize the trade-off performance versus complexity of error control codes architectures. Methods and tools to optimize the trade-off performance versus complexity of error control codes architectures. Emmanuel Boutillon CNRS, UMR 6285, Lab-STICC Centre de Recherche - BP 92116 F-56321 Lorient

More information

A Simple Baseband Transmission Scheme for Power-Line Channels

A Simple Baseband Transmission Scheme for Power-Line Channels A Simple Baseband Transmission Scheme for Power-Line Channels Raju Hormis Inaki Berenguer Xiaodong Wang Abstract We propose a simple PAM-based coded modulation scheme that overcomes two major constraints

More information

EE4304 C-term 2007: Lecture 17 Supplemental Slides

EE4304 C-term 2007: Lecture 17 Supplemental Slides EE434 C-term 27: Lecture 17 Supplemental Slides D. Richard Brown III Worcester Polytechnic Institute, Department of Electrical and Computer Engineering February 5, 27 Geometric Representation: Optimal

More information

CHAPTER 8 Viterbi Decoding of Convolutional Codes

CHAPTER 8 Viterbi Decoding of Convolutional Codes MIT 6.02 DRAFT Lecture Notes Fall 2011 (Last update: October 9, 2011) Comments, questions or bug reports? Please contact hari at mit.edu CHAPTER 8 Viterbi Decoding of Convolutional Codes This chapter describes

More information

Baseband Transmission on Power Line Channels with LDPC Coset Codes

Baseband Transmission on Power Line Channels with LDPC Coset Codes Baseband Transmission on Power Line Channels with LDPC Coset Codes Raju Hormis Inaki Berenguer and Xiaodong Wang Columbia University New York NY University of Cambridge Cambridge UK Abstract High rate

More information

The E8 Lattice and Error Correction in Multi-Level Flash Memory

The E8 Lattice and Error Correction in Multi-Level Flash Memory The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M Kurkoski University of Electro-Communications Tokyo, Japan kurkoski@iceuecacjp Abstract A construction using the E8 lattice and Reed-Solomon

More information

Ralf Koetter, Andrew C. Singer, and Michael Tüchler

Ralf Koetter, Andrew C. Singer, and Michael Tüchler Ralf Koetter, Andrew C. Singer, and Michael Tüchler Capitalizing on the tremendous performance gains of turbo codes and the turbo decoding algorithm, turbo equalization is an iterative equalization and

More information

Projects in Wireless Communication Lecture 1

Projects in Wireless Communication Lecture 1 Projects in Wireless Communication Lecture 1 Fredrik Tufvesson/Fredrik Rusek Department of Electrical and Information Technology Lund University, Sweden Lund, Sept 2018 Outline Introduction to the course

More information

Status of Knowledge on Non-Binary LDPC Decoders

Status of Knowledge on Non-Binary LDPC Decoders Status of Knowledge on Non-Binary LDPC Decoders Part I: From Binary to Non-Binary Belief Propagation Decoding D. Declercq 1 1 ETIS - UMR8051 ENSEA/Cergy-University/CNRS France IEEE SSC SCV Tutorial, Santa

More information

Digital Communications

Digital Communications Digital Communications Chapter 8: Trellis and Graph Based Codes Saeedeh Moloudi May 7, 2014 Outline 1 Introduction 2 Convolutional Codes 3 Decoding of Convolutional Codes 4 Turbo Codes May 7, 2014 Proakis-Salehi

More information

Naïve Bayes classification

Naïve Bayes classification Naïve Bayes classification 1 Probability theory Random variable: a variable whose possible values are numerical outcomes of a random phenomenon. Examples: A person s height, the outcome of a coin toss

More information

PUNCTURED 8-PSK TURBO-TCM TRANSMISSIONS USING RECURSIVE SYSTEMATIC CONVOLUTIONAL GF ( 2 N ) ENCODERS

PUNCTURED 8-PSK TURBO-TCM TRANSMISSIONS USING RECURSIVE SYSTEMATIC CONVOLUTIONAL GF ( 2 N ) ENCODERS 19th European Signal Processing Conference (EUSIPCO 2011) Barcelona, Spain, August 29 - September 2, 2011 PUCTURED 8-PSK TURBO-TCM TRASMISSIOS USIG RECURSIVE SYSTEMATIC COVOLUTIOAL GF ( 2 ) ECODERS Calin

More information

Expected Error Based MMSE Detection Ordering for Iterative Detection-Decoding MIMO Systems

Expected Error Based MMSE Detection Ordering for Iterative Detection-Decoding MIMO Systems Expected Error Based MMSE Detection Ordering for Iterative Detection-Decoding MIMO Systems Lei Zhang, Chunhui Zhou, Shidong Zhou, Xibin Xu National Laboratory for Information Science and Technology, Tsinghua

More information

COMBINING DECODED-AND-FORWARDED SIGNALS IN GAUSSIAN COOPERATIVE CHANNELS

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

ECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture)

ECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture) ECE 564/645 - Digital Communications, Spring 018 Homework # Due: March 19 (In Lecture) 1. Consider a binary communication system over a 1-dimensional vector channel where message m 1 is sent by signaling

More information

Modern Coding Theory. Daniel J. Costello, Jr School of Information Theory Northwestern University August 10, 2009

Modern Coding Theory. Daniel J. Costello, Jr School of Information Theory Northwestern University August 10, 2009 Modern Coding Theory Daniel J. Costello, Jr. Coding Research Group Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 2009 School of Information Theory Northwestern University

More information

Probability review. September 11, Stoch. Systems Analysis Introduction 1

Probability review. September 11, Stoch. Systems Analysis Introduction 1 Probability review Alejandro Ribeiro Dept. of Electrical and Systems Engineering University of Pennsylvania aribeiro@seas.upenn.edu http://www.seas.upenn.edu/users/~aribeiro/ September 11, 2015 Stoch.

More information

SYDE 372 Introduction to Pattern Recognition. Probability Measures for Classification: Part I

SYDE 372 Introduction to Pattern Recognition. Probability Measures for Classification: Part I SYDE 372 Introduction to Pattern Recognition Probability Measures for Classification: Part I Alexander Wong Department of Systems Design Engineering University of Waterloo Outline 1 2 3 4 Why use probability

More information

Energy State Amplification in an Energy Harvesting Communication System

Energy State Amplification in an Energy Harvesting Communication System Energy State Amplification in an Energy Harvesting Communication System Omur Ozel Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland College Park, MD 20742 omur@umd.edu

More information

Impact of channel-state information on coded transmission over fading channels with diversity reception

Impact of channel-state information on coded transmission over fading channels with diversity reception Impact of channel-state information on coded transmission over fading channels with diversity reception Giorgio Taricco Ezio Biglieri Giuseppe Caire September 4, 1998 Abstract We study the synergy between

More information

Digital Modulation 1

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

LOW-density parity-check (LDPC) codes were invented

LOW-density parity-check (LDPC) codes were invented IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 1, JANUARY 2008 51 Extremal Problems of Information Combining Yibo Jiang, Alexei Ashikhmin, Member, IEEE, Ralf Koetter, Senior Member, IEEE, and Andrew

More information

Parameter Estimation

Parameter Estimation 1 / 44 Parameter Estimation Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay October 25, 2012 Motivation System Model used to Derive

More information

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

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

Performance of Multi Binary Turbo-Codes on Nakagami Flat Fading Channels

Performance of Multi Binary Turbo-Codes on Nakagami Flat Fading Channels Buletinul Ştiinţific al Universităţii "Politehnica" din Timişoara Seria ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS on ELECTRONICS and COMMUNICATIONS Tom 5(65), Fascicola -2, 26 Performance of Multi Binary

More information

PSK bit mappings with good minimax error probability

PSK bit mappings with good minimax error probability PSK bit mappings with good minimax error probability Erik Agrell Department of Signals and Systems Chalmers University of Technology 4196 Göteborg, Sweden Email: agrell@chalmers.se Erik G. Ström Department

More information

Exact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel

Exact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel Exact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel Brian M. Kurkoski, Paul H. Siegel, and Jack K. Wolf Department of Electrical and Computer Engineering

More information

OPTIMUM fixed-rate scalar quantizers, introduced by Max

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

A Lloyd-Max based quantizer of L-values for AWGN and Rayleigh Fading channel

A Lloyd-Max based quantizer of L-values for AWGN and Rayleigh Fading channel A Lloyd-Max based quantizer of L-values for AWGN and Rayleigh Fading channel Yasser Samayoa, Jörn Ostermann Institut für Informationsverarbeitung Gottfried Wilhelm Leibniz Universität Hannover 367 Hannover,

More information

One Lesson of Information Theory

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

Es e j4φ +4N n. 16 KE s /N 0. σ 2ˆφ4 1 γ s. p(φ e )= exp 1 ( 2πσ φ b cos N 2 φ e 0

Es e j4φ +4N n. 16 KE s /N 0. σ 2ˆφ4 1 γ s. p(φ e )= exp 1 ( 2πσ φ b cos N 2 φ e 0 Problem 6.15 : he received signal-plus-noise vector at the output of the matched filter may be represented as (see (5-2-63) for example) : r n = E s e j(θn φ) + N n where θ n =0,π/2,π,3π/2 for QPSK, and

More information

Turbo Codes for Deep-Space Communications

Turbo Codes for Deep-Space Communications TDA Progress Report 42-120 February 15, 1995 Turbo Codes for Deep-Space Communications D. Divsalar and F. Pollara Communications Systems Research Section Turbo codes were recently proposed by Berrou, Glavieux,

More information

Maximum Likelihood Decoding of Codes on the Asymmetric Z-channel

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

Binary Transmissions over Additive Gaussian Noise: A Closed-Form Expression for the Channel Capacity 1

Binary Transmissions over Additive Gaussian Noise: A Closed-Form Expression for the Channel Capacity 1 5 Conference on Information Sciences and Systems, The Johns Hopkins University, March 6 8, 5 inary Transmissions over Additive Gaussian Noise: A Closed-Form Expression for the Channel Capacity Ahmed O.

More information

Lecture 4. Capacity of Fading Channels

Lecture 4. Capacity of Fading Channels 1 Lecture 4. Capacity of Fading Channels Capacity of AWGN Channels Capacity of Fading Channels Ergodic Capacity Outage Capacity Shannon and Information Theory Claude Elwood Shannon (April 3, 1916 February

More information

Low Density Parity Check (LDPC) Codes and the Need for Stronger ECC. August 2011 Ravi Motwani, Zion Kwok, Scott Nelson

Low Density Parity Check (LDPC) Codes and the Need for Stronger ECC. August 2011 Ravi Motwani, Zion Kwok, Scott Nelson Low Density Parity Check (LDPC) Codes and the Need for Stronger ECC August 2011 Ravi Motwani, Zion Kwok, Scott Nelson Agenda NAND ECC History Soft Information What is soft information How do we obtain

More information

A Close to Capacity Dirty Paper Coding Scheme

A Close to Capacity Dirty Paper Coding Scheme SUBMITTED TO IEEE TRANS. ON INFORM. THEORY, APR.,, REVISED VERSION SEPTEMBER, A Close to Capacity Dirty Paper Coding Scheme Uri Erez and Stephan ten Brink Abstract The writing on dirty paper channel model

More information

Amitkumar Mahadevan, Doctor of Philosophy, 2005

Amitkumar Mahadevan, Doctor of Philosophy, 2005 Amitkumar Mahadevan, Doctor of Philosophy, 2005 Abstract Title of Dissertation: On RCD Codes as a Class of LDPC Codes: Properties, Decoding, and Performance Evaluation Amitkumar Mahadevan, Ph.D., 2005

More information

Digital Transmission Methods S

Digital Transmission Methods S Digital ransmission ethods S-7.5 Second Exercise Session Hypothesis esting Decision aking Gram-Schmidt method Detection.K.K. Communication Laboratory 5//6 Konstantinos.koufos@tkk.fi Exercise We assume

More information

Naïve Bayes classification. p ij 11/15/16. Probability theory. Probability theory. Probability theory. X P (X = x i )=1 i. Marginal Probability

Naïve Bayes classification. p ij 11/15/16. Probability theory. Probability theory. Probability theory. X P (X = x i )=1 i. Marginal Probability Probability theory Naïve Bayes classification Random variable: a variable whose possible values are numerical outcomes of a random phenomenon. s: A person s height, the outcome of a coin toss Distinguish

More information

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

Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach

Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach Shu Lin, Shumei Song, Lan Lan, Lingqi Zeng and Ying Y Tai Department of Electrical & Computer Engineering University of California,

More information

Low-Density Parity-Check codes An introduction

Low-Density Parity-Check codes An introduction Low-Density Parity-Check codes An introduction c Tilo Strutz, 2010-2014,2016 June 9, 2016 Abstract Low-density parity-check codes (LDPC codes) are efficient channel coding codes that allow transmission

More information

Performance Analysis and Interleaver Structure Optimization for Short-Frame BICM-OFDM Systems

Performance Analysis and Interleaver Structure Optimization for Short-Frame BICM-OFDM Systems 1 Performance Analysis and Interleaver Structure Optimization for Short-Frame BICM-OFDM Systems Yuta Hori, Student Member, IEEE, and Hideki Ochiai, Member, IEEE Abstract Bit-interleaved coded modulation

More information

On Reliable Communications over Channels Impaired by Bursty Impulse Noise

On Reliable Communications over Channels Impaired by Bursty Impulse Noise 2024 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 57, NO. 7, JULY 2009 On Reliable Communications over Channels Impaired by Bursty Impulse Noise Dario Fertonani, Member, IEEE, and Giulio Colavolpe, Member,

More information

Turbo Codes for xdsl modems

Turbo Codes for xdsl modems Turbo Codes for xdsl modems Juan Alberto Torres, Ph. D. VOCAL Technologies, Ltd. (http://www.vocal.com) John James Audubon Parkway Buffalo, NY 14228, USA Phone: +1 716 688 4675 Fax: +1 716 639 0713 Email:

More information

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

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

UC Riverside UC Riverside Previously Published Works

UC Riverside UC Riverside Previously Published Works UC Riverside UC Riverside Previously Published Works Title Soft-decision decoding of Reed-Muller codes: A simplied algorithm Permalink https://escholarship.org/uc/item/5v71z6zr Journal IEEE Transactions

More information

5. Density evolution. Density evolution 5-1

5. Density evolution. Density evolution 5-1 5. Density evolution Density evolution 5-1 Probabilistic analysis of message passing algorithms variable nodes factor nodes x1 a x i x2 a(x i ; x j ; x k ) x3 b x4 consider factor graph model G = (V ;

More information

A Systematic Description of Source Significance Information

A Systematic Description of Source Significance Information A Systematic Description of Source Significance Information Norbert Goertz Institute for Digital Communications School of Engineering and Electronics The University of Edinburgh Mayfield Rd., Edinburgh

More information

LDPC-Coded M-ary PSK Optical Coherent State Quantum Communication Ivan B. Djordjevic, Member, IEEE

LDPC-Coded M-ary PSK Optical Coherent State Quantum Communication Ivan B. Djordjevic, Member, IEEE 494 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 27, NO. 5, MARCH 1, 2009 LDPC-Coded M-ary PSK Optical Coherent State Quantum Communication Ivan B. Djordjevic, Member, IEEE Abstract This paper addresses two important

More information

Graph-Based Decoding in the Presence of ISI

Graph-Based Decoding in the Presence of ISI 1 Graph-Based Decoding in the Presence of ISI Mohammad H. Taghavi and Paul H. Siegel Center for Magnetic Recording Research University of California, San Diego La Jolla, CA 92093-0401, USA Email: (mtaghavi,

More information