A Comparison of Cooperative Transmission Schemes for the Multiple Access Relay Channel

Similar documents
Half-Duplex Gaussian Relay Networks with Interference Processing Relays

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

Secrecy in the 2-User Symmetric Interference Channel with Transmitter Cooperation: Deterministic View

Cooperative HARQ with Poisson Interference and Opportunistic Routing

Synchronization in Physical- Layer Network Coding

Communication Theory II

R. A. Carrasco and M. Johnston, Non-Binary Error Control Coding Cork 2009

A Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying

One Lesson of Information Theory

Information Theory. Lecture 10. Network Information Theory (CT15); a focus on channel capacity results

Incremental Coding over MIMO Channels

arxiv:cs/ v1 [cs.it] 11 Sep 2006

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

L interférence dans les réseaux non filaires

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

2013/Fall-Winter Term Monday 12:50 Room# or 5F Meeting Room Instructor: Fire Tom Wada, Professor

Adaptive Bit-Interleaved Coded OFDM over Time-Varying Channels

Asymptotic Distortion Performance of Source-Channel Diversity Schemes over Relay Channels

THE EFFECT OF PUNCTURING ON THE CONVOLUTIONAL TURBO-CODES PERFORMANCES

Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems

Mapper & De-Mapper System Document

Multi-Input Multi-Output Systems (MIMO) Channel Model for MIMO MIMO Decoding MIMO Gains Multi-User MIMO Systems

Trust Degree Based Beamforming for Multi-Antenna Cooperative Communication Systems

Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

Stability Analysis in a Cognitive Radio System with Cooperative Beamforming

Error Correction Code (1)

Non-Linear Turbo Codes for Interleaver-Division Multiple Access on the OR Channel.

Phase Precoded Compute-and-Forward with Partial Feedback

Iterative Quantization. Using Codes On Graphs

LDPC Lattice Codes for Full-Duplex Relay. Channels

Cooperative Communication in Spatially Modulated MIMO systems

MegaMIMO: Scaling Wireless Throughput with the Number of Users. Hariharan Rahul, Swarun Kumar and Dina Katabi

Optimum Soft Decision Decoding of Linear Block Codes

NOMA: Principles and Recent Results

Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution 1 2

Chapter 7: Channel coding:convolutional codes

Channel Coding and Interleaving

Approximate capacity region of the two-pair bidirectional Gaussian relay network

II. THE TWO-WAY TWO-RELAY CHANNEL

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

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

New Puncturing Pattern for Bad Interleavers in Turbo-Codes

4 An Introduction to Channel Coding and Decoding over BSC

Turbo Compression. Andrej Rikovsky, Advisor: Pavol Hanus

Research on Unequal Error Protection with Punctured Turbo Codes in JPEG Image Transmission System

Approximately achieving the feedback interference channel capacity with point-to-point codes

Interleave Division Multiple Access. Li Ping, Department of Electronic Engineering City University of Hong Kong

Harnessing Interaction in Bursty Interference Networks

On the Use of Division Algebras for Wireless Communication

The Concept of Soft Channel Encoding and its Applications in Wireless Relay Networks

Impact of the Channel Time-selectivity on BER Performance of Broadband Analog Network Coding with Two-slot Channel Estimation


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

Physical-Layer MIMO Relaying

Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver

1 1 0, g Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g

ECE Information theory Final (Fall 2008)

Training-Symbol Embedded, High-Rate Complex Orthogonal Designs for Relay Networks

Physical Layer and Coding

Turbo Codes for Deep-Space Communications

New Coded Modulation for the Frequency Hoping OFDMA System.

Performance Analysis for Transmission of Correlated Sources over Non-Orthogonal MARCs

An Introduction to (Network) Coding Theory

Soft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antennas

Capacity of a Two-way Function Multicast Channel

Bit-wise Decomposition of M-ary Symbol Metric

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

Convolutional Codes Klaus von der Heide

Interactive Interference Alignment

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

Improved MU-MIMO Performance for Future Systems Using Differential Feedback

Asynchronous Physical-layer Network Coding

Secrecy Outage Performance of Cooperative Relay Network With Diversity Combining

Adaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems

Cooperative Diversity in CDMA over Nakagami m Fading Channels

EE 229B ERROR CONTROL CODING Spring 2005

Cooperative Transmission for Wireless Relay Networks Using Limited Feedback

Random Access Protocols for Massive MIMO

Estimation of the Capacity of Multipath Infrared Channels

Delay, feedback, and the price of ignorance

Comparison of Full-Duplex and Half-Duplex Modes with a Fixed Amplify-and-Forward Relay

Performance Analysis of BPSK over Joint Fading and Two-Path Shadowing Channels

Space-Time Coding for Multi-Antenna Systems

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

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

Interactions of Information Theory and Estimation in Single- and Multi-user Communications

Max-Min Relay Selection for Legacy Amplify-and-Forward Systems with Interference

A Systematic Approach for Interference Alignment in CSIT-less Relay-Aided X-Networks

Limited Feedback in Wireless Communication Systems

Computation Alignment: Capacity Approximation without Noise Accumulation

16.36 Communication Systems Engineering

Common Information of Random Linear Network Coding Over A 1-Hop Broadcast Packet Erasure Channel

Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

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

Symbol Interleaved Parallel Concatenated Trellis Coded Modulation

ECE Information theory Final

Algebraic Methods for Wireless Coding

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

Transcription:

A Comparison of Cooperative Transmission Schemes for the ultiple Access elay Channel André Angierski andre.angierski@uni-rostock.de 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI

Outline otivation System odel eference Scheme Cooperative Schemes esults Conclusion 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI

otivation Transmitting independent copies of the signal generates diversity and can effectively combat the deleterious effects of fading [Nosratinia, Hunter, Hedayat: Cooperative Communication in Wireless Networks ] Spatial diversity Several independent transmissions of same information User cooperation diversity Joint processing at relay and destination for different users Focus on transmission schemes and detection algorithms No focus on optimization of throughput or code rate 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI 3

The ultiple Access elay Channel (AC S i ultiple users, one relay and one destination D PS Constraints Two users Half-duple transmission without interference in TDA mode with three time slots Two fied positions for the relay close to close to S S i S D PSfrag D D S S 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI 4

Physical Layer Parameters ayleigh block fading (fading coefficient n = 4 y = a d = + n Gaussian noise Path-loss eponent Perfect channel state information for receiving devices a Bit-Interleaved Coded odulation (BIC and -QA ecursive systematic convolutional code with generator polynomials and code rate C = = Error free decoding at (5; 3 8 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI 5

Transmission Schemes First and second time slot: transmission with BIC forwards information from two users within third time slot S i! ; D! D eference scheme: Separate coding and transmission atching slot size by appropriate puncturing Cooperative schemes XO processing of information bits Superposition apping odulation Boost Joint coding and puncturing 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI 6

eference Scheme Institute of PSfrag repla C = Separate encoding and puncturing to at Sequential transmission Two independent parallel concatenated codes for and S S u S S c S S C S u C P C c u C P C c L ( c ^ S L a ( u ^ S C L ( u ^ S L a ( u ^ u S S c S S C S L ( u ^ C L ( c ^ 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI 7

Cooperative Scheme: XO Interpretation as lossy compression etrieving information requires direct links of appropriate quality PSfrag replacem u S c S S C S S L ( c ^ S L a ( u ^ S C L ( u ^ S u u c C u L ( c ^ L a ( u ^ C L ( u ^ L a ( u ^ S u S c S S C S S L ( u ^ S C L ( c ^ S 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI 8

Cooperative Schemes: Superposition apping Disjoint data processing at for both BIC streams Joint transmission by superposition of symbols Joint demapping for and y = + e j¼=4 p L ( c ^ L ( c ^ PSfrag u S S c S C S S L ( c ^ S L a ( u ^ S C L ( u ^ S u C c u C c L a ( u ^ u S c S S C S S L ( u ^ C L ( c ^ PSfrag 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI 9

Cooperative Schemes: odulation Boost Joint encoding at with doubled number of code bits compared to Increased number of bits per symbol at 4-QA ( 6-QA (, 6-QA ( 56-QA ( S i S i S i PSfrag r u S c S S C S S L ( c ^ S L a ( u ^ S C L ( u ^ S u u c C u L ( u ^ C L ( c ^ L a ( u ^ u S c S S C S S L ( c ^ S L a ( u ^ S C L ( u ^ S 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI 0

Cooperative Schemes: Joint Coding & Puncturing Joint encoding at ( Puncturing to code rate at with same number of code bits as for C = PSfrag replace S i u S S c S C S S L ( c ^ S L a ( u ^ S C L ( u ^ S u u c C P u C L ( u ^ C L ( c ^ L a ( u ^ u S S c S C S S L ( c ^ S L a ( u ^ S C L ( u ^ S 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI

BE Institute of esults: 4-QA 0 0 0-0 - 0-3 eference XO Superpos.apping 0-4 odulation Boost Joint Coding&Punc. close to S close to D 0-5 - 0-5 0 5 0 5 0 E b /N 0 [db] 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI

BE Institute of esults: 6-QA 0 0 0-0 - 0-3 eference XO Superpos.apping 0-4 odulation Boost Joint Coding&Punc. close to S close to D 0-5 - 0-5 0 5 0 5 0 E b /N 0 [db] 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI 3

Conclusions No diversity gain Gain due to cooperation Performance for XO dependent on quality of both direct paths Drawback for Superposition apping especially for modulation schemes of higher order Best results for odulation Boost and Joint Coding & Puncturing 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI 4

THANK YOU FO YOU ATTENTION! 0/03/7 UNIVESITY OF OSTOCK FACULTY OF COPUTE SCIENCE AND ELECTICAL ENGINEEING ANDÉ ANGIESKI 5