Design of a New Multiuser Line Code A. Al-Sammak* * EEE Department, U. of Bahrain, Isa Town, Bahrain R. L. Kirlin** # and P.F. Driessen** ** ECE Department,

Slides:



Advertisements
Similar presentations
Adders Used to perform addition, subtraction, multiplication, and division (sometimes) Half-adder adds rightmost (least significant) bit Full-adder.
Advertisements

What is a signal ? A function of one or more independent variables which contain some information. Voltage, Current ,temperature are all different signals.
Chapter Thirteen: Multiplexing and Multiple- Access Techniques.
Signal Encoding Techniques
and M-ary Quadrature Amplitude Modulation (M-QAM)
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Multiple Access Techniques for wireless communication
The Impact of Channel Estimation Errors on Space-Time Block Codes Presentation for Virginia Tech Symposium on Wireless Personal Communications M. C. Valenti.
Time division multiplexing TDM
Physical Layer – Part 2 Data Encoding Techniques
Computer Communication & Networks Lecture # 06 Physical Layer: Analog Transmission Nadeem Majeed Choudhary
Chapter 5 Analog Transmission.
4.2 Digital Transmission Pulse Modulation (Part 2.1)
Information Theory Introduction to Channel Coding Jalal Al Roumy.
Noise Cancelation for MIMO System Prepared by: Heba Hamad Rawia Zaid Rua Zaid Supervisor: Dr.Yousef Dama.
7C Cimini-9/97 RANDOM ACCESS TECHNIQUES ALOHA Efficiency Reservation Protocols Voice and Data Techniques - PRMA - Variable rate CDMA.
Information Theory Eighteenth Meeting. A Communication Model Messages are produced by a source transmitted over a channel to the destination. encoded.
Coded Modulation in Fading Channels Ryan Aures Matthew Holland ECE 492 Mobile Communications.
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.
EEE377 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.
Digital Communication Symbol Modulated Carrier RX Symbol Decision Binary Bytes D/A Recovered Analog Binary Bytes Symbol State Modulation A/D Analog Source.
A FREQUENCY HOPPING SPREAD SPECTRUM TRANSMISSION SCHEME FOR UNCOORDINATED COGNITIVE RADIOS Xiaohua (Edward) Li and Juite Hwu Department of Electrical and.
Formatting and Baseband Modulation
Review: The application layer. –Network Applications see the network as the abstract provided by the transport layer: Logical full mesh among network end-points.
Lecture 3-1: Coding and Error Control
Institute for Experimental Mathematics Ellernstrasse Essen - Germany DATA COMMUNICATION 2-dimensional transmission A.J. Han Vinck May 1, 2003.
Multiplexing.
Institute for Experimental Mathematics Ellernstrasse Essen - Germany Data communication line codes and constrained sequences A.J. Han Vinck Revised.
CHAPTER 6 PASS-BAND DATA TRANSMISSION
Automatic Rate Adaptation Aditya Gudipati & Sachin Katti Stanford University 1.
Multiplexing No. 1  Seattle Pacific University Multiplexing: Sharing a single medium between multiple users Kevin Bolding Electrical Engineering Seattle.
1 CSCD 433 Network Programming Fall 2013 Lecture 4 Physical Layer Line Coding Continued.
1 Time division multiplexing TDM m(t) TsTs 2T s 3T s 4T s 5T s 6T s 7T s.
LECC 2006, Valencia Potential Upgrade of the CMS Tracker Analog Readout Optical Links Using Bandwidth Efficient Digital Modulation Stefanos Dris Imperial.
Transmit Diversity with Channel Feedback Krishna K. Mukkavilli, Ashutosh Sabharwal, Michael Orchard and Behnaam Aazhang Department of Electrical and Computer.
1 CSCD 433 Network Programming Fall 2012 Lecture 5 Physical Layer Line Coding.
5: DataLink Layer5-1 Error Detection EDC= Error Detection and Correction bits (redundancy) D = Data protected by error checking, may include header fields.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
Coded Modulation for Multiple Antennas over Fading Channels
Data Communications, Kwangwoon University12-1 Chapter 12. Multiple Access 1.Random Access 2.Controlled Access 3.Channelization.
Chapter 4 Digital Transmission. 4.#2 4-1 DIGITAL-TO-DIGITAL CONVERSION line coding, block coding, and scrambling. Line coding is always needed; block.
Multiplexing. Multiplexing is the set of techniques that allows simultaneous transmission of multiple signals across a single link.
Basics Modulation Multiple Access
Chapter 4 part 2_a Digital Modulation Techniques.
4.2 Digital Transmission Pulse Modulation Pulse Code Modulation
Chapter : Digital Modulation 4.2 : Digital Transmission
A Simple Transmit Diversity Technique for Wireless Communications -M
4.2 Digital Transmission Pulse Modulation Pulse Code Modulation
Scheduling Considerations for Multi-User MIMO
Multiplexer (MUX) A multiplexer can use addressing bits to select one of several input bits to be the output. A selector chooses a single data input and.
Physical Layer (I) Data Encoding Techniques Advanced Computer Networks.
1 st semester 1436 / Modulation Continuous wave (CW) modulation AM Angle modulation FM PM Pulse Modulation Analog Pulse Modulation PAMPPMPDM Digital.
Introduction to Communication Lecture (07) 1. Bandwidth utilization Bandwidth utilization is the wise use of available bandwidth to achieve specific goals.
Space Time Codes.
Advanced Wireless Networks
TLEN 5830-AWL Advanced Wireless Lab
Analog to digital conversion
UNIT – III I: Digital Transmission.
Chapter 4: Digital Transmission
Physical Layer (Part 2) Data Encoding Techniques
Physical Layer – Part 2 Data Encoding Techniques
4.2 Digital Transmission Pulse Modulation (Part 2.1)
mEEC: A Novel Error Estimation Code with Multi-Dimensional Feature
Mainak Chowdhury, Andrea Goldsmith, Tsachy Weissman
Distributed Compression For Binary Symetric Channels
MIMO (Multiple Input Multiple Output)
STBC in Single Carrier(SC) for IEEE aj (45GHz)
(Digital Modulation Basics – part 2)
Analog Transmission Example 1
Multiplexing and Demultiplexing
Presentation transcript:

Design of a New Multiuser Line Code A. Al-Sammak* * EEE Department, U. of Bahrain, Isa Town, Bahrain R. L. Kirlin** # and P.F. Driessen** ** ECE Department, U. of Victoria, Victoria, B.C., Canada presented by R. L. Kirlin

Objectives n Find a code that allows multiple users to simultaneous access the same data channel n Maximize efficiency, trading off –number of users –number of symbols per user –number of bits per symbol n Compare to other schemes

Results n May use as a single user line code by partitioning data stream into “users’” symbols. n Produces higher rates than QAM and TDM because higher dimensional signal space is used n Up to 4.4 bits/baud for 22 users, 2 symbols/user, and 5 bits/symbol

Methodology n n Similar to collaborative coding multiple access (CCMA) techniques n n Permit simultaneous transmission by multiple users over a common binary adder channel or over a shared radio channel n n Combined users’ symbol codes must be uniquely decodeable

Example coding process 101 U = 3 users’ source symbols, M = 2 symbols/user, assigned to 2-bit words, m (only for cc) Lookup table combines m i 1 3 B = 2-time- slot data word V transmitted

What is the maximum number of users U each choosing from M symbols, that can use B bit transmission words? Alternately, given U users, what is the minimum number B of bits that is required. How do we decode the M user symbols associated with each V? Problems

Consider the U = 4-users, M = 2 symbols/users, B = 2-bits/symbol code. Needs only M U = 2 4 = 16 points from the N v = (U+1) B = 25 possible combinations V in the 2-dimensional space, i.e. from the grid of size (U+1) B = 5 2  25 points... EXAMPLE

t1t1 t2t2 U=4, All (U+1) B = 25 possible points t1t1 t2t2 U=4, M U = 16 points selected for transmission Example showing size and use of signal space; U = 4, M = 2, B = 2

We may use “QAM-like” constellations, as shown for the U = 4 users B = 2 time slots

Alternate constellation diagram for U=4, B=2, M = 2 symbols/user illustrating both direct transmit level coding and PAM transmission.

Table 1: Constellations for 4-user code Constellation user symbols Direct Tx Symmetric assignment u 1 u 2 u 3 u 4 levels PAM – – – – – – –

Implications The number of dimensions in the signal space is B.  The number of possible unique values (levels) of the sum vectors V is N Vmax = (U+1) B.  The maximum number of unique symbols available to all users is M max = 2 B.  The maximum number N w of symbol combinations is M max U. Because the actual number N w words used must be less than or equal to N Vmax, we have the constraint: N w = M U  N Vmax = (U+1) B

A most important point : We can use the constraint two ways: either 1) For fixed U and B we can select an M small enough that M U  (U+1) B or 2) F or a fixed M and U we may increase B so that M U  (U+1) B.

Information Rate is defined as R = log 2 M * (U/B) user information bits / time-slot Code Efficiency is defined as the symbol combinations used by the U users divided by the number of symbols available given B-bit symbols,  = M U /(U+1) B  1

Conclusions The code may be used as a single user line code by partitioning data stream into blocks of U “users’” symbols. U users’ simultaneous source symbols are encoded by lookup table according to the design, and decoded similarly. It produces higher bits/baud or bits/dimension than QAM and TDM because a higher dimensional signal space is used (B bits / symbol).

Maximum M, symbols/user and maximum number of users U, have been tabulated for most realistic cases when other parameters are fixed. Up to 4.4 bits/baud (bits/time slot) results with U = 22 users, M = 2 symbols/user, and B = 5 bits/symbol. Design objectives have been achieved