Adaptive RLL Constrained Coding Seong Taek Chung Dec. 17. 2000 Stanford University.

Slides:



Advertisements
Similar presentations
Jesper H. Sørensen, Toshiaki Koike-Akino, and Philip Orlik 2012 IEEE International Symposium on Information Theory Proceedings Rateless Feedback Codes.
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.
An Easy-to-Decode Network Coding Scheme for Wireless Broadcasting
Cyclic Code.
Capacity of Wireless Channels
Strider : Automatic Rate Adaptation & Collision Handling Aditya Gudipati & Sachin Katti Stanford University 1.
Cooperative Multiple Input Multiple Output Communication in Wireless Sensor Network: An Error Correcting Code approach using LDPC Code Goutham Kumar Kandukuri.
EE359 – Lecture 16 Outline MIMO Beamforming MIMO Diversity/Multiplexing Tradeoffs MIMO Receiver Design Maximum-Likelihood, Decision Feedback, Sphere Decoder.
Noise Cancelation for MIMO System Prepared by: Heba Hamad Rawia Zaid Rua Zaid Supervisor: Dr.Yousef Dama.
1 Wireless Communication Low Complexity Multiuser Detection Rami Abdallah University of Illinois at Urbana Champaign 12/06/2007.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Sang-Chun Han Hwangjun Song Jun Heo International Conference on Intelligent Hiding and Multimedia Signal Processing (IIH-MSP), Feb, /05 Feb 2009.
Turbo Codes – Decoding and Applications Bob Wall EE 548.
Fountain Codes Amin Shokrollahi EPFL and Digital Fountain, Inc.
4 currents 3 currents 8 signals Motor Pump Interior Electronics (Proposed) 72 bits Differential/Summing Amps 6 Total 12-bit A/D 6 Total Transmitter 6 signals.
ECE 776 Information Theory Capacity of Fading Channels with Channel Side Information Andrea J. Goldsmith and Pravin P. Varaiya, Professor Name: Dr. Osvaldo.
Constrained Codes for PRML Panu Chaichanavong December 14, 2000 Partial Response Channel Maximum Likelihood Detection Constraints for PRML Examples Conclusion.
Error Correcting Codes To detect and correct errors Adding redundancy to the original message Crucial when it’s impossible to resend the message (interplanetary.
Forward Error Correction. FEC Basic Idea Send redundant data Receiver uses it to detect/correct errors Reduces retransmissions/NAKs Useful when RTT is.
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
f has a saddle point at (1,1) 2.f has a local minimum at.
Channel Polarization and Polar Codes
L/O/G/O FOUR CHANNEL WIRELESS TRANSMITTER AND RECEIVER.
Institute for Experimental Mathematics Ellernstrasse Essen - Germany Data communication line codes and constrained sequences A.J. Han Vinck Revised.
Automatic Rate Adaptation Aditya Gudipati & Sachin Katti Stanford University 1.
Channel Capacity
1 UTILIZING CHANNEL CODING INFORMATION IN CIVA- BASED BLIND SEQUENCE DETECTORS Xiaohua(Edward) Li Department of Electrical and Computer Engineering State.
ECE 283 Digital Communication Systems Course Description –Digital modulation techniques. Coding theory. Transmission over bandwidth constrained channels.
Wireless Mobile Communication and Transmission Lab. Chapter 8 Application of Error Control Coding.
1 Adaptable applications Towards Balancing Network and Terminal Resources to Improve Video Quality D. Jarnikov.
Modified OSI Architecture for Low-Power Wireless Networks Jay Bruso Mike Matranga.
CprE 545 project proposal Long.  Introduction  Random linear code  LT-code  Application  Future work.
Rate-distortion Optimized Mode Selection Based on Multi-channel Realizations Markus Gärtner Davide Bertozzi Classroom Presentation 13 th March 2001.
A New Coding Mode for Error Resilient Video EE368C Final Presentation Stanford University Sangoh Jeong Mar.8, 2001.
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.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Coding Theory Efficient and Reliable Transfer of Information
Doc.: IEEE /133r0 Submission March 2003 Michael Park, Samsung Electronics co., LtdSlide 1 Project: IEEE P Working Group for Wireless Personal.
Superposition encoding A distorted version of is is encoded into the inner codebook Receiver 2 decodes using received signal and its side information Decoding.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Part 3: Channel Capacity
Channel Coding Binit Mohanty Ketan Rajawat. Recap…  Information is transmitted through channels (eg. Wires, optical fibres and even air)  Channels are.
Synchronization of Turbo Codes Based on Online Statistics
Rate-distortion Optimized Mode Selection Based on Multi-path Channel Simulation Markus Gärtner Davide Bertozzi Project Proposal Classroom Presentation.
Basic Concepts of Encoding Codes and Error Correction 1.
Error Detection and Correction
EE359 – Lecture 15 Outline Announcements: HW posted, due Friday MT exam grading done; l Can pick up from Julia or during TA discussion section tomorrow.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Sujan Rajbhandari LCS Convolutional Coded DPIM for Indoor Optical Wireless Links S. Rajbhandari, N. M. Aldibbiat and Z. Ghassemlooy Optical Communications.
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
The Finite-state channel was introduced as early as 1953 [McMillan'53]. Memory captured by channel state at end of previous symbol's transmission: - S.
1 Channel Equalization for STBC- Encoded Cooperative Transmissions with Asynchronous Transmitters Xiaohua (Edward) Li, Fan Ng, Juite Hwu, Mo Chen Department.
Reed-Solomon Codes in Slow Frequency Hop Spread Spectrum Andrew Bolstad Iowa State University Advisor: Dr. John J. Komo Clemson University.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Adaptive radio-frequency resource management for MIMO MC-CDMA on antenna selection Jingxu Han and Mqhele E Dlodlo Department of Electrical Engineering.
CDC Control over Wireless Communication Channel for Continuous-Time Systems C. D. Charalambous ECE Department University of Cyprus, Nicosia, Cyprus.
Joint Decoding on the OR Channel Communication System Laboratory UCLA Graduate School of Engineering - Electrical Engineering Program Communication Systems.
Spread spectrum modulation Chapter 9.
Locally Decodable Codes of fixed number of queries and Sub-exponential Length Article By Klim Efremenko Presented by Inon Peled 30 November 2008.
Communication Networks: Technology & Protocols
Error control coding for wireless communication technologies
Design of Multiple Antenna Coding Schemes with Channel Feedback
EE359 – Lecture 15 Outline Announcements: MIMO Channel Capacity
Concept of Power Control in Cellular Communication Channels
Maximum Likelihood Detection
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Yasunari MAEDA (Kitami Institute of Technology)
Distributed Compression For Binary Symetric Channels
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
Presentation transcript:

Adaptive RLL Constrained Coding Seong Taek Chung Dec Stanford University

Background Near Field in Infrared Wireless Channel decoding error, time synchronization error RLL (Run Length Limited) Constrained Coding : d : the minimum # of 0 between 1’s k : the maximum # of 0 between 1’s  the maximum # of 01’s or 10’s

Project Topic Current RLL (d,k |  ) : the same RLL code is used once the system is implemented. Proposed RLL (d,k |  ) : different RLL codes are used according to the status of infrared wireless channel.

Issues What to adapt ? d? k?  How to adapt?

What to adapt? Adaptation of d is sufficient !

How to adapt? Transmitter Encoding using RLL chosen at Receiver Receiver Choosing RLL based on infrared channel Feedback the decision on RLL

Performance Measure The capacity of adapted RLL : C 0 p 0 + C 1 p 1 C 0 : capacity when RLL (d=0) is used p 0 : probability that RLL (d=0) can support channel ( > 0) C 1 : capacity when RLL (d=1) is used p 1 : probability that only RLL (d=1) can support channel ( > 0)

Performance Measure The capacity of non-adaptive RLL : C 1 (p 1 + p 0 ) C 0 p 0 The performance improvement factor    capacity of adapted RLL) / max(capacity of non-adaptive RLL ) = (C 0 p 0 + C 1 p 1 ) / max(C 1 (p 1 + p 0 ), C 0 p 0 )

Result 35% improvement when p 0 = 0.65, p 1 =0.35 !

Conclusions For infrared wireless channel of our interests, adapting d is sufficient. Adaptive RLL constrained coding improves the capacity up to 35%.