Coding for Noncoherent M-ary Modulation

Slides:



Advertisements
Similar presentations
Iterative Equalization and Decoding
Advertisements

Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Wireless Modulation Schemes
Doc.: IEEE wng-r1 Contribution Labeling Diversity Date: November 2013 Maciej Krasicki (Poznan University of Technology)Slide.
S Digital Communication Systems Bandpass modulation II.
Inserting Turbo Code Technology into the DVB Satellite Broadcasting System Matthew Valenti Assistant Professor West Virginia University Morgantown, WV.
The Impact of Channel Estimation Errors on Space-Time Block Codes Presentation for Virginia Tech Symposium on Wireless Personal Communications M. C. Valenti.
Diversity techniques for flat fading channels BER vs. SNR in a flat fading channel Different kinds of diversity techniques Selection diversity performance.
Submission May, 2000 Doc: IEEE / 086 Steven Gray, Nokia Slide Brief Overview of Information Theory and Channel Coding Steven D. Gray 1.
Optimization of pilot Locations in Adaptive M-PSK Modulation in a Rayleigh Fading Channel Khaled Almustafa Information System Prince Sultan University.
TELIN Estimation and detection from coded signals Presented by Marc Moeneclaey, UGent - TELIN dept. Joint research : - UGent.
TELIN Estimation and detection from coded signals Presented by Marc Moeneclaey, UGent - TELIN dept. Joint research : - UGent.
Quadrature Amplitude Modulation Forrest Sedgwick UC Berkeley EECS Dept. EE290F October 2003.
Space Time Block Codes Poornima Nookala.
Concatenated Codes, Turbo Codes and Iterative Processing
VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Turbo Codes and Iterative Processing IEEE New Zealand Wireless.
ECE 4371, Fall, 2014 Introduction to Telecommunication Engineering/Telecommunication Laboratory Zhu Han Department of Electrical and Computer Engineering.
Per-survivor Based Detection of DPSK Modulated High Rate Turbo Codes Over Rayleigh Fading Channels Bin Zhao and Matthew C. Valenti Lane Dept. of Comp.
On the Coded Complex Field Network Coding Scheme for Multiuser Cooperative Communications with Regenerative Relays Caixi Key Lab of Information.
Copyright 2003 Improving Uplink Performance by Macrodiversity Combining Packets from Adjacent Access Points Matthew C. Valenti Assistant Professor Lane.
Multilevel Coding and Iterative Multistage Decoding ELEC 599 Project Presentation Mohammad Jaber Borran Rice University April 21, 2000.
Coded Transmit Macrodiversity: Block Space-Time Codes over Distributed Antennas Yipeng Tang and Matthew Valenti Lane Dept. of Comp. Sci. & Elect. Engg.
Telex Magloire Ngatched Centre for Radio Access Technologies University Of Natal Durban, South-Africa Telex Magloire Ngatched Centre for Radio Access Technologies.
Mutual Information as a Tool for the Design, Analysis, and Testing of Modern Communication Systems June 8, 2007 Matthew Valenti Associate Professor West.
West Virginia University
A Soft Decision Decoding Scheme for Wireless COFDM with Application to DVB-T Advisor : Yung-An Kao Student : Chi-Ting Wu
ECE 4371, Fall, 2014 Introduction to Telecommunication Engineering/Telecommunication Laboratory Zhu Han Department of Electrical and Computer Engineering.
CODED COOPERATIVE TRANSMISSION FOR WIRELESS COMMUNICATIONS Prof. Jinhong Yuan 原进宏 School of Electrical Engineering and Telecommunications University of.
Rohit Iyer Seshadri and Matthew C. Valenti
Iterative Multi-user Detection for STBC DS-CDMA Systems in Rayleigh Fading Channels Derrick B. Mashwama And Emmanuel O. Bejide.
Soft-in/ Soft-out Noncoherent Sequence Detection for Bluetooth: Capacity, Error Rate and Throughput Analysis Rohit Iyer Seshadri and Matthew C. Valenti.
EE 6332, Spring, 2014 Wireless Communication Zhu Han Department of Electrical and Computer Engineering Class 11 Feb. 19 th, 2014.
VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Multiuser Detection with Base Station Diversity IEEE International.
Iterative decoding If the output of the outer decoder were reapplied to the inner decoder it would detect that some errors remained, since the columns.
Name Iterative Source- and Channel Decoding Speaker: Inga Trusova Advisor: Joachim Hagenauer.
The Effect of Channel Estimation Error on the Performance of Finite-Depth Interleaved Convolutional Code Jittra Jootar, James R. Zeidler, John G. Proakis.
Synchronization of Turbo Codes Based on Online Statistics
VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Combined Multiuser Detection and Channel Decoding with Receiver.
VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Combined Multiuser Reception and Channel Decoding for TDMA.
Iterative Channel Estimation for Turbo Codes over Fading Channels Matthew C. Valenti Assistant Professor Dept. of Comp. Sci. & Elect. Eng. West Virginia.
Real-Time Turbo Decoder Nasir Ahmed Mani Vaya Elec 434 Rice University.
EE359 – Lecture 12 Outline Combining Techniques
Iterative detection and decoding to approach MIMO capacity Jun Won Choi.
Coherent Detection Primary Advantage Primary Disadvantage
VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Performance of Turbo Codes in Interleaved Flat Fading Channels.
Turbo Codes. 2 A Need for Better Codes Designing a channel code is always a tradeoff between energy efficiency and bandwidth efficiency. Lower rate Codes.
VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Iterative Multiuser Detection for Convolutionally Coded Asynchronous.
FMT Modulation for Wireless Communication
Cooperative Diversity Using Distributed Turbo Codes Bin Zhao and Matthew C. Valenti Lane Dept. of Comp. Sci. & Elect. Eng. West Virginia.
EEE Chapter 7 Error Probabilities for Noncoherent Systems Huseyin Bilgekul EEE 461 Communication Systems II Department of Electrical and Electronic.
Matthew Valenti West Virginia University
EE359 – Lecture 9 Outline Linear Modulation Review
A Bandwidth Efficient Pilot Symbol Technique for Coherent Detection of Turbo Codes over Fading Channels Matthew C. Valenti Dept. of Comp. Sci. & Elect.
Information Theory & Coding for Digital Communications Prof JA Ritcey EE 417 Source; Anderson Digital Transmission Engineering 2005.
10/19/20051 Turbo-NFSK: Iterative Estimation, Noncoherent Demodulation, and Decoding for Fast Fading Channels Shi Cheng and Matthew C. Valenti West Virginia.
EE359 – Lecture 8 Outline Capacity of Flat-Fading Channels
Advanced Wireless Networks
Rohit Iyer Seshadri and Matthew C. Valenti
Advanced Wireless Networks
An Efficient Software Radio Implementation of the UMTS Turbo Codec
Diversity Lecture 7.
Rate Mapping for SISO, AWGN channel
Shi Cheng and Matthew C. Valenti Lane Dept. of CSEE
Coding and Interleaving
Bin Zhao, Ph.D. student Matthew Valenti, Assistant Professor
Chapter 6.
March 22, 2006 Tarik Ghanim Matthew Valenti West Virginia University
CT-474: Satellite Communications
Joint Coding and Modulation Diversity for ac
Turbo-equalization for n/ac
Presentation transcript:

Coding for Noncoherent M-ary Modulation Matthew Valenti Shi Cheng West Virginia University Morgantown, WV {mvalenti,shic}@csee.wvu.edu 11/10/2004

Motivation Objective: M-ary Noncoherent FSK Questions: The objective is to design methods for communicating over a noncoherent (random phase) channel at low Eb/No. M-ary Noncoherent FSK Coherent reception not always possible: Rapid relative motion between transmitter and receiver. Phase noise in local oscillators. A natural choice is noncoherent FSK. M-ary FSK allows bandwidth efficiency to be traded for energy efficiency. Questions: What is the information theoretic limit of M-ary NFSK? How can we approach that limit in practice? 11/10/2004

Capacity of M-ary NFSK in AWGN 15 Reference: W. E. Stark, “Capacity and cutoff rate of noncoherent FSK with nonselective Rician fading,” IEEE Trans. Commun., Nov. 1985. 10 Noncoherent combining penalty Minimum Eb/No (in dB) M=2 5 M=4 M=16 M=64 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Rate R (symbol per channel use)

Bit Interleaved Coded Modulation Binary to M-ary mapping Binary Encoder Bitwise Interleaver M-ary- modulator Random Phase AWGN Soft-In Binary Decoder LLR Bit Metric Calculation Receiver front end Bitwise Deinterleaver Caire G. Caire, G. Taricco, E. Biglieri, “Bit-interleaved coded modulation,” IEEE Trans. Inform. Theory, May 1998 1998

M-FSK: Noncoherent Channel LLR To determine the LLR of bit k, 1  k  log2M Let Sk(1) be the set of symbol indices for which the kth bit is a one, and Sk(0) the set of symbols indices for which the kth bit is a zero. Assume that the bits other than k are equally likely to be 0 or 1. Then: For BFSK this becomes: 11/10/2004

Turbo Coded 16-ary NFSK 10 10 10 BER 10 10 2 2.5 3 3.5 4 4.5 5 10 Capacity limit is 2.07 dB -1 # iterations = {1, 2, 3, 4, 5, 10, 16} 10 Performance using Rate 1/2 cdma2000 Turbo Code 6138 data bits 16 iterations log-MAP -2 10 BER -3 10 -4 10 1.75 dB from capacity at BER 10-5 2 2.5 3 3.5 4 4.5 5 Eb/No(in dB)

BICM-ID: Bit Interleaved Coded Modulation with Iterative Decoding Binary to M-ary mapping Binary Encoder Bitwise Interleaver M-ary- modulator Random Phase AWGN Soft-In Binary Decoder LLR Bit Metric Calculation Receiver front end Bitwise Deinterleaver Li and Ritcey indicate a 1 dB gain from hard decision feedback in Rayleigh fading for 8-PSK and r=2/3 convolutional coding Bitwise Interleaver Soft-Output Estimates of Coded Bits

Noncoherent M-FSK Using A Priori Probabilities Earlier we assumed that all modulated symbols were equally likely and obtained the bit LLR: However, we can use the bit probabilities derived from the decoder to improve the bit LLRs: 11/10/2004

Computing the A Priori Probabilities We want to find p(si|ck’) by using the extrinsic bit information from the decoder. Let pj be the decoder’s estimate that the probability of the jth bit is a one: Then if si  [b1i b2i … bmi] 11/10/2004

Simplified Expression The LLR can also be expressed as: Where: 11/10/2004

16-NFSK: BICM vs. BICM-ID 10 BICM BICM ID 10 10 BER 10 10 2 2.5 3 3.5 10 BICM BICM ID -1 # iterations = {1, 2, 3, 4, 5, 10, 16} 10 Performance using Rate 1/2 cdma2000 Turbo Code 6138 data bits 16 iterations log-MAP -2 10 BER -3 10 -4 10 1.1 dB from capacity at BER 10-5 2 2.5 3 3.5 4 4.5 5 Eb/No(in dB)

Convergence Analysis: BICM 2.5 Rate 1/2 cdma2000 Turbo Code Gaussian Approximation for Decoder Output Shown: Eb/No = 3.8 dB Threshold: Eb/No = 3.69 dB Capacity: Eb/No = 2.07 dB 2 1.5 SNR out 1 0.5 11/10/2004 0.5 1 1.5 2 2.5 SNR in

Convergence Analysis: BICM-ID 1.5 Shown: Eb/No = 3.2 dB Threshold: Eb/No = 3.03 dB Capacity: Eb/No = 2.07 dB 1 SNR out 0.5 11/10/2004 0.5 1 1.5 SNR in

16-NFSK: BICM vs. BICM-ID 10 BICM BICM ID 10 10 BER 10 10 2 2.5 3 3.5 10 BICM BICM ID -1 10 -2 10 BER -3 10 -4 10 2 2.5 3 3.5 4 4.5 5 Eb/No(in dB)

Conclusions Feeding back from decoder to demod can improve the performance of noncoherent M-FSK. For M=16 and r=1/2 coding, the improvement is 0.65 dB in AWGN. Other possible benefits Reduce number of iterations from 16 to 4 Reduce signal constellation size from 64 to 16 The additional complexity is negligible No extra iterations needed. Only need to update demod metrics during each iteration Need to perform channel interleaving/deinterleaving during each iteration. 11/10/2004

Ongoing and Future Work Try to close gap further Optimize interleaver design. Consider symbol-interleaving and nonbinary codes. More iterations. Fading With and without amplitude estimates (CSI). Ergodic vs. block fading. Other applications Cooperative diversity systems for sensor networks. Performance in FH systems with partial band jamming. 11/10/2004

Capacity of M-ary NFSK in Rayleigh Fading 15 Ergodic Capacity (Fully interleaved) Assumes perfect fading amplitude estimates available to receiver 10 M=2 Minimum Eb/No (in dB) M=4 5 M=16 M=64 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Rate R (symbol per channel use)

BER of Noncoherent 16-FSK in AWGN with UMTS Turbo Code 10 BICM # iterations = {1, 2, 3, 4, 5, 10, 16} BICM-ID -1 10 -2 10 BER -3 10 -4 10 capacity = 2.3 dB 5114 bit data word 3 3.5 4 4.5 5 5.5 Eb/No (dB)