The ternary alphabet is used by alternate mark inversion modulation; successive ones in data are represented by alternating ±1.
|
|
- Milo Lambert
- 6 years ago
- Views:
Transcription
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} is the alphabet of 8-bit symbols (used in codes for compact discs, DVDs, and most hard disk drives) A channel alphabet symbol may be an indivisible transmission unit, e.g., one point from a signal constellation, or a sequence of modulation symbols encoded into a coding alphabet symbol The alphabets encountered in EE 387 usually have 2 m symbols. The ternary alphabet is used by alternate mark inversion modulation; successive ones in data are represented by alternating ±1. EE 387, September 23, 2015 Notes 2, Page 1
2 Block codes: definition The channel alphabet is the set of output symbols of the channel encoder same as set of input symbols to channel (modulator). The senseword alphabet is the set of output symbols from channel demodulator, i.e., input to channel decoder. The senseword alphabet may be larger than the channel alphabet, e.g., when the received symbols represent soft information. Examples: Binary erasure channel: input alphabet {0,1}, output alphabet {0,?,1}. Some disk drive read channel circuits quantize input signal to 6 bits; the channel alphabet has 64 symbols. Definition: A block code of blocklength n over an alphabet X is a nonempty set of n-tuples of symbols from X. C = {(c 11,...,c 1n ),...,(c M1,...,c Mn )} The n-tuples of the code are called codewords. We will think of codewords as vectors whose components are symbols in X. EE 387, September 23, 2015 Notes 2, Page 2
3 Block codes: rate Suppose that the channel alphabet has Q symbols. The rate of a block code of blocklengh n with M codewords is defined to be R = 1 n log QM. Codewords of length n are usually generated by encoding k information (data, message) symbols using an invertible encoding function. In this case, number of codewords is M = Q k. rate of code is R = 1 n log QQ k = 1 n k = k n. Such a code with blocklength n and rate k/n is called an (n,k) code. The rate is a dimensionless fraction (symbols per symbol). It is the fraction of transmitted symbols that carry information. EE 387, September 23, 2015 Notes 2, Page 3
4 Block codes: very simple examples C = { } = {SYN} Blocklength n = 8, M = 1, rate R = 1 8 log 21 = 0. Codes with rate 0 are called useless. This code could be used for error rate analysis or byte synchronization. C = {00,01,10,11} Blocklength n = 2, M = 4, rate R = 1 2 log 24 = 1. This code has no redundancy, so it can neither correct nor detect errors. C = {001,010,100} Blocklength n = 3, M = 3, rate R = 1 3 log 23 = This code might be used over a channel that drops bits (1 0 may occur but not 0 1), since any dropped 1 can be detected. C = {011,101,110} is a better code for this channel. Why? EE 387, September 23, 2015 Notes 2, Page 4
5 Block codes: more interesting examples Parity SIMMs have rate 8/9 and blocklength 9 or 36. They can detect one error per 8-bit byte. ECC DIMMs have blocklength 72 and rate 8/9. They can correct one error and detect two errors in 72 bits. Ethernet packet sizes range from 64 to 1518 bytes (12144 bits). Checksum is only 32 bits very high rate code for large packets. The number of binary 5-tuples of weight 2 or 3 (nearly DC balanced) is ( ) ( ) = = 20 > 16 = The 4B5B TAXI code for FDDI uses 16 of these 5-tuples to convey 4 bits of data information: {1E A 0B 0E 0F A 1B 1C 1D} (A few other 5-tuples are used for control purposes.) EE 387, September 23, 2015 Notes 2, Page 5
6 Hamming distance The Hamming distance d H between n-tuples is the number of components in which the n-tuples differ: { n 1 if xi y i d H (x,y) = d H (x i,y i ), where d H (x i,y i ) = 0 if x i = y i i=1 Hamming distance satisfies the axioms for a metric or distance measure: d(x,y) 0 with equality if and only if x = y (nonnegativity) d(x,y) = d(y,x) (symmetry) d(x,y) d(x,z)+d(z,y) (triangle inequality) Hamming distance is a coarse or pessimistic measure of difference. Other useful distances that occur in error control coding: Lee distance, distance on a circle, is applicable to phase shift coding. Euclidean distance is used with sensewords in R n. EE 387, September 23, 2015 Notes 2, Page 6
7 Minimum distance The minimum (Hamming) distance d of a block code is the distance between any two closest codewords: d = min{d H (c 1,c 2 ) : c 1,c 2 are codewords and c 1 c 2 } Obvious properties of minimum distance of a code of blocklength n: d 1 since Hamming distance between distinct codewords is a positive integer. d n if code has two or more codewords. d = n+1 or d = for the useless code with only one codeword. (This is a convention, not a theorem.) If C 1 C 2 then d (C 1 ) d (C 2 ) smaller codes have larger (or equal) minimum distance. The minimum distance of a code determines both its error-detecting ability and error-correcting ability. EE 387, September 23, 2015 Notes 2, Page 7
8 Error-detecting ability Suppose that a block code is used for error detection only. Let c be the transmitted codeword and let r the senseword the received n-tuple. If the r is not a codeword, a detectable error has occurred. If the r is a codeword but not the transmitted codeword, an error has occurred that cannot be detected. If d(c,r) < d, then the senseword cannot be an incorrect codeword. Otherwise c and r would be two codewords whose distance is less than the minimum distance. Conversely, let c 1,c 2 be two closest codewords. If c 1 is transmitted but c 2 is received, then an error of weight d has occurred that cannot be detected. Theorem: The guaranteed error-detecting ability is e = d 1. The error-detecting ability is a worst case measure of the code. Codes designed for error detection can detect the vast majority of errors when d or more symbols are incorrect. EE 387, September 23, 2015 Notes 2, Page 8
9 Error-correcting ability A block code is a set of M vectors in an n-dimensional space. The geometry of the space is defined by Hamming distance quite different from Euclidean geometry. Nonetheless, geometric intuition can be useful. d* decoding spheres decoding regiion The optimal decoding procedure is usually nearest-neighbor decoding: the senseword r is decoded to the nearest codeword ĉ: ĉ = argmin{d H (c,r) : c is a codeword} In R 2, decoding regions are Voronoi regions defined by perpendicular bisectors of lines connecting codewords. Hamming space is much more complicated combinatorial methods are needed. EE 387, September 23, 2015 Notes 2, Page 9
10 Error-correcting ability (cont.) Theorem: Using nearest-neighbor decoding, errors of weight t can be corrected if and only if 2t < d. Proof: The spheres of radius t surrounding the codewords do not overlap. Otherwise, there would be two codewords 2t distant. Therefore when t errors occur, the decoder can tell which codeword was sent. d* decoding spheres decoding regiion The maximal decoding region is usually larger than the decoding sphere. Most decoders correct only when senseword r belongs to a decoding sphere of radius t. They are called bounded-distance decoders. EE 387, September 23, 2015 Notes 2, Page 10
11 Decoding outcomes A block code can have more than one decoder, depending on the type of errors expected or observed the error rate the computational power available at the decoder Suppose that codeword c is transmitted, senseword r is received, and ĉ is the decoder s output. The table below classifies the outcomes. ĉ = c decoder success Successful correction (including no errors) ĉ =? decoder failure ĉ c decoder error Uncorrectable error detected, no decision (not too bad) Miscorrection (very bad) Important: the decoder cannot distinguish the outcome ĉ = c from ĉ c. However, it can assign probabilities to the possibilities; more bit errors corrected suggests a higher probability that the estimate is wrong. EE 387, September 23, 2015 Notes 2, Page 11
12 Decoding outcomes (cont.) The codeword transmitted and noise encountered are random variables, so the decoder outcomes are probabilistic events. r = c r c P e ĉ =? P ued ĉ c P mc ĉ c P ue No error Error occurred (error in codeword) Error detected but not corrected (decoder failure) Miscorrection (decoder error) Undetectable error (error detection only) Definition: A complete decoder is a decoder that decodes every senseword to some codeword; i.e., the decoder never fails (to make a hard decisions). For a complete decoder, Prued = 0. Definition: A bounded-distance decoder corrects all errors of weight t but no errors of weight > t. More than t errors results in failure or error. For a fixed code, if we reduce t then decoder failure becomes more common while decoder error becomes less likely. ued can be read as uncorrectable error detected, whereas ue is undetected error. EE 387, September 23, 2015 Notes 2, Page 12
Error 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 informationIntroduction to Coding Theory
Coding Theory Massoud Malek Introduction to Coding Theory Introduction. Coding theory originated with the advent of computers. Early computers were huge mechanical monsters whose reliability was low compared
More informationcode V(n,k) := words module
Basic Theory Distance Suppose that you knew that an English word was transmitted and you had received the word SHIP. If you suspected that some errors had occurred in transmission, it would be impossible
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 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 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 informationError Detection and Correction: Parity Check Code; Bounds Based on Hamming Distance
Error Detection and Correction: Parity Check Code; Bounds Based on Hamming Distance Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin
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 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 informationError Correction with Hamming Codes
Hamming Codes http://www2.rad.com/networks/1994/err_con/hamming.htm Error Correction with Hamming Codes Forward Error Correction (FEC), the ability of receiving station to correct a transmission error,
More informationComputing and Communications 2. Information Theory -Channel Capacity
1896 1920 1987 2006 Computing and Communications 2. Information Theory -Channel Capacity Ying Cui Department of Electronic Engineering Shanghai Jiao Tong University, China 2017, Autumn 1 Outline Communication
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 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 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 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 informationExercises to Chapter 2 solutions
Exercises to Chapter 2 solutions 1 Exercises to Chapter 2 solutions E2.1 The Manchester code was first used in Manchester Mark 1 computer at the University of Manchester in 1949 and is still used in low-speed
More informationThe idea of similarity is through the Hamming
Hamming distance A good channel code is designed so that, if a few bit errors occur in transmission, the output can still be identified as the correct input. This is possible because although incorrect,
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 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 informationLecture 9b Convolutional Coding/Decoding and Trellis Code modulation
Lecture 9b Convolutional Coding/Decoding and Trellis Code modulation Convolutional Coder Basics Coder State Diagram Encoder Trellis Coder Tree Viterbi Decoding For Simplicity assume Binary Sym.Channel
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 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 informationInformation Theory and Communication Optimal Codes
Information Theory and Communication Optimal Codes Ritwik Banerjee rbanerjee@cs.stonybrook.edu c Ritwik Banerjee Information Theory and Communication 1/1 Roadmap Examples and Types of Codes Kraft Inequality
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 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 informationError-Correcting Codes
Error-Correcting Codes Information is stored and exchanged in the form of streams of characters from some alphabet. An alphabet is a finite set of symbols, such as the lower-case Roman alphabet {a,b,c,,z}.
More informationCommunication Theory and Engineering
Communication Theory and Engineering Master's Degree in Electronic Engineering Sapienza University of Rome A.A. 208-209 Practice work 8 Soft vs. Hard decoding Hard vs. Soft decoding Hard decoding: the
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 informationIntroduction to Source Coding
Comm. 52: Communication Theory Lecture 7 Introduction to Source Coding - Requirements of source codes - Huffman Code Length Fixed Length Variable Length Source Code Properties Uniquely Decodable allow
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 informationBlock code Encoder. In some applications, message bits come in serially rather than in large blocks. WY Tam - EIE POLYU
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
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 informationTOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1
TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need
More informationInformation Theory and Huffman Coding
Information Theory and Huffman Coding Consider a typical Digital Communication System: A/D Conversion Sampling and Quantization D/A Conversion Source Encoder Source Decoder bit stream bit stream Channel
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 informationHamming Codes as Error-Reducing Codes
Hamming Codes as Error-Reducing Codes William Rurik Arya Mazumdar Abstract Hamming codes are the first nontrivial family of error-correcting codes that can correct one error in a block of binary symbols.
More information1 This work was partially supported by NSF Grant No. CCR , and by the URI International Engineering Program.
Combined Error Correcting and Compressing Codes Extended Summary Thomas Wenisch Peter F. Swaszek Augustus K. Uht 1 University of Rhode Island, Kingston RI Submitted to International Symposium on Information
More informationLab/Project Error Control Coding using LDPC Codes and HARQ
Linköping University Campus Norrköping Department of Science and Technology Erik Bergfeldt TNE066 Telecommunications Lab/Project Error Control Coding using LDPC Codes and HARQ Error control coding is an
More informationMATHEMATICS IN COMMUNICATIONS: INTRODUCTION TO CODING. A Public Lecture to the Uganda Mathematics Society
Abstract MATHEMATICS IN COMMUNICATIONS: INTRODUCTION TO CODING A Public Lecture to the Uganda Mathematics Society F F Tusubira, PhD, MUIPE, MIEE, REng, CEng Mathematical theory and techniques play a vital
More informationNonlinear Multi-Error Correction Codes for Reliable MLC NAND Flash Memories Zhen Wang, Mark Karpovsky, Fellow, IEEE, and Ajay Joshi, Member, IEEE
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 20, NO. 7, JULY 2012 1221 Nonlinear Multi-Error Correction Codes for Reliable MLC NAND Flash Memories Zhen Wang, Mark Karpovsky, Fellow,
More informationPerformance of Reed-Solomon Codes in AWGN Channel
International Journal of Electronics and Communication Engineering. ISSN 0974-2166 Volume 4, Number 3 (2011), pp. 259-266 International Research Publication House http://www.irphouse.com Performance of
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 informationComm. 502: Communication Theory. Lecture 6. - Introduction to Source Coding
Comm. 50: Communication Theory Lecture 6 - Introduction to Source Coding Digital Communication Systems Source of Information User of Information Source Encoder Source Decoder Channel Encoder Channel Decoder
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 informationFREDRIK TUFVESSON ELECTRICAL AND INFORMATION TECHNOLOGY
1 Information Transmission Chapter 5, Block codes FREDRIK TUFVESSON ELECTRICAL AND INFORMATION TECHNOLOGY 2 Methods of channel coding For channel coding (error correction) we have two main classes of codes,
More informationDigital Data Communication Techniques
Digital Data Communication Techniques Raj Jain Washington University Saint Louis, MO 63131 Jain@cse.wustl.edu These slides are available on-line at: http://www.cse.wustl.edu/~jain/cse473-05/ 6-1 Overview
More informationProblem Sheet 1 Probability, random processes, and noise
Problem Sheet 1 Probability, random processes, and noise 1. If F X (x) is the distribution function of a random variable X and x 1 x 2, show that F X (x 1 ) F X (x 2 ). 2. Use the definition of the cumulative
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 information# 12 ECE 253a Digital Image Processing Pamela Cosman 11/4/11. Introductory material for image compression
# 2 ECE 253a Digital Image Processing Pamela Cosman /4/ Introductory material for image compression Motivation: Low-resolution color image: 52 52 pixels/color, 24 bits/pixel 3/4 MB 3 2 pixels, 24 bits/pixel
More informationCommunication Theory II
Communication Theory II Lecture 13: Information Theory (cont d) Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt March 22 th, 2015 1 o Source Code Generation Lecture Outlines Source Coding
More information6.450: Principles of Digital Communication 1
6.450: Principles of Digital Communication 1 Digital Communication: Enormous and normally rapidly growing industry, roughly comparable in size to the computer industry. Objective: Study those aspects of
More informationLDPC Decoding: VLSI Architectures and Implementations
LDPC Decoding: VLSI Architectures and Implementations Module : LDPC Decoding Ned Varnica varnica@gmail.com Marvell Semiconductor Inc Overview Error Correction Codes (ECC) Intro to Low-density parity-check
More informationAHA Application Note. Primer: Reed-Solomon Error Correction Codes (ECC)
AHA Application Note Primer: Reed-Solomon Error Correction Codes (ECC) ANRS01_0404 Comtech EF Data Corporation 1126 Alturas Drive Moscow ID 83843 tel: 208.892.5600 fax: 208.892.5601 www.aha.com Table of
More informationIntroduction. Chapter Basics of communication
Chapter 1 Introduction Claude Shannon s 1948 paper A Mathematical Theory of Communication gave birth to the twin disciplines of information theory and coding theory. The basic goal is efficient and reliable
More informationScheduling in omnidirectional relay wireless networks
Scheduling in omnidirectional relay wireless networks by Shuning Wang A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Applied Science
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 informationDigital Communication Systems ECS 452
Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong prapun@siit.tu.ac.th 5. Channel Coding 1 Office Hours: BKD, 6th floor of Sirindhralai building Tuesday 14:20-15:20 Wednesday 14:20-15:20
More informationStudy of Undetected Error Probability of BCH codes for MTTFPA analysis
Study of Undetected Error Probability of BCH codes for MTTFPA analysis Dunia Prieto Rubén Pérez-Aranda rubenpda@kdpof.com Background & Objectives A binary BCH code is proposed to be used as component code
More informationFrequency-Hopped Spread-Spectrum
Chapter Frequency-Hopped Spread-Spectrum In this chapter we discuss frequency-hopped spread-spectrum. We first describe the antijam capability, then the multiple-access capability and finally the fading
More informationEFFECTS OF PHASE AND AMPLITUDE ERRORS ON QAM SYSTEMS WITH ERROR- CONTROL CODING AND SOFT DECISION DECODING
Clemson University TigerPrints All Theses Theses 8-2009 EFFECTS OF PHASE AND AMPLITUDE ERRORS ON QAM SYSTEMS WITH ERROR- CONTROL CODING AND SOFT DECISION DECODING Jason Ellis Clemson University, jellis@clemson.edu
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 informationIntuitive Guide to Principles of Communications By Charan Langton Coding Concepts and Block Coding
Intuitive Guide to Principles of Communications By Charan Langton www.complextoreal.com Coding Concepts and Block Coding It s hard to work in a noisy room as it makes it harder to think. Work done in such
More informationQUIZ : oversubscription
QUIZ : oversubscription A telco provider sells 5 Mpbs DSL service to 50 customers in a neighborhood. The DSLAM connects to the central office via one T3 and two T1 lines. What is the oversubscription factor?
More informationHamming Codes and Decoding Methods
Hamming Codes and Decoding Methods Animesh Ramesh 1, Raghunath Tewari 2 1 Fourth year Student of Computer Science Indian institute of Technology Kanpur 2 Faculty of Computer Science Advisor to the UGP
More informationPhysical-Layer Services and Systems
Physical-Layer Services and Systems Figure Transmission medium and physical layer Figure Classes of transmission media GUIDED MEDIA Guided media, which are those that provide a conduit from one device
More informationphotons photodetector t laser input current output current
6.962 Week 5 Summary: he Channel Presenter: Won S. Yoon March 8, 2 Introduction he channel was originally developed around 2 years ago as a model for an optical communication link. Since then, a rather
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 informationSolutions to the problems from Written assignment 2 Math 222 Winter 2015
Solutions to the problems from Written assignment 2 Math 222 Winter 2015 1. Determine if the following limits exist, and if a limit exists, find its value. x2 y (a) The limit of f(x, y) = x 4 as (x, y)
More informationModule 8: Video Coding Basics Lecture 40: Need for video coding, Elements of information theory, Lossless coding. The Lecture Contains:
The Lecture Contains: The Need for Video Coding Elements of a Video Coding System Elements of Information Theory Symbol Encoding Run-Length Encoding Entropy Encoding file:///d /...Ganesh%20Rana)/MY%20COURSE_Ganesh%20Rana/Prof.%20Sumana%20Gupta/FINAL%20DVSP/lecture%2040/40_1.htm[12/31/2015
More informationEECS 473 Advanced Embedded Systems. Lecture 13 Start on Wireless
EECS 473 Advanced Embedded Systems Lecture 13 Start on Wireless Team status updates Losing track of who went last. Cyberspeaker VisibleLight Elevate Checkout SmartHaus Upcoming Last lecture this Thursday
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 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 informationLecture Notes 3: Paging, K-Server and Metric Spaces
Online Algorithms 16/11/11 Lecture Notes 3: Paging, K-Server and Metric Spaces Professor: Yossi Azar Scribe:Maor Dan 1 Introduction This lecture covers the Paging problem. We present a competitive online
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 informationAn Enhanced Fast Multi-Radio Rendezvous Algorithm in Heterogeneous Cognitive Radio Networks
1 An Enhanced Fast Multi-Radio Rendezvous Algorithm in Heterogeneous Cognitive Radio Networks Yeh-Cheng Chang, Cheng-Shang Chang and Jang-Ping Sheu Department of Computer Science and Institute of Communications
More informationSummary of Basic Concepts
Transmission Summary of Basic Concepts Sender Channel Receiver Dr. Christian Rohner Encoding Modulation Demodulation Decoding Bits Symbols Noise Terminology Communications Research Group Bandwidth [Hz]
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 information1999 Mathcounts National Sprint Round Solutions
999 Mathcounts National Sprint Round Solutions. Solution: 5. A -digit number is divisible by if the sum of its digits is divisible by. The first digit cannot be 0, so we have the following four groups
More informationChapter 1 Coding for Reliable Digital Transmission and Storage
Wireless Information Transmission System Lab. Chapter 1 Coding for Reliable Digital Transmission and Storage Institute of Communications Engineering National Sun Yat-sen University 1.1 Introduction A major
More informationII Year (04 Semester) EE6403 Discrete Time Systems and Signal Processing
Class Subject Code Subject II Year (04 Semester) EE6403 Discrete Time Systems and Signal Processing 1.CONTENT LIST: Introduction to Unit I - Signals and Systems 2. SKILLS ADDRESSED: Listening 3. OBJECTIVE
More informationCOUNTING AND PROBABILITY
CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.2 Possibility Trees and the Multiplication Rule Copyright Cengage Learning. All rights reserved. Possibility
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 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 informationExtended Introduction to Computer Science CS1001.py Lecture 23 24: Error Detection and Correction Codes
Extended Introduction to Computer Science CS1001.py Lecture 23 24: Error Detection and Correction Codes Instructors: Benny Chor, Amir Rubinstein, Ph.D. Teaching Assistants: Amir Gilad, Michal Kleinbort
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 informationChapter 4 Digital Transmission 4.1
Chapter 4 Digital Transmission 4.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4-1 DIGITAL-TO-DIGITAL CONVERSION In this section, we see how we can represent
More informationCommunication Theory II
Communication Theory II Lecture 14: Information Theory (cont d) Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt March 25 th, 2015 1 Previous Lecture: Source Code Generation: Lossless
More informationVolume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More informationWhite Paper FEC In Optical Transmission. Giacomo Losio ProLabs Head of Technology
White Paper FEC In Optical Transmission Giacomo Losio ProLabs Head of Technology 2014 FEC In Optical Transmission When we introduced the DWDM optics, we left out one important ingredient that really makes
More informationEntropy, Coding and Data Compression
Entropy, Coding and Data Compression Data vs. Information yes, not, yes, yes, not not In ASCII, each item is 3 8 = 24 bits of data But if the only possible answers are yes and not, there is only one bit
More informationModule 3 Greedy Strategy
Module 3 Greedy Strategy Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu Introduction to Greedy Technique Main
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 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 informationChapter 10 Error Detection and Correction
Chapter 10 Error Detection and Correction 10.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 10.2 Note Data can be corrupted during transmission. Some applications
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 informationRouting versus Network Coding in Erasure Networks with Broadcast and Interference Constraints
Routing versus Network Coding in Erasure Networks with Broadcast and Interference Constraints Brian Smith Department of ECE University of Texas at Austin Austin, TX 7872 bsmith@ece.utexas.edu Piyush Gupta
More informationRAINBOW COLORINGS OF SOME GEOMETRICALLY DEFINED UNIFORM HYPERGRAPHS IN THE PLANE
1 RAINBOW COLORINGS OF SOME GEOMETRICALLY DEFINED UNIFORM HYPERGRAPHS IN THE PLANE 1 Introduction Brent Holmes* Christian Brothers University Memphis, TN 38104, USA email: bholmes1@cbu.edu A hypergraph
More informationSystems of Orthogonal Circles and Poincarè Geometry, on the TI-92
Proceedings of the Third DERIVE/TI-92 Conference Systems of Orthogonal Circles and Poincarè Geometry, on the TI-92 Paul Beem Indiana University South Bend, IN pbeem@iusb.edu When we encounter hyperbolic
More informationGood Synchronization Sequences for Permutation Codes
1 Good Synchronization Sequences for Permutation Codes Thokozani Shongwe, Student Member, IEEE, Theo G. Swart, Member, IEEE, Hendrik C. Ferreira and Tran van Trung Abstract For communication schemes employing
More informationMath 2411 Calc III Practice Exam 2
Math 2411 Calc III Practice Exam 2 This is a practice exam. The actual exam consists of questions of the type found in this practice exam, but will be shorter. If you have questions do not hesitate to
More information