Progress Report for the UCLA OCDMA Project UCLA Graduate School of Engineering - Electrical Engineering Program Communication Systems Laboratory Miguel.

Slides:



Advertisements
Similar presentations
Convolutional Codes Representation and Encoding  Many known codes can be modified by an extra code symbol or by deleting a symbol * Can create codes of.
Advertisements

What is a good code? Ideal system
Information Theory EE322 Al-Sanie.
The Impact of Channel Estimation Errors on Space-Time Block Codes Presentation for Virginia Tech Symposium on Wireless Personal Communications M. C. Valenti.
Capacity of Wireless Channels
Enhancing Secrecy With Channel Knowledge
Mohammad Jaber Borran, Mahsa Memarzadeh, and Behnaam Aazhang June 29, 2001 Coded Modulation for Orthogonal Transmit Diversity.
Submission May, 2000 Doc: IEEE / 086 Steven Gray, Nokia Slide Brief Overview of Information Theory and Channel Coding Steven D. Gray 1.
Cellular Communications
Three Lessons Learned Never discard information prematurely Compression can be separated from channel transmission with no loss of optimality Gaussian.
UCLA Progress Report OCDMA Channel Coding Jun Shi Andres I. Vila Casado Miguel Griot Richard D. Wesel UCLA Electrical Engineering Department-Communication.
Progress report Miguel Griot Andres I. Vila Casado Wen-Yen Weng Richard Wesel UCLA Graduate School of Engineering - Electrical Engineering Program Communication.
OCDMA Channel Coding Progress Report
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 13.
Space Time Block Codes Poornima Nookala.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
1 Today, we are going to talk about: Shannon limit Comparison of different modulation schemes Trade-off between modulation and coding.
Improving the Performance of Turbo Codes by Repetition and Puncturing Youhan Kim March 4, 2005.
296.3Page :Algorithms in the Real World Convolutional Coding & Viterbi Decoding.
Analysis of Iterative Decoding
林茂昭 教授 台大電機系 個人專長 錯誤更正碼 數位通訊
INFORMATION THEORY BYK.SWARAJA ASSOCIATE PROFESSOR MREC.
Multilevel Coding and Iterative Multistage Decoding ELEC 599 Project Presentation Mohammad Jaber Borran Rice University April 21, 2000.
EE 3220: Digital Communication Dr Hassan Yousif1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
Channel Capacity
Extremal Problems of Information Combining Alexei Ashikhmin  Information Combining: formulation of the problem  Mutual Information Function for the Single.
Ali Al-Saihati ID# Ghassan Linjawi
A Novel technique for Improving the Performance of Turbo Codes using Orthogonal signalling, Repetition and Puncturing by Narushan Pillay Supervisor: Prof.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 12.
Communication System A communication system can be represented as in Figure. A message W, drawn from the index set {1, 2,..., M}, results in the signal.
Introduction of Low Density Parity Check Codes Mong-kai Ku.
Coding Theory. 2 Communication System Channel encoder Source encoder Modulator Demodulator Channel Voice Image Data CRC encoder Interleaver Deinterleaver.
Coded Modulation for Multiple Antennas over Fading Channels
University of Houston Cullen College of Engineering Electrical & Computer Engineering Capacity Scaling in MIMO Wireless System Under Correlated Fading.
1 Coded modulation So far: Binary coding Binary modulation Will send R bits/symbol (spectral efficiency = R) Constant transmission rate: Requires bandwidth.
Last time, we talked about:
1 Source Coding and Compression Dr.-Ing. Khaled Shawky Hassan Room: C3-222, ext: 1204, Lecture 10 Rate-Distortion.
Minufiya University Faculty of Electronic Engineering Dep. of Electronic and Communication Eng. 4’th Year Information Theory and Coding Lecture on: Performance.
Performance of Coherent M-ary Signaling ENSC 428 – Spring 2007.
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.
Forschungszentrum Telekommunikation Wien [Telecommunications Research Center Vienna] Göttfried Lächner, Ingmør Lønd, Jössy Säyir Optimization of LDPC codes.
Matthew Valenti West Virginia University
Uncoordinated Optical Multiple Access using IDMA and Nonlinear TCM PIs: Eli Yablanovitch, Rick Wesel, Ingrid Verbauwhede, Bahram Jalali, Ming Wu Students.
March 18, 2005 Network Coding in Interference Networks Brian Smith and Sriram Vishwanath University of Texas at Austin March 18 th, 2005 Conference on.
Non-Linear Codes for Asymmetric Channels, applied to Optical Channels Miguel Griot.
Information Theory & Coding for Digital Communications Prof JA Ritcey EE 417 Source; Anderson Digital Transmission Engineering 2005.
Block Coded Modulation Tareq Elhabbash, Yousef Yazji, Mahmoud Amassi.
Trellis-coded Unitary Space-Time Modulation for Multiple-Antenna Scheme under Rayleigh Flat Fading 指導教授 : 王 瑞 騰 老師 學生 : 吳委政.
Joint Decoding on the OR Channel Communication System Laboratory UCLA Graduate School of Engineering - Electrical Engineering Program Communication Systems.
© Tallal Elshabrawy Trellis Coded Modulation. © Tallal Elshabrawy Trellis Coded Modulation: Introduction Increases the constellation size compared to.
296.3:Algorithms in the Real World
Progress Report for the UCLA OCDMA Project
The Viterbi Decoding Algorithm
UCLA Progress Report OCDMA Channel Coding
Politecnico di Torino, Italia, 18th September 2009
Coding for Noncoherent M-ary Modulation
Shi Cheng and Matthew C. Valenti Lane Dept. of CSEE
Coding and Interleaving
Trellis Codes With Low Ones Density For The OR Multiple Access Channel
Interleaver-Division Multiple Access on the OR Channel
Independent Encoding for the Broadcast Channel
Uncoordinated Optical Multiple Access using IDMA and Nonlinear TCM
Chris Jones Cenk Kose Tao Tian Rick Wesel
II. Modulation & Coding.
EE 6332, Spring, 2017 Wireless Telecommunication
Miguel Griot, Andres I. Vila Casado, and Richard D. Wesel
Uncoordinated Optical Multiple Access using IDMA and Nonlinear TCM
Lihua Weng Dept. of EECS, Univ. of Michigan
Presentation transcript:

