Block code Encoder. In some applications, message bits come in serially rather than in large blocks. WY Tam - EIE POLYU
|
|
- Jordan Freeman
- 5 years ago
- Views:
Transcription
1 Convolutional Codes In block coding, the encoder accepts a k-bit message block and generates an n-bit code word. Thus, codewords are produced on a block-by-block basis. Buffering is needed. m 1 m 2 Block code c 1 c 2 Encoder m 2 m 1 c 2 c 1 In some applications, message bits come in serially rather than in large blocks. Conv.1 Convolutional Codes A convolutional encoder generates redundant bits by using modulo-2 convolutions. In a convolutional code, the block of n code digits generated by the encoder in a time unit depends not only the block of k message digit with that time unit, but also the preceding N-1 block of message digits. Usually the values of k and n are small. (the redundant bits are generated by using modulo-2 convolutions.) m 1 m 2 c 1 Convolutional c Encoder 1 c 2 m c 2 2 m 1 Conv.2
2 Code rate For a convolutional encoder with n modulo-adder and M Flip-flop, an L-bit message produces n ( L + M ) bits r = L n( L + M ) Input Flip-flop 1 Flip-flop M 1 n QL >> M Adder 1 Adder n Output Conv.3 Constraint length Constraint length K is the number of shifts over which a single message can influence the encoder output K = M + 1 Input Flip-flop 1 Flip-flop M Adder 1 Adder n Output Conv.4
3 Example For n=2, K=3 An bit message sequence produces a coded output sequence of 2(+2) bits. The code rate is Input r = 2( + 2) 20 = 1/ 2 Output Conv.5 Example A convolutional code with rate k/n can be implemented by using k separate shift register and n adders Example: Input An L-bit message produces 3(M/2+L/2) bits. Therefore, r = L 3(2 / 2 + L / 2) 2 3 Conv.6 Output
4 Impulse Response and Generator polynomial Impulse response response of a path to a symbol 1 applied to its input Example: Impulse response of path 1 is (1,1,1) Impulse response of path 2 is (1,0,1) Input Path 1 Path 2 Output Conv.7 Impulse Response and Generator polynomial The impulse response can be represented by a polynomial Example: (1,0,1,1) can be written as D + 1 D + 1 D = 1+ D + D Example: (1,1,1) can be written as g (1) (D)=1+D+D 2 (1,0,1) can be written as g (2) (D)=1+D 2 Input 3 Path 1 Path 2 Output Conv.8
5 Impulse Response and Generator polynomial For the message sequence (0), we have m(d)=1+d 3 +D 4 As the convolution in the time domain is transformed into multiplication in D-domain The output of path 1 is c (1) (D)= g (1) (D) m(d)= (1+D+D 2 )(1+D 3 +D 4 ) = 1+D+D 2 +D 3 +D 6 = 1 Conv.9 Impulse Response and Generator polynomial The output of path 2 is c (2) (D)= g (2) (D) m(d)= (1+D 2 )(1+D 3 +D 4 ) = 1+D 2 +D 3 +D 4 +D 5 +D 6 = 1 Finally, multiplexing the two output sequence of path 1 (1) and path 2 (1) gives c = (,,,,,,) Note: for the shift register to be restored to its zero initial state, a terminating sequence of K-1=2 zeros is appended to the last input bit of the message. These zeros is called the tail of the message. Conv.
6 State diagram A Convolutional encoder can be specified by the state diagram. Example: (n=2,k=1,m=2) convolutional encoder The state of this encoder is the content of the 2-stage shift register. Input State: S 0 : S 1 : Path 2 S 2 : S 3 : Path 1 Output Example: Suppose input is 1 and the original state is S 1, the output would be and the new state become S 3 Conv. State diagram Original Input Output new State state S 0 0 S S S S S 2 1 S Input=1 3 1 Input=0 State diagram S 1 Conv.12
7 Trellis diagram To show the time evolution of the coded sequence, a trellis diagram is used. Trellis diagram is obtained directly from the state diagram by including, from left-to-right, the dimension of time S 0 S 0 Input=1 Output= S 1 S 0 S 1 S 2 S 0 S 1 S 2 S 3 S 3 S2 Input=1 Input=0 S 0 S 3 Conv.13 S 1 Decoding m Channel c r c' m' Encoder noise Channel Decoder Since there is a one-to-one corresponding between m and c, m ' = m if and only if c' = c To reducing the probability of decoding error, the maximum-likelihood principle is used to decode the received sequence r into a code sequence c which maximizes the likelihood function p(r c) or log[p(r c)]. known Unknown Conv.14
8 Maximum-likelihood Decoding Assume that a codeword c=(c 0,c 1,,c N ) is transmitted through a binary symmetric channel and the received sequence is r = (r 0,r 1,,r N ) N P( r c) = Π i 0 log P( r c) = p( r c ) i N i 0 i log p( r c ) i i Maximum-likelihood decoding is obtained by choosing the nearest codeword to the received sequence in Hamming distance which maximum the likelihood function. 1 p 1 p 1 p 0 1 p 0 Qlog( AB) = log A + log B Conv.15 Maximum-likelihood Decoding Assume d(r,c)=d, the likelihood function becomes N log P( r c) = log p( ri ci ) i 0 = d log p + ( N d)log(1 = d log 1 p p + N log(1 As Nlog(1-p) is a constant for all c and p<1/2 in practice, the maximum-likelihood decding rule become choose the estimate c that minimizes the Hamming distance between the r and c p) p) 1 p 1 p 1 p 0 1 p 0 p log < 1 1 p Conv.16
9 Viterbi algorithm To decode the received sequence r, it is compared with each possible transmitted code vector c, and the particular one closest to r is chosen as the correct transmitted code vector. Min{d(r,c)} for all possible c Viterbi decoder The Viterbi decoder chooses that path through the trellis of the code which has a minimum Hamming distance from the received sequence. d ( r, c) = d( r i, c i ) i Conv.17 Example Suppose m=1 then c = (,,,,,,) Input r = (,,,,,,) Path 1 Path 2 Output Time Received Trellis diagram d s m 0 word Estimated message S S1 0 1 d( r i, c i ) Initial state must be i= 0 Two possible paths from S0 1 Conv.18
10 Example r = (,,,,,,) Time Received Trellis diagram d s m word 1 S 0 3 S1 3 S2 0 S3 2 d s =5 2 S d s =1 S1 1 1 S2 4 0 S3 2 1 S2 S 0 S 3 Conv.19 S 1 Finally, we have Example r = (,,,,,,) S 0 S1 S2 S2 S 0 S 3 S 1 S3 c =(,,,,,,) m =(0) 13 i= 0 d( r i, c i ) = 1 Conv.20
11 Error Probability m Channel Encoder c noise r Error Correction c' Decoder m' P Block probability of a transmitted codeword does not correspond to the decoded codeword = P( c' c) P Block P Bit probability of a transmitted information bit is incorrect P Bit = P( m' m) Conv.21 Error Probability Consider a Binary Symmetric Channel (BSC) 1 p 1 p 1 p 1 p 0 0 Probability of t errors occur during transmission of a binary codeword consisting of n bits is n t n t n n! p( t) = p (1 p) where = t t (n-t)!t! Example: n = 3, t = 1, the patterns for sending 1 are 0, 1, ! = = 3 1 1!(3-1)! Conv.22
12 If e = ( d min 1) / 2, P Block = n j= e+ 1 = 1 j= 0 Error Probability n j p (1 p) j e n j p (1 p) j n j n j Conv.23 Example Repetition code of length n = 3. a linear block code with k = 1 and n = 3. Codewords are 0 and 1. d min = 3 Correction capability: ( d min 1) / 2 = 1 j j n j PBlock = 1 Cn p (1 p) j= 0 = 1 p 0 (1 p) If p = 0., P Block = (P Bit = P block ) 97% of error are corrected. Error rate has been reduced by 34 times p(1 p) 2 Conv.24
13 Applications of Channel coding: LBC Linear Block Code Hamming code have been used in error control of computer memories and long-distance telephony. Example: In ECC memory, 64 bits data are stored in 72 bit physical memory. Can correct 1 error bit and detect 2 error bits Conv.25 Applications of Channel coding: CRC 16 bit CRC-ITU CRC codes are used to perform error detection in almost all modern communication systems. Example: detecting errors at the data-link layer and the transport layer of the Open Systems Interconnection (OSI) reference model 16 bit CRC-ITU was recommended by ITU (International Telecommunication Union) for many applications. Example: Communication protocols: XYModem, Zmodem Kermit file-transfer protocols (FTPs) X.25 for packet communication Conv.26
14 Applications of Channel coding: CRC In these applications, data-resending approach (ARQ - automatic repeat request) is the simplest way to correct transmission errors. Error detection only Long CRCs are more effective than short ones at detecting errors, but also introduce more overhead redundancy and implementation complexity. Conv.27 Applications of Channel coding: CRC 8 bit CRC-ATM ATM (Asynchronous Transfer Mode) is a high-bandwidth, low-delay switching and multiplexing technology for both public and private communication networks Aimed at users of high-speed data, local-area network interconnections, imaging and multimedia applications. Five layers: service layer adaptation layer ATM layer convergence layer physical layer Conv.28
15 Applications of Channel coding: CRC Employed in the adaptation layer of the ATM (Asynchronous Transfer Mode) protocol 8 g( X ) = X CRC-12 Used when the character length is 6 bits g( X ) = X + 1 CRC-16 Used for 8-bit characters g( X ) = X Conv.29 Applications of Channel coding: CRC CRC-32 IBM Token-ring IBM PC Network CSMA/CD Ethernet LANs g( X ) = X Conv.30
16 Application of Channel Coding: BCH codes (5,493) BCH code ITU-T Recommendation H.261 Video codec for audiovisual services at p x 64 kbit/s video coding standard used for video conferencing and videophone g( X ) = X 18 + X 15 + X 12 + X + X 8 + X 7 + X 6 + X (40,32) BCH code used in the ATM (Asynchronous Transfer Mode ) layer of ATM Conv.31 Application of Channel Coding: RS codes RS (255,233) recommended by Consultative Committee for Space Data Systems (CCSDS) for communication channel coding standard for spacecraft Examples Mars Observer launched in 1992 and arrived Mars in 1993 Pathfinder lander launched in 1996 and arrived Mars in 1997 Cassini launched in 1997 and to arrive Saturn in 24 Conv.32
17 Application of Channel Coding: RS codes Compact Disc (CD) Source of errors dust, fingerprints and scratches on the disc surface roughness The CD error-control system is designed to handle bursts by means of Interleaving and the RS codes (Cross Interleaved RS code) 1.41Mbps RS1 Interleaver RS2 1.88Mbps RS1: RS (28,24) RS2: RS (32,28) Also used for the CD-ROM, CD-I, and the MiniDisc Conv.33 Application of Channel Coding: RS codes Digital-Video-Disk (DVD) Increased physical density implies that physical imperfections affect proportionally more bits DVD is a true multimedia disc Therefore, a more powerful error-correction code is needed. RS1: RS (208,192) RS2: RS (182,172) Maximum correctable-burst length: CD: 5 bytes (2.4mm) DVD: 22 bytes (4.6mm) Conv.34
18 Application of Channel Coding: Convolutional codes Global System for Mobile communications (GSM) Speech coding in GSM Microphone Bandpass filter kHz Speech A/D Encoder f s =8kHz 13 bits 4kbps 13kbps Channel Encoder 22.8kbps Modulator Three classes of speech data bits: Class I - Class III Conv.35 Application of Channel Coding: Convolutional codes Step 1: Class I: block coded with a CRC code Class I Class II Class III 260bits 2ms Class I Class II Class III CRC bits (error detection) Class III 456bits Step 2: Class I and Class II: convolutional coded (r=1/2, K=5) Conv.36
19 Application of Channel Coding: Convolutional codes Data Channel in the GSM system Five different data channels in the GSM system Example: 9.6 kbps data transmission 9.6 kbps Coding in the terminal equipment (base station) 240 bits (=12 kbps) 4 0s to reset the encoder Convolutional code with r=1/2, K=5 488 bits Conv.37 Application of Channel Coding: Convolutional codes Singaling Channel in the GSM system Most important data in the network 184 bits Block code (Fire code) for detection and correction of burst error 184 bits 40 bits Convolutional code: r=1/2, K=5 456 bits 4 0s to reset the encoder Check bits Conv.38
20 Application of Channel Coding: Convolutional codes CDMA cellular systems CDMA: Code-division multiple access users in the CDMA-based cellular system are distinguished from each other by a code IS-95 (standard proposed by North America) PN code spread the spectrum of a radio which shares access in a system by the use of a particular high speed pseduorandom (PN) code. Conv.39 Application of Channel Coding: Convolutional codes If each radio has its own radio-specific PN code, then all radios, except the one it is desired to receive, look like noise to all other receivers in the system. Code 1 Base Station Desired receiver noise noise noise Conv.40
21 Application of Channel Coding: Convolutional codes Reverse Channel (mobile unit to base station) 4.4kbps Add 8 bit encoder tail 4.8kbps r=1/3, K=9 Convolutional Encoder 14.4kbps Symbol Repetition 28.8kbps 64-ary Interleaver Modulator 28.8kbps 4.8kbps PN chip: Mcps Conv.41
6. FUNDAMENTALS OF CHANNEL CODER
82 6. FUNDAMENTALS OF CHANNEL CODER 6.1 INTRODUCTION The digital information can be transmitted over the channel using different signaling schemes. The type of the signal scheme chosen mainly depends on
More informationOutline. Communications Engineering 1
Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband channels Signal space representation Optimal
More informationDetecting and Correcting Bit Errors. COS 463: Wireless Networks Lecture 8 Kyle Jamieson
Detecting and Correcting Bit Errors COS 463: Wireless Networks Lecture 8 Kyle Jamieson Bit errors on links Links in a network go through hostile environments Both wired, and wireless: Scattering Diffraction
More informationBasics of Error Correcting Codes
Basics of Error Correcting Codes Drawing from the book Information Theory, Inference, and Learning Algorithms Downloadable or purchasable: http://www.inference.phy.cam.ac.uk/mackay/itila/book.html CSE
More informationECE 476/ECE 501C/CS Wireless Communication Systems Winter Lecture 9: Error Control Coding
ECE 476/ECE 501C/CS 513 - Wireless Communication Systems Winter 2005 Lecture 9: Error Control Coding Chapter 8 Coding and Error Control From: Wireless Communications and Networks by William Stallings,
More informationECE 6640 Digital Communications
ECE 6640 Digital Communications Dr. Bradley J. Bazuin Assistant Professor Department of Electrical and Computer Engineering College of Engineering and Applied Sciences Chapter 8 8. Channel Coding: Part
More informationLecture 17 Components Principles of Error Control Borivoje Nikolic March 16, 2004.
EE29C - Spring 24 Advanced Topics in Circuit Design High-Speed Electrical Interfaces Lecture 17 Components Principles of Error Control Borivoje Nikolic March 16, 24. Announcements Project phase 1 is posted
More informationChannel Coding/Decoding. Hamming Method
Channel Coding/Decoding Hamming Method INFORMATION TRANSFER ACROSS CHANNELS Sent Received messages symbols messages source encoder Source coding Channel coding Channel Channel Source decoder decoding decoding
More informationDigital Communications I: Modulation and Coding Course. Term Catharina Logothetis Lecture 12
Digital Communications I: Modulation and Coding Course Term 3-8 Catharina Logothetis Lecture Last time, we talked about: How decoding is performed for Convolutional codes? What is a Maximum likelihood
More informationECE 6640 Digital Communications
ECE 6640 Digital Communications Dr. Bradley J. Bazuin Assistant Professor Department of Electrical and Computer Engineering College of Engineering and Applied Sciences Chapter 8 8. Channel Coding: Part
More informationRADIO SYSTEMS ETIN15. Channel Coding. Ove Edfors, Department of Electrical and Information Technology
RADIO SYSTEMS ETIN15 Lecture no: 7 Channel Coding Ove Edfors, Department of Electrical and Information Technology Ove.Edfors@eit.lth.se 2016-04-18 Ove Edfors - ETIN15 1 Contents (CHANNEL CODING) Overview
More informationSpreading Codes and Characteristics. Error Correction Codes
Spreading Codes and Characteristics and Error Correction Codes Global Navigational Satellite Systems (GNSS-6) Short course, NERTU Prasad Krishnan International Institute of Information Technology, Hyderabad
More informationChannel Coding RADIO SYSTEMS ETIN15. Lecture no: Ove Edfors, Department of Electrical and Information Technology
RADIO SYSTEMS ETIN15 Lecture no: 7 Channel Coding Ove Edfors, Department of Electrical and Information Technology Ove.Edfors@eit.lth.se 2012-04-23 Ove Edfors - ETIN15 1 Contents (CHANNEL CODING) Overview
More informationWireless Medium Access Control and CDMA-based Communication Lesson 14 CDMA2000
Wireless Medium Access Control and CDMA-based Communication Lesson 14 CDMA2000 1 CDMA2000 400 MHz, 800 MHz, 900 MHz, 1700 MHz, 1800 MHz, 1900 MHz, and 2100 MHz Compatible with the cdmaone standard A set
More informationLecture 4: Wireless Physical Layer: Channel Coding. Mythili Vutukuru CS 653 Spring 2014 Jan 16, Thursday
Lecture 4: Wireless Physical Layer: Channel Coding Mythili Vutukuru CS 653 Spring 2014 Jan 16, Thursday Channel Coding Modulated waveforms disrupted by signal propagation through wireless channel leads
More informationAN INTRODUCTION TO ERROR CORRECTING CODES Part 2
AN INTRODUCTION TO ERROR CORRECTING CODES Part Jack Keil Wolf ECE 54 C Spring BINARY CONVOLUTIONAL CODES A binary convolutional code is a set of infinite length binary sequences which satisfy a certain
More informationError Control Codes. Tarmo Anttalainen
Tarmo Anttalainen email: tarmo.anttalainen@evitech.fi.. Abstract: This paper gives a brief introduction to error control coding. It introduces bloc codes, convolutional codes and trellis coded modulation
More informationDepartment of Electronics and Communication Engineering 1
UNIT I SAMPLING AND QUANTIZATION Pulse Modulation 1. Explain in detail the generation of PWM and PPM signals (16) (M/J 2011) 2. Explain in detail the concept of PWM and PAM (16) (N/D 2012) 3. What is the
More informationError Control Coding. Aaron Gulliver Dept. of Electrical and Computer Engineering University of Victoria
Error Control Coding Aaron Gulliver Dept. of Electrical and Computer Engineering University of Victoria Topics Introduction The Channel Coding Problem Linear Block Codes Cyclic Codes BCH and Reed-Solomon
More informationData and Computer Communications
Data and Computer Communications Error Detection Mohamed Khedr http://webmail.aast.edu/~khedr Syllabus Tentatively Week 1 Week 2 Week 3 Week 4 Week 5 Week 6 Week 7 Week 8 Week 9 Week 10 Week 11 Week 12
More informationIntroduction to Error Control Coding
Introduction to Error Control Coding 1 Content 1. What Error Control Coding Is For 2. How Coding Can Be Achieved 3. Types of Coding 4. Types of Errors & Channels 5. Types of Codes 6. Types of Error Control
More informationPhysical Layer: Modulation, FEC. Wireless Networks: Guevara Noubir. S2001, COM3525 Wireless Networks Lecture 3, 1
Wireless Networks: Physical Layer: Modulation, FEC Guevara Noubir Noubir@ccsneuedu S, COM355 Wireless Networks Lecture 3, Lecture focus Modulation techniques Bit Error Rate Reducing the BER Forward Error
More informationTELE4652 Mobile and Satellite Communication Systems
TELE4652 Mobile and Satellite Communication Systems Lecture 10 IS-95 CDMA A second generation cellular standard, based on CDMA technology, was proposed by Qualcomm in the early 1990s. It was standardised
More informationChapter 1 Acknowledgment:
Chapter 1 Acknowledgment: This material is based on the slides formatted by Dr Sunilkumar S. Manvi and Dr Mahabaleshwar S. Kakkasageri, the authors of the textbook: Wireless and Mobile Networks, concepts
More informationImplementation of Different Interleaving Techniques for Performance Evaluation of CDMA System
Implementation of Different Interleaving Techniques for Performance Evaluation of CDMA System Anshu Aggarwal 1 and Vikas Mittal 2 1 Anshu Aggarwal is student of M.Tech. in the Department of Electronics
More informationA Survey of Advanced FEC Systems
A Survey of Advanced FEC Systems Eric Jacobsen Minister of Algorithms, Intel Labs Communication Technology Laboratory/ Radio Communications Laboratory July 29, 2004 With a lot of material from Bo Xia,
More informationRevision of Lecture Eleven
Revision of Lecture Eleven Previous lecture we have concentrated on carrier recovery for QAM, and modified early-late clock recovery for multilevel signalling as well as star 16QAM scheme Thus we have
More informationDigital Television Lecture 5
Digital Television Lecture 5 Forward Error Correction (FEC) Åbo Akademi University Domkyrkotorget 5 Åbo 8.4. Error Correction in Transmissions Need for error correction in transmissions Loss of data during
More information<3rd generation CDMA wireless systems>
Page 1 Overview What is 3G? A brief overview of IS95 Key design choices for CDMA 3G systems. Bandwidth Modulation Coding Power Control
More informationLecture 3 Data Link Layer - Digital Data Communication Techniques
DATA AND COMPUTER COMMUNICATIONS Lecture 3 Data Link Layer - Digital Data Communication Techniques Mei Yang Based on Lecture slides by William Stallings 1 ASYNCHRONOUS AND SYNCHRONOUS TRANSMISSION timing
More informationCHANNEL MEASUREMENT. Channel measurement doesn t help for single bit transmission in flat Rayleigh fading.
CHANNEL MEASUREMENT Channel measurement doesn t help for single bit transmission in flat Rayleigh fading. It helps (as we soon see) in detection with multi-tap fading, multiple frequencies, multiple antennas,
More informationIMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING.
IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING. COMPACT LECTURE NOTES on COMMUNICATION THEORY. Prof. Athanassios Manikas, version Spring 22 Digital
More informationEE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code. 1 Introduction. 2 Extended Hamming Code: Encoding. 1.
EE 435/535: Error Correcting Codes Project 1, Fall 2009: Extended Hamming Code Project #1 is due on Tuesday, October 6, 2009, in class. You may turn the project report in early. Late projects are accepted
More informationCommunications Theory and Engineering
Communications Theory and Engineering Master's Degree in Electronic Engineering Sapienza University of Rome A.A. 2018-2019 Channel Coding The channel encoder Source bits Channel encoder Coded bits Pulse
More informationAvailable online at ScienceDirect. Procedia Technology 17 (2014 )
Available online at www.sciencedirect.com ScienceDirect Procedia Technology 17 (2014 ) 107 113 Conference on Electronics, Telecommunications and Computers CETC 2013 Design of a Power Line Communications
More informationCH 5. Air Interface of the IS-95A CDMA System
CH 5. Air Interface of the IS-95A CDMA System 1 Contents Summary of IS-95A Physical Layer Parameters Forward Link Structure Pilot, Sync, Paging, and Traffic Channels Channel Coding, Interleaving, Data
More informationSingle Error Correcting Codes (SECC) 6.02 Spring 2011 Lecture #9. Checking the parity. Using the Syndrome to Correct Errors
Single Error Correcting Codes (SECC) Basic idea: Use multiple parity bits, each covering a subset of the data bits. No two message bits belong to exactly the same subsets, so a single error will generate
More informationCDMA Tutorial April 29, Michael Souryal April 29, 2006
Michael Souryal April 29, 2006 Common Components Encoding, modulation, spreading Common Features/Functionality Power control, diversity, soft handoff System Particulars cdmaone (IS-95) cdma2000 Sources:
More informationLayering and Controlling Errors
Layering and Controlling Errors Brad Karp (some slides contributed by Kyle Jamieson) UCL Computer Science CS 3035/GZ01 2 nd October 2014 Today s Agenda Layering Physical-layer encoding Link-layer framing
More informationDatacommunication I. Layers of the OSI-model. Lecture 3. signal encoding, error detection/correction
Datacommunication I Lecture 3 signal encoding, error detection/correction Layers of the OSI-model repetition 1 The OSI-model and its networking devices repetition The OSI-model and its networking devices
More informationDepartment of Computer Science and Engineering. CSE 3213: Computer Networks I (Fall 2009) Instructor: N. Vlajic Date: Dec 11, 2009.
Department of Computer Science and Engineering CSE 3213: Computer Networks I (Fall 2009) Instructor: N. Vlajic Date: Dec 11, 2009 Final Examination Instructions: Examination time: 180 min. Print your name
More informationEDI042 Error Control Coding (Kodningsteknik)
EDI042 Error Control Coding (Kodningsteknik) Chapter 1: Introduction Michael Lentmaier November 3, 2014 Michael Lentmaier, Fall 2014 EDI042 Error Control Coding: Chapter 1 1 / 26 Course overview I Lectures:
More informationComputer Networks. Week 03 Founda(on Communica(on Concepts. College of Information Science and Engineering Ritsumeikan University
Computer Networks Week 03 Founda(on Communica(on Concepts College of Information Science and Engineering Ritsumeikan University Agenda l Basic topics of electromagnetic signals: frequency, amplitude, degradation
More informationECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013
ECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013 Lecture 18 Today: (1) da Silva Discussion, (2) Error Correction Coding, (3) Error Detection (CRC) HW 8 due Tue. HW 9 (on Lectures
More informationMultiple Access Methods
Helsinki University of Technology S-72.333 Postgraduate Seminar on Radio Communications Multiple Access Methods Er Liu liuer@cc.hut.fi Communications Laboratory 16.11.2004 Content of presentation Protocol
More informationLecture 2. Mobile Evolution Introduction to Spread Spectrum Systems. COMM 907:Spread Spectrum Communications
COMM 907: Spread Spectrum Communications Lecture 2 Mobile Evolution Introduction to Spread Spectrum Systems Evolution of Mobile Telecommunications Evolution of Mobile Telecommunications Evolution of Mobile
More informationError Protection: Detection and Correction
Error Protection: Detection and Correction Communication channels are subject to noise. Noise distorts analog signals. Noise can cause digital signals to be received as different values. Bits can be flipped
More informationWireless Communications
3. Data Link Layer DIN/CTC/UEM 2018 Main Functions Handle transmission errors Adjust the data flow : Main Functions Split information into frames: Check if frames have arrived correctly Otherwise: Discard
More informationFront End To Back End VLSI Design For Convolution Encoder Pravin S. Tupkari Prof. A. S. Joshi
Front End To Back End VLSI Design For Convolution Encoder Pravin S. Tupkari Prof. A. S. Joshi Abstract For many digital communication system bandwidth and transmission power are limited resource and it
More informationBackground Dirty Paper Coding Codeword Binning Code construction Remaining problems. Information Hiding. Phil Regalia
Information Hiding Phil Regalia Department of Electrical Engineering and Computer Science Catholic University of America Washington, DC 20064 regalia@cua.edu Baltimore IEEE Signal Processing Society Chapter,
More informationThe ternary alphabet is used by alternate mark inversion modulation; successive ones in data are represented by alternating ±1.
Alphabets EE 387, Notes 2, Handout #3 Definition: An alphabet is a discrete (usually finite) set of symbols. Examples: B = {0,1} is the binary alphabet T = { 1,0,+1} is the ternary alphabet X = {00,01,...,FF}
More informationChapter 3 Convolutional Codes and Trellis Coded Modulation
Chapter 3 Convolutional Codes and Trellis Coded Modulation 3. Encoder Structure and Trellis Representation 3. Systematic Convolutional Codes 3.3 Viterbi Decoding Algorithm 3.4 BCJR Decoding Algorithm 3.5
More informationIntro to coding and convolutional codes
Intro to coding and convolutional codes Lecture 11 Vladimir Stojanović 6.973 Communication System Design Spring 2006 Massachusetts Institute of Technology 802.11a Convolutional Encoder Rate 1/2 convolutional
More informationDepartment of Computer Science and Engineering. CSE 3213: Communication Networks (Fall 2015) Instructor: N. Vlajic Date: Dec 13, 2015
Department of Computer Science and Engineering CSE 3213: Communication Networks (Fall 2015) Instructor: N. Vlajic Date: Dec 13, 2015 Final Examination Instructions: Examination time: 180 min. Print your
More informationPROJECT 5: DESIGNING A VOICE MODEM. Instructor: Amir Asif
PROJECT 5: DESIGNING A VOICE MODEM Instructor: Amir Asif CSE4214: Digital Communications (Fall 2012) Computer Science and Engineering, York University 1. PURPOSE In this laboratory project, you will design
More informationICE1495 Independent Study for Undergraduate Project (IUP) A. Lie Detector. Prof. : Hyunchul Park Student : Jonghun Park Due date : 06/04/04
ICE1495 Independent Study for Undergraduate Project (IUP) A Lie Detector Prof. : Hyunchul Park Student : 20020703 Jonghun Park Due date : 06/04/04 Contents ABSTRACT... 2 1. INTRODUCTION... 2 1.1 BASIC
More informationPerformance Evaluation of Error Correcting Techniques for OFDM Systems
Performance Evaluation of Error Correcting Techniques for OFDM Systems Yasir Javed Qazi Email: p060059@gmail.com Safwan Muhammad Email:safwan.mu11@gmail.com Jawad Ahmed Malik Email: reply.jawad@gmail.com
More informationMobile Communications TCS 455
Mobile Communications TCS 455 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 21 1 Office Hours: BKD 3601-7 Tuesday 14:00-16:00 Thursday 9:30-11:30 Announcements Read Chapter 9: 9.1 9.5 HW5 is posted.
More informationECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013
ECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013 Lecture 18 Today: (1) da Silva Discussion, (2) Error Correction Coding, (3) Error Detection (CRC) HW 8 due Tue. HW 9 (on Lectures
More informationPage 1. Outline. Basic Idea. Hamming Distance. Hamming Distance Visual: HD=2
Outline Basic Concepts Physical Redundancy Error Detecting/Correcting Codes Re-Execution Techniques Backward Error Recovery Techniques Basic Idea Start with k-bit data word Add r check bits Total = n-bit
More informationChapter 10 Error Detection and Correction 10.1
Data communication and networking fourth Edition by Behrouz A. Forouzan Chapter 10 Error Detection and Correction 10.1 Note Data can be corrupted during transmission. Some applications require that errors
More informationb. When transmitting a message through a transmission medium, the equipment which receives the message should first find out whether it has received
b. When transmitting a message through a transmission medium, the equipment which receives the message should first find out whether it has received the message correctly. If there is an error the receive
More informationCDMA Systems Engineering Handbook
CDMA Systems Engineering Handbook Jhong Sam Lee Leonard E. Miller Artech House Boston London Table of Contents Preface xix CHAPTER 1: INTRODUCTION AND REVIEW OF SYSTEMS ANALYSIS BASICS 1 1.1 Introduction
More information6.004 Computation Structures Spring 2009
MIT OpenCourseWare http://ocw.mit.edu 6.004 Computation Structures Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Welcome to 6.004! Course
More informationMultiplexing Module W.tra.2
Multiplexing Module W.tra.2 Dr.M.Y.Wu@CSE Shanghai Jiaotong University Shanghai, China Dr.W.Shu@ECE University of New Mexico Albuquerque, NM, USA 1 Multiplexing W.tra.2-2 Multiplexing shared medium at
More informationSignal Encoding Criteria
Signal Encoding Criteria What determines how successful a receiver will be in interpreting an incoming signal? Signal to noise ratio (or better E b /N 0 ) Data rate Bandwidth An increase in data rate increases
More informationCDMA Principle and Measurement
CDMA Principle and Measurement Concepts of CDMA CDMA Key Technologies CDMA Air Interface CDMA Measurement Basic Agilent Restricted Page 1 Cellular Access Methods Power Time Power Time FDMA Frequency Power
More informationCH 4. Air Interface of the IS-95A CDMA System
CH 4. Air Interface of the IS-95A CDMA System 1 Contents Summary of IS-95A Physical Layer Parameters Forward Link Structure Pilot, Sync, Paging, and Traffic Channels Channel Coding, Interleaving, Data
More informationError Detection and Correction
. Error Detection and Companies, 27 CHAPTER Error Detection and Networks must be able to transfer data from one device to another with acceptable accuracy. For most applications, a system must guarantee
More informationERROR CONTROL CODING From Theory to Practice
ERROR CONTROL CODING From Theory to Practice Peter Sweeney University of Surrey, Guildford, UK JOHN WILEY & SONS, LTD Contents 1 The Principles of Coding in Digital Communications 1.1 Error Control Schemes
More informationDownloaded from 1
VII SEMESTER FINAL EXAMINATION-2004 Attempt ALL questions. Q. [1] How does Digital communication System differ from Analog systems? Draw functional block diagram of DCS and explain the significance of
More informationLecture 12: Summary Advanced Digital Communications (EQ2410) 1
: Advanced Digital Communications (EQ2410) 1 Monday, Mar. 7, 2016 15:00-17:00, B23 1 Textbook: U. Madhow, Fundamentals of Digital Communications, 2008 1 / 15 Overview 1 2 3 4 2 / 15 Equalization Maximum
More informationDecoding of Block Turbo Codes
Decoding of Block Turbo Codes Mathematical Methods for Cryptography Dedicated to Celebrate Prof. Tor Helleseth s 70 th Birthday September 4-8, 2017 Kyeongcheol Yang Pohang University of Science and Technology
More informationChapter 14. Cellular Wireless Networks
Chapter 14 Cellular Wireless Networks Evolu&on of Wireless Communica&ons 1901 Marconi: Trans-Atlantic wireless transmission 1906 Fessenden: first radio broadcast (AM) 1921 Detroit Police Dept wireless
More informationText Book & Reference Book
Wireless Networks Text Book & Reference Book Text Book: Ad Hoc Wireless Networks Architectures and Protocols Authors: C. Siva Ram Murthy and B. S. Manoj Publisher: Prentice Hall 全華科技圖書代理 Reference Book:
More informationMobile Communication Systems. Part 7- Multiplexing
Mobile Communication Systems Part 7- Multiplexing Professor Z Ghassemlooy Faculty of Engineering and Environment University of Northumbria U.K. http://soe.ac.uk/ocr Contents Multiple Access Multiplexing
More informationIS-95 /CdmaOne Standard. By Mrs.M.R.Kuveskar.
IS-95 /CdmaOne Standard By Mrs.M.R.Kuveskar. CDMA Classification of CDMA Systems CDMA SYSTEMS CDMA one CDMA 2000 IS95 IS95B JSTD 008 Narrow Band Wide Band CDMA Multiple Access in CDMA: Each user is assigned
More informationSOME PHYSICAL LAYER ISSUES. Lecture Notes 2A
SOME PHYSICAL LAYER ISSUES Lecture Notes 2A Delays in networks Propagation time or propagation delay, t prop Time required for a signal or waveform to propagate (or move) from one point to another point.
More informationALi Linear n-stage t ShiftRegister output tsequence
PN CODE GENERATION (cont d) ALi Linear n-stage t ShiftRegister output tsequence Modulo-2 Adder h hn-1 h hn-2 h h2 h h1 X n-1 X n-2 X 1 X 0 Output Note: hi=1 represents a closed circuit; hi=0 represents
More informationAutomatic Speech Recognition (ASR) Over VoIP and Wireless Networks
Final Report of the UGC Sponsored Major Research Project on Automatic Speech Recognition (ASR) Over VoIP and Wireless Networks UGC Sanction Letter: 41-600/2012 (SR) Dated 18th July 2012 by Prof.P.Laxminarayana
More informationSimulink Modelling of Reed-Solomon (Rs) Code for Error Detection and Correction
Simulink Modelling of Reed-Solomon (Rs) Code for Error Detection and Correction Okeke. C Department of Electrical /Electronics Engineering, Michael Okpara University of Agriculture, Umudike, Abia State,
More informationCDMA Design Library September 2004
CDMA Design Library September 2004 Notice The information contained in this document is subject to change without notice. Agilent Technologies makes no warranty of any kind with regard to this material,
More informationMaximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm
Maximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm Presented to Dr. Tareq Al-Naffouri By Mohamed Samir Mazloum Omar Diaa Shawky Abstract Signaling schemes with memory
More informationImproved PHR coding of the MR-O-QPSK PHY
Improved PHR coding of the MR-O-QPSK PHY Michael Schmidt- ATMEL July 12, 2010 1/ 48 IEEE P802.15 Wireless Personal Area Networks Title: Improved PHR coding of the MR-O-QPSK PHY Date Submitted: July 12,
More informationComputer Science 1001.py. Lecture 25 : Intro to Error Correction and Detection Codes
Computer Science 1001.py Lecture 25 : Intro to Error Correction and Detection Codes Instructors: Daniel Deutch, Amiram Yehudai Teaching Assistants: Michal Kleinbort, Amir Rubinstein School of Computer
More informationHybrid ARQ Using Serially Concatenated Block Codes for Real-Time Communication - An Iterative Decoding Approach
Hybrid ARQ Using Serially Concatenated Block Codes for Real-Time Communication - An Iterative Decoding Approach ELISABETH UHLEMANN School of Information Science, Computer and Electrical Engineering, Halmstad
More informationNotes 15: Concatenated Codes, Turbo Codes and Iterative Processing
16.548 Notes 15: Concatenated Codes, Turbo Codes and Iterative Processing Outline! Introduction " Pushing the Bounds on Channel Capacity " Theory of Iterative Decoding " Recursive Convolutional Coding
More informationModule 3: Physical Layer
Module 3: Physical Layer Dr. Associate Professor of Computer Science Jackson State University Jackson, MS 39217 Phone: 601-979-3661 E-mail: natarajan.meghanathan@jsums.edu 1 Topics 3.1 Signal Levels: Baud
More informationIEEE C /02R1. IEEE Mobile Broadband Wireless Access <http://grouper.ieee.org/groups/802/mbwa>
23--29 IEEE C82.2-3/2R Project Title Date Submitted IEEE 82.2 Mobile Broadband Wireless Access Soft Iterative Decoding for Mobile Wireless Communications 23--29
More informationTABLE OF CONTENTS CHAPTER TITLE PAGE
TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK TABLE OF CONTENTS LIST OF TABLES LIST OF FIGURES LIST OF ABBREVIATIONS i i i i i iv v vi ix xi xiv 1 INTRODUCTION 1 1.1
More informationand coding (a.k.a. communication theory) Signals and functions Elementary operation of communication: send signal on
Fundamentals of information transmission and coding (a.k.a. communication theory) Signals and functions Elementary operation of communication: send signal on medium from point A to point B. media copper
More informationDigital Transmission using SECC Spring 2010 Lecture #7. (n,k,d) Systematic Block Codes. How many parity bits to use?
Digital Transmission using SECC 6.02 Spring 2010 Lecture #7 How many parity bits? Dealing with burst errors Reed-Solomon codes message Compute Checksum # message chk Partition Apply SECC Transmit errors
More informationCSC344 Wireless and Mobile Computing. Department of Computer Science COMSATS Institute of Information Technology
CSC344 Wireless and Mobile Computing Department of Computer Science COMSATS Institute of Information Technology Wireless Physical Layer Concepts Part II Electromagnetic Spectrum Frequency, Period, Phase
More informationEC6501 Digital Communication
EC6501 Digital Communication UNIT -1 DIGITAL COMMUNICATION SYSTEMS Digital Communication system 1) Write the advantages and disadvantages of digital communication. [A/M 11] The advantages of digital communication
More informationRep. ITU-R BO REPORT ITU-R BO SATELLITE-BROADCASTING SYSTEMS OF INTEGRATED SERVICES DIGITAL BROADCASTING
Rep. ITU-R BO.7- REPORT ITU-R BO.7- SATELLITE-BROADCASTING SYSTEMS OF INTEGRATED SERVICES DIGITAL BROADCASTING (Questions ITU-R 0/0 and ITU-R 0/) (990-994-998) Rep. ITU-R BO.7- Introduction The progress
More informationRECOMMENDATION ITU-R F ARRANGEMENT OF VOICE-FREQUENCY, FREQUENCY-SHIFT TELEGRAPH CHANNELS OVER HF RADIO CIRCUITS. (Question ITU-R 145/9)
Rec. ITU-R F.436-4 1 9E4: HF radiotelegraphy RECOMMENDATION ITU-R F.436-4 ARRANGEMENT OF VOICE-FREQUENCY, FREQUENCY-SHIFT TELEGRAPH CHANNELS OVER HF RADIO CIRCUITS (Question ITU-R 145/9) (1966-1970-1978-1994-1995)
More informationCSCD 433 Network Programming Fall Lecture 5 Physical Layer Continued
CSCD 433 Network Programming Fall 2016 Lecture 5 Physical Layer Continued 1 Topics Definitions Analog Transmission of Digital Data Digital Transmission of Analog Data Multiplexing 2 Different Types of
More informationTranscoding free voice transmission in GSM and UMTS networks
Transcoding free voice transmission in GSM and UMTS networks Sara Stančin, Grega Jakus, Sašo Tomažič University of Ljubljana, Faculty of Electrical Engineering Abstract - Transcoding refers to the conversion
More information6.02 Fall 2013 Lecture #7
6. Fall Lecture #7 Viterbi decoding of convoluonal codes 6. Fall Lecture 7, Slide # Convolutional Coding Shift Register View + mod p [n] x[n] x[n-] x[n-] The values in the registers define the state of
More informationEESS 501 REVISION HISTORY
Page i EESS 5 REVISION HISTORY Issue/Revision Revision Date Pages revised since the last version / 4 November 994 Original Issue 2/ 3 August 996 All 3/ March 24 All Page ii TABLE OF CONTENTS INTRODUCTION
More information