Matthew C. Valenti (presenter)

Slides:



Advertisements
Similar presentations
Inserting Turbo Code Technology into the DVB Satellite Broadcasting System Matthew Valenti Assistant Professor West Virginia University Morgantown, WV.
Advertisements

The Impact of Channel Estimation Errors on Space-Time Block Codes Presentation for Virginia Tech Symposium on Wireless Personal Communications M. C. Valenti.
1 Wireless Sensor Networks Akyildiz/Vuran Administration Issues  Take home Mid-term Exam  Assign April 2, Due April 7  Individual work is required 
2005/12/06OPLAB, Dept. of IM, NTU1 Optimizing the ARQ Performance in Downlink Packet Data Systems With Scheduling Haitao Zheng, Member, IEEE Harish Viswanathan,
Coding and Error Control
Turbo Codes Azmat Ali Pasha.
Modeling OFDM Radio Channel Sachin Adlakha EE206A Spring 2001.
Lecture 9-10: Error Detection and Correction Anders Västberg Slides are a selection from the slides from chapter 8 from:
IEEE OFDMA PHY Wen-bin Lin
William Stallings Data and Computer Communications 7 th Edition (Selected slides used for lectures at Bina Nusantara University) Error Control.
HKUST Combined Cross-Layer Design and HARQ for TDD Multiuser systems with Outdated CSIT Rui Wang & Vincent K. N. Lau Dept. of ECE The Hong Kong University.
Improving the Performance of Turbo Codes by Repetition and Puncturing Youhan Kim March 4, 2005.
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.
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.
Copyright 2003 Improving Uplink Performance by Macrodiversity Combining Packets from Adjacent Access Points Matthew C. Valenti Assistant Professor Lane.
Channel Coding and Error Control
Coded Transmit Macrodiversity: Block Space-Time Codes over Distributed Antennas Yipeng Tang and Matthew Valenti Lane Dept. of Comp. Sci. & Elect. Engg.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 4 Channel Coding.
Lecture 10: Error Control Coding I Chapter 8 – Coding and Error Control From: Wireless Communications and Networks by William Stallings, Prentice Hall,
Enhancing Bluetooth TCP Throughput via Packet Type Adaptation Ling-Jyh Chen, Rohit Kapoor, M. Y. Sanadidi, Mario Gerla Dept. of Computer Science, UCLA.
Copyright 2005 Macrodiversity Packet Combining for the IEEE a Uplink Shi Cheng and Matthew C. Valenti Lane Dept. of Comp. Sci. & Elect. Eng. West.
Copyright 2002 Custom Coding, Adaptive Rate Control, and Distributed Detection for Bluetooth Matthew C. Valenti Assistant Professor Lane Dept. of Comp.
Wireless Mobile Communication and Transmission Lab. Chapter 8 Application of Error Control Coding.
Copyright 2002 An Analog Turbo Decoder for an (8,4) Product Code Matthew C. Valenti Assistant Professor Lane Dept. of Comp. Sci. & Elect. Eng. West Virginia.
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.
Lecture 3-2: Coding and Error Control (Cont.) ECE
A Novel technique for Improving the Performance of Turbo Codes using Orthogonal signalling, Repetition and Puncturing by Narushan Pillay Supervisor: Prof.
Wireless Mobile Communication and Transmission Lab. Theory and Technology of Error Control Coding Chapter 5 Turbo Code.
COSC 3213: Computer Networks I Instructor: Dr. Amir Asif Department of Computer Science York University Section M Topics: 1. Error Detection Techniques:
1 Chapter 8. Coding and Error Control Wen-Shyang Hwang KUAS EE.
1 WP2.3 “Radio Interface and Baseband Signal Processing” Content of D15 and Outline of D18 CAPANINA Neuchatel Meeting October 28th, 2005 – Marina Mondin.
Coding Theory. 2 Communication System Channel encoder Source encoder Modulator Demodulator Channel Voice Image Data CRC encoder Interleaver Deinterleaver.
Data Link and Flow Control Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific.
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
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.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 9.
Tufts University. EE194-WIR Wireless Sensor Networks. February 17, 2005 Increased QoS through a Degraded Channel using a Cross-Layered HARQ Protocol Elliot.
An ARQ Technique Using Related Parallel and Serial Concatenated Convolutional Codes Yufei Wu formerly with: Mobile and Portable Radio Research Group Virginia.
Minufiya University Faculty of Electronic Engineering Dep. of Electronic and Communication Eng. 4’th Year Information Theory and Coding Lecture on: Performance.
Copyright 2003 Exploiting Macrodiversity in Dense Multihop Networks and Relay Channels Matthew C. Valenti Assistant Professor Lane Dept. of Comp. Sci.
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.
Cooperative Diversity Using Distributed Turbo Codes Bin Zhao and Matthew C. Valenti Lane Dept. of Comp. Sci. & Elect. Eng. West Virginia.
Channel Capacity. Techniques to reduce errors in digital communication systems Automatic repeat request (ARC) Forward error correction (FEC) Channel.
A Bandwidth Efficient Pilot Symbol Technique for Coherent Detection of Turbo Codes over Fading Channels Matthew C. Valenti Dept. of Comp. Sci. & Elect.
The Softest Handoff Design Using Iterative Decoding (Turbo Coding) Byung K. Yi LGIC 3GPP2 TSG-C WG 3 Physical Layer Jan. 11, 2000.
COSC 3213: Computer Networks I Instructor: Dr. Amir Asif Department of Computer Science York University Section M Topics: 1.Flow Control and ARQ Protocols.
CSCI 465 D ata Communications and Networks Lecture 11 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Chapter Nine: Data Transmission. Introduction Binary data is transmitted by either by serial or parallel methods Data transmission over long distances.
Digital Communications Chapter 6. Channel Coding: Part 1
Powerpoint Templates Data Communication Muhammad Waseem Iqbal Lec # 15.
Results and Conclusions
Coding and Error Control
Lecture 4 Error Detecting and Correcting Techniques Dr. Ghalib A. Shah
Data Link Layer Flow Control.
Bridging the Gap Between Parallel and Serial Concatenated Codes
An Efficient Software Radio Implementation of the UMTS Turbo Codec
Shi Cheng and Matthew C. Valenti Lane Dept. of CSEE
Bin Zhao, Ph.D. student Matthew Valenti, Assistant Professor
Chapter 6.
Chapter Nine: Data Transmission
Chapter 10: Error-Control Coding
Coding and Error Control
Presentation transcript:

Matthew C. Valenti (presenter) Hybrid ARQ using Serial Concatenated Convolutional Codes over Fading Channels Naveen Chandran Graduate Research Assistant Lane Dept. of Comp. Sci. & Elect. Engg. West Virginia University Matthew C. Valenti (presenter) Assistant Professor mvalenti@wvu.edu

Overview FEC, ARQ, hybrid ARQ and retransmission strategies. Concatenated Convolutional Codes. “Turbo codes” Parallel (PCCC) vs. serial (SCCC) concatenations. Survey of hybrid ARQ techniques using turbo codes. Turbo Coding-ARQ System Model and process chart. Simulation parameters and assumptions. Throughput efficiency. Summary and future work.

FEC and ARQ FEC – Forward Error Correction Channel code used to only correct errors. ARQ – Automatic Repeat Request Channel code used to detect errors. A feedback channel is present If no detected errors, an acknowledgement (ACK) is sent back to transmitter. If there are detected errors, a negative acknowledgement (NACK) is sent back. Retransmission if NACK or no ACK. Several retransmission strategies: Stop and wait, go-back-N, selective repeat, etc. Selective repeat has better throughout performance than the others in the presence of propagation delays. However, throughput of stop and wait and selective repeat protocols are the same if no transmission delay is assumed.

Hybrid FEC/ARQ Combines forward error correction with ARQ. Assumption: Availability of a noise free feedback channel Uses an outer error detecting code in conjunction with an inner error correcting code The receiver first tries to correct as many errors as possible using the inner code. If there are any remaining errors, the outer code will (usually) detect them. Retransmission requested if the outer code detects an error.

Retransmission Strategies Two generic types of hybrid FEC/ARQ. Type I hybrid ARQ: Discard erroneous received code word. Retransmit until packet correctly received or until pre-set number of retransmissions is achieved. Small buffer size required but an inefficient scheme. Type II hybrid ARQ: Store erroneous received code word. Optimally combine with retransmitted code word. Exploit incremental redundancy concept Effective Code rate is gradually lowered until packet is decoded correctly. System adapts to varying channel conditions. Larger buffer size required than Type-I but is a very efficient scheme.

Turbo Codes Key features: Concatenated Convolutional Codes. PCCC: Parallel Concatenated Convolutional Codes. SCCC: Serial Concatenated Convolutional Codes. Nonuniform interleaving. Recursive systematic encoding. RSC: Recursive Systematic Convolutional Codes. For PCCC both encoders are RSC. For SCCC at least the inner encoder is RSC. Iterative decoding algorithm. MAP/APP based. Log-MAP: In logarithmic domain.

PCCC’s Features of parallel concatenated convolutional codes (PCCC’s): Both encoders are RSC. Performance close to capacity limit for BER down to about 10-5 or 10-6 (i.e. in the cliff region). BER flooring effect at high SNR. Input RSC Encoder #1 Systematic Output Parity Output RSC Encoder #2 Nonuniform Interleaver

SCCC’s Features of serially concatenated convolutional codes (SCCC’s): Inner encoder must be recursive. Outer encoder can be recursive or nonrecursive. Performance not as good as PCCC’s at low SNR. However, performance is better than PCCC’s at high SNR because the BER floor is much lower. Input Output Outer Encoder Nonuniform Interleaver Inner Encoder

Turbo Codes and Hybrid ARQ Turbo codes have been applied to hybrid ARQ. Narayanan and Stüber Interleave the input to the turbo encoder with a different interleaving function for each retransmission. Use log-likelihood ratios from last transmission. Rowitch and Milstein. Rate-compatible punctured turbo (RCPT) codes. Buckley and Wicker Use cross-entropy instead of a CRC to detect errors. Error detection threshold adaptively determined with a neural network. All the above use PCCC’s. Wu & Valenti (ICC 2000) had PCCC/SCCC approach.

Turbo Coding-ARQ System Model uk Turbo Encoder Puncture & Buffer Channel Inter- leaver BPSK Modul- ator yk ak ACK NACK Feedback for Type II Hybrid ARQ nk Channel De-Inter- leaver Error Detection Turbo Decoder rk ûk Channel Estimator

Coding-ARQ process chart Start with Maximum Code Rate Transmit code bits not previously sent PCCC / SCCC Error correction Reduce code rate to next lower rate NO Lowest Rate? YES Errors Still? Detect Errors after correction Go on to Next Data Frame YES NO

Simulation Parameters Input frame size N = 1024. Channel types: AWGN Fully-interleaved Rayleigh Fading Turbo Channel Code Parameters: PCCC and SCCC Each comprised of two identical RSC codes. Constraint Length K = 5. Generator Polynomials in octal: Feedback = 35. Feedforward = 23. Encoders terminated with a 4 bit tail. Decoder uses max-log-MAP algorithm.

Simulation Parameters contd. Puncturing: Period = 8. For PCCC, code rates range from 4/5 to 1/3. For SCCC Outer code rate = 2/3 (Puncturing parity bits alternatively). Inner code rate ranges from 1 to 1/2. Overall code rate ranges from 2/3 to 1/3. Channel Interleaver: Spread interleaver with S=18. Interleaver Sizes: PCCC – 1024. SCCC – 1544.

Simulation Assumptions Perfect channel estimates. Perfect error detection after turbo decoding. Noise free feedback channel from receiver to transmitter for ACK/NACK. No transmission delays. Stop and wait performs just as well as selective repeat protocol. SCCC puncturing patterns not optimized.

BER comparison: PCCC in AWGN Channel (N=1024)

BER comparison: PCCC in Fading Channel (N=1024)

BER comparison: SCCC in AWGN Channel (N=1024)

BER comparison: PCCC in Fading Channel (N=1024)

Throughput Efficiency Defined as expectation of the code rate as a function of frame error rate (FER) at a particular value of signal to noise ratio (Es / No). Mathematically defined as is a particular code rate and is the probability mass function of the rate.

Throughput Efficiency contd. Probability that the system is transmitting at a particular rate is the product of: Probability of frame errors at higher rates and Probability of success at current rate. Probability mass function is given by:

Throughput comparison AWGN Channel Fading Channel

Discussion In each case, the throughput of PCCC is better than SCCC. Why? For hybrid-ARQ, it’s the location of the “cliff” that matters, not the height of the floor. Thus, hybrid ARQ is not able to exploit the benefits of SCCC. However, the puncturing patterns were not optimized for SCCC. Systems that combine PCCC/SCCC appear to be promising.

Summary Conclusion Future Work Like PCCCs, SCCCs can be used as part of a type II hybrid FEC/ARQ scheme. SCCCs offer lower BER floors than PCCCs. But, this comes at the cost of the “cliff” occurring at higher SNR. Initial results show that since the cliff region is the predominant contributor towards throughput efficiency rather than the height of the BER floor, SCCCs have lower throughput efficiency than PCCCs. Future Work Optimize puncturing patterns for SCCC to reduce the gap between the throughput efficiencies of PCCC and SCCC. Exploit the fact that a PCCC code is a particular type of SCCC code. Promising results could be achieved by using hybrid PCCC/SCCC codes.

Table 1: Octal puncturing patterns for PCCC based systems with code polynomial g = (35,23), frame size N = 1024 and puncturing period P = 8.

Table 2: Octal puncturing patterns for SCCC based systems with code polynomial g = (35,23), frame size N = 1024 and puncturing period P = 8.