Progress Report for the UCLA OCDMA Project UCLA Graduate School of Engineering - Electrical Engineering Program Communication Systems Laboratory Miguel Griot Richard Wesel Andres Vila-Casado Bike Xie

Progress during this period Journal Paper Publications and Submissions. Conference Paper Submissions. Expanding into related problems: Broadcast Channels:. Bike Xie.

Journal Paper Publications/Submissions A Tighter Bhattacharyya Bound for Decoding Error Probability, M. Griot, W.Y. Weng, R.D. Wesel. IEEE Communications Letters, Apr Nonlinear Trellis Codes for Binary-Input Binary- Output Multiple Access Channels with Single-User Decoding, M.Griot, A.I. Vila Casado, R.D. Wesel. Submitted to IEEE Transactions in Communications, March 15. Nonlinear Turbo codes for the OR Multiple Access Channel and the AWGN Channel with High-Order Modulations, M. Griot, A.I. Vila Casado, R.D. Wesel. Soon to be submitted to TCOM. Bike Xie: working on journal paper on Broadcast Z Channels.

Conference Paper Submission/ Preparation On the Design of Arbitrarily Low-Rate Turbo Codes, M. Griot, A.I. Vila Casado, R.D. Wesel, submitted to GlobeCom Optimal Transmission Strategy and Capacity region for the Broadcast Z Channel, B. Xie, M. Griot, A.I. Vila Casado, R. Wesel. Accepted in Information Theory Workshop, Sep Nonlinear Turbo Codes for High-Order Modulations over the AWGN channel, M. Griot, R.D. Wesel. Soon to be submitted to Allerton Conference 2007.

Expanding into related areas An improvement in the Bhattacharya Bound A technique for handling the broadcast Z channel A new technique for turbo codes using higher order modulations

Parallel concatenated TCM for high-order modulations Miguel Griot Andres Vila Casado Richard Wesel

High-order modulations So far, for high-order modulations, a linear code with a bits-to-constellation point mapper has been used However, in some constellations (8PSK, APSK) the mapper must be nonlinear. Using a linear code + a mapper could be a limitation. CC Interleaver CC Mapper Trellis coded modulation

Structure of PC-TCM: Codeword : a set of constellation points. Rate : Using directly a TCM there could be a gain in performance. Parallel Concatenated TCM TCM Interleaver TCM

BER bounding for AWGN We have developed an extension of Benedetto’s uniform interleaver analysis for nonlinear code over any channel. Design Criteria: Maximize the effective free distance of each constituent code. Effective free distance: output distance (for AWGN squared euclidean distance) of any two possible codewords produced by data-words with Hamming distance equal to 2. We show that nonlinear code can increase the effective free distance of a constituent code.

8PSK, 16-state turbo code, rate 2 bits/symbol [1] Turbo-Encoder Design for Symbol-Interleaved Parallel Concatenated Trellis-Coded Modulation. C. Fragouli, R.D. Wesel, IEEE Trans. In Comm, March Linear [1]: Nonlinear: Constrained capacity 2.8dB

Design of Arbitrarily Low-Rate Turbo Codes. Miguel Griot Andres Vila Casado Richard Wesel

Low-rate turbo code, design criteria We can see the general structure of a rate 1/n constituent code as: Assuming that branches leaving a same state or merging to a same state are antipodal. Goals: Given certain values of n and m, maximize the minimum distance between output labels. This is equivalent to a (n,m- 1) code design. Given a certain m, choose the rate 1/n such that the performance is optimized in terms of BER vs. Eb/No.

Low-rate turbo code design over AWGN The performance of a code in terms of Eb/No is driven by the term: In our case, k = m-1 fixed. Hence, the objective is to maximize the term. Theorem 1: Theorem 2: BCH codes satisfy the upper bound with equality. A concatenation with a repetition code maintains the equality.

Optimal code is linear Optimal structure:

Results:

Optimal Transmission Strategy for the Broadcast Z Channel Bike Xie Miguel Griot Andres Vila Casado Richard Wesel

Broadcast Z Channel X Y1Y1 Y2Y X Y1Y1 Y2Y2 X2X2 The capacity region is the convex hull of the closure of all rate pairs (R1,R2) satisfying for some probabilities and

Optimal Transmission Strategy X Y1Y1 Y2Y2 X2X2 The optimal transmission strategy is proved to be The curve of the capacity region follows from with the optimal transmission strategy. X2X2 OR X1X1 X Y2Y2 N1N1 Y1Y1 N2N2

Communication System Encoder 2 Encoder 1 OR Decoder 1 Decoder 2 It is an independent encoding scheme. The one’s densities of X 1 and X 2 are p 1 and p 2 respectively. The broadcast signal X is the OR of X 1 and X 2. Nonlinear turbo codes that provide a controlled distribution of ones and zeros are used. User 2 with the worse channel decodes message W 2 directly. User 1 with the better channel has a successive decoding scheme.

Simulation Results The cross probabilities of the broadcast Z channel are The simulated rates are very close to the capacity region. Only 0.04 bits or less away from optimal rates in R1 Only 0.02 bits or less away from optimal rates in R 2

Future Work Gaussian channels with MPSK modulation: We have proved that the optimal surface of the capacity region can be achieved with independent encoding and group addition. Nonlinear turbo codes will also be used.