Signal Encoding Criteria
|
|
- Meghan McDaniel
- 5 years ago
- Views:
Transcription
1 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 bit error rate An increase in SNR decreases bit error rate An increase in bandwidth allows an increase in data rate Importantly, another factor can be utilized to improve performance and that is the encoding scheme Factors Used to Compare Encoding Schemes Signal spectrum With lack of high frequency components, less bandwidth required Clocking Ease of determining beginning and end of each bit position Signal interference and noise immunity Certain codes exhibit superior performance in the presence of noise (usually expressed in terms of a BER) Cost and complexity The higher the signal rate to achieve a given data rate, the greater the cost 1
2 Basic Encoding Techniques Digital data to analog signal Amplitude shift keying (ASK) Amplitude difference of carrier frequency Frequency shift keying (FSK) Frequency difference near carrier frequency Phase shift keying (PSK) Phase of carrier signal shifted Modulation of Analog Signals for Digital Data 2
3 Phase Shift Keying (PSK) Two level PSK (BPSK) Uses two phases to represent binary digits s t Acos 2 f c t Acos 2 f c t Acos 2 f t c Acos 2 f c t binary 1 binary 0 binary 1 binary 0 Phase Shift Keying (PSK) Differential PSK (DPSK) Phase shift with reference to previous bit Binary 0 signal burst of same phase as previous signal burst Binary 1 signal burst of opposite phase to previous signal burst 3
4 Differential Phase Shift Keying Quadrature Phase Shift Keying (PSK) Four level PSK (QPSK) Each element represents more than one bit Acos 2 f c t 4 11 Acos 2 f c t s(t) Acos 2 f c t Acos 2 f c t
5 QPSK Constellation Diagram QPSK and OQPSK Modulators 5
6 Phase Shift Keying (PSK) Multilevel PSK Using multiple phase angles with each angle having more than one amplitude, multiple signal elements can be achieved D R L R log 2 M D = modulation rate, baud or symbols/sec R = data rate, bps M = number of different signal elements = 2 L L = number of bits per signal element Performance Bandwidth of modulated signal (B T ) ASK, PSK B T = (1+r)R FSK B T = 2Δf+(1+r)R R = bit rate 0 < r < 1; related to how signal is filtered Δf = f 2 f c = f c f 1 6
7 Performance Bandwidth of modulated signal (B T ) MPSK MFSK B T B T 1 r 1 R L log 2 1 rm R M log 2 r M R L = number of bits encoded per signal element M = number of different signal elements Bit Error rate (BER) Performance must be assessed in the presence of noise Bit error probability is probably a clearer term BER is not a rate in bits/sec, but rather a probability Commonly plotted on a log scale in the y axis and E b /N 0 in db on the x axis As E b /N 0 increases, BER drops Curves to the lower left have better performance 7
8 Theoretical Bit Error Rate for Various Encoding Schemes Theoretical Bit Error Rate for Multilevel FSK, PSK, and QAM 8
9 Quadrature Amplitude Modulation QAM is a combination of ASK and PSK Two different signals sent simultaneously on the same carrier frequency st It cos2 f c t Qtsin2 f c t QAM Modulator 9
10 16 QAM Constellation Diagram Spread Spectrum Input is fed into a channel encoder Produces analog signal with narrow bandwidth Signal is further modulated using sequence of digits Spreading code or spreading sequence Generated by pseudonoise, or pseudo random number generator Effect of modulation is to increase bandwidth of signal to be transmitted 10
11 General Model of Spread Spectrum Digital Communication System Spread Spectrum On receiving end, digital sequence is used to demodulate the spread spectrum signal Signal is fed into a channel decoder to recover data 11
12 Spread Spectrum What can be gained from apparent waste of spectrum? Immunity from various kinds of noise and multipath distortion Can be used for hiding and encrypting signals Several users can independently use the same higher bandwidth with very little interference Frequency Hoping Spread Spectrum (FHSS) Signal is broadcast over seemingly random series of radio frequencies A number of channels allocated for the FH signal Width of each channel corresponds to bandwidth of input signal Signal hops from frequency to frequency at fixed intervals Transmitter operates in one channel at a time Bits are transmitted using some encoding scheme At each successive interval, a new carrier frequency is selected 12
13 Frequency Hopping Example Frequency Hopping Spread Spectrum System 13
14 Frequency Hoping Spread Spectrum Channel sequence dictated by spreading code Receiver, hopping between frequencies in synchronization with transmitter, picks up message Advantages Eavesdroppers hear only unintelligible blips Attempts to jam signal on one frequency succeed only at knocking out a few bits FHSS Using MFSK MFSK signal is translated to a new frequency every T c seconds by modulating the MFSK signal with the FHSS carrier signal For data rate of R: duration of a bit: T = 1/R seconds duration of signal element: T s = LT seconds T c T s slow frequency hop spread spectrum T c < T s fast frequency hop spread spectrum 14
15 Slow Frequency Hop Spread Spectrum Using MFSK 1M = 4, k = 22 Frequency Hop Spread Spectrum Using MFSK 1M = 4, k = 22 15
16 FHSS Performance Considerations Large number of frequencies used Results in a system that is quite resistant to jamming Jammer must jam all frequencies With fixed power, this reduces the jamming power in any one frequency band SPREAD SPECTRUM a little history FYI Spread Spectrum is now usually associated with digital communications using radio. (Note that wireless = radio for this course as we are talking about basic technologies, not commercial offerings.) Spread Spectrum techniques can be employed for analog communications over guided media, although most spread spectrum systems are via radio. 16
17 SPREAD SPECTRUM The general concept of many communications schemes including SS is simple but profound: we can trade bandwidth for noise reduction. We are familiar with this concept by the use of 200 khz channels for FM broadcasting 15 khz stereo audio and for that matter using digital techniques to require a 64 kbps link for a 3 khz telephone call. The original use of the SS techniques was to make eavesdropping and/or locating military radio communications extremely difficult. But the immunity to other similar signals noise as well as to single frequency (non spread signal) interference was immediately manifest. The original refinement of these techniques was to completely obscured the existence of the communications to conventional narrow band receivers. Three Basic Spread Spectrum Techniques and Purposes SPREAD SPECTRUM TECHNIQUE PRIMARY PRACTICAL ATTRIBUTES 1. Frequency Hopping Unable to be received other than by intended recipients Effectively eliminates single frequency interference and/or jamming Reciprocal from outlook of single channel users Used with analog and digital communications Signals are not completely occult (hidden). 2. Direct Sequence Encrypts digital data at very high level Significant noise reduction from other spectrum users, including discrete channels as well as other DSCC users. Also reciprocal to channelized radio signals 3. Code Division Multiple Access Specific type of DSSS scheme widely used specifically for multiplexing multiple users rather than for encryption or for noise reduction 17
18 SPREAD SPECTRUM TECHNIQUES Frequency Hopping Spread Spectrum (FHSS) This is a very old technique dating back to the 1940s (WW II) and earlier but said to be invented by movie star Hedy Lamarr*. FHSS is applicable to analog radio communications and groups of bits of digital data, even one bit or less at a time modulating a radio carrier. The transmitter and receiver simply jump (hop) in synchronism between a number of different narrow band frequency conventional AM or FM channels. The channel occupancy of the result can be over many channels or even entire frequency bands, e.g. the 3 30 MHz short wave band. The participating transmitter and receiver need to have the exact correct sequence of frequencies and be synchronized; other receivers tuned to single channels can detect only occasional very small segments of the communications rendering eavesdropping virtually impossible. The existence of the communications may be discerned due to the detection of "blips" of RF energy on any given channel. *A most fascinating story. 1. Frequency Hopping Spread Spectrum was invented during WW II by movie star Hedy Lamarr. Hedy Lamarr,
19 THE INVENTION OF FREQUENCY HOPPING STREAD SPECTRUM The invention of spread spectrum is quite a story involving Nazis, a future Hollywood star, attempted murders, a number of druggings (more than one), a brothel (perhaps more than one), a Hollywood mogul (decidedly one), a player piano, and a piano player (a particular one). Picture: millikansbend.org Original spread spectrum scheme used perforated paper reels similar to those used in player pianos to control secure synchronous transmitter and receiver frequency hopping. Besides preventing eavesdropping, frequency hopping minimized detection by enemy direction finders to locate clandestine transmitters. 19
20 Two pages of drawings from Lamarr (name on patent is Markey, the name of Hedy s 2 nd of 6 husbands) and Antheil's patent*. Note the player piano like slotted paper on the second sheet at right below. FREQUENCY HOPPING SPREAD SPECTRUM Points to Remember Single frequency jamming and/or multipath distortion that occurs only on a few of the channels used have only minimal effects on the bit error rates. This takes a little explaining. The idea is that only syllables are lost for voice transmission where humans can fill in the missing data, hopefully correctly. For digital transmission, error correcting can apply. Bits do get lost unless retransmissions and/or FEC is used. The hopping sequence must be pseudo random otherwise interference would be periodic and decodable. This is very important for digital transmission employing FHSS. Pseudo Random means complicated enough to have a very long periodicity (if at all) and with statistics that appear to mimic those of true random distributions. The effect of FHSS is to minimize interference or detection of the transmitting location. That a hopper is near by can often be determined. 20
21 FHSS Continued When used with digital communications, the pseudo random hopping sequence will ensure that the bit errors will occur in what appears to be a random way. This is more easily handled by error correction operating at the data link or higher layers. BERs will be low if enough "good" channels are employed in the sequence: bad if many of the channels are in use. Frequency Hopping is also a multiplex and encryption technique. Background noise (for analog signals) or BER (for digital transmission) increase as the number of users increase. The general result of many users is similar to having a high random noise within the channel. If the occupancy time of any given in use channel is very low a fraction of a second intelligible communications can still occur or BER is tolerable when FEC schemes are used. FHSS is widely used for 2.4 GHz cordless telephones and was part of the original IEEE 802 wireless LAN standard. 21
22 Direct Sequence Spread Spectrum (DSSS) Each bit in original signal is represented by multiple bits in the transmitted signal Spreading code spreads signal across a wider frequency band Spread is in direct proportion to number of bits used One technique combines digital information stream with the spreading code bit stream using exclusive OR (Figure 9.6) Example of Direct Sequence Spread Spectrum 22
23 Direct Sequence Spread Spectrum System DSSS Using BPSK Multiply BPSK signal, s d (t) = A d(t) cos( f c t) by c(t)[takes values +1, 1] to get s(t) = A d(t)c(t) cos( f c t) A = amplitude of signal f c = carrier frequency d(t) = discrete function [+1, 1] At receiver, incoming signal multiplied by c(t) Since, c(t) x c(t) = 1, incoming signal is recovered 23
24 Example of Direct Sequence Spread Spectrum Using BPSK Approximate Spectrum of Direct Sequence Spread Spectrum Signal 24
25 Code Division Multiple Access (CDMA) Basic Principles of CDMA D = rate of data signal Break each bit into kchips Chips are a user specific fixed pattern Chip data rate of new channel = kd CDMA Example If k=6 and code is a sequence of 1s and 1s For a 1 bit, A sends code as chip pattern <c1, c2, c3, c4, c5, c6> For a 0 bit, A sends complement of code < c1, c2, c3, c4, c5, c6> Receiver knows sender s code and performs electronic decode function S u d d1c1 d2c2d3c3 d4c4d5c5 d6c6 <d1, d2, d3, d4, d5, d6> = received chip pattern <c1, c2, c3, c4, c5, c6> = sender s code 25
26 CDMA Example CDMA Example User A code = <1, 1, 1, 1, 1, 1> To send a 1 bit = <1, 1, 1, 1, 1, 1> To send a 0 bit = < 1, 1, 1, 1, 1, 1> User B code = <1, 1, 1, 1, 1, 1> To send a 1 bit = <1, 1, 1, 1, 1, 1> Receiver receiving with A s code (A s code) x (received chip pattern) User A 1 bit: 6 > 1 User A 0 bit: 6 > 0 User B 1 bit: 0 > unwanted signal ignored 26
27 CDMA in a DSSS Environment Rake receiver ( digital multipath ) RAKE receiver Multiple versions of a signal arrive more than one chip interval apart RAKE receiver attempts to recover signals from multiple paths and combine them This method achieves better performance than simply recovering dominant signal and treating remaining signals as noise 27
28 Principle of RAKE Receiver Categories of Spreading Sequences Spreading Sequence Categories PN sequences Orthogonal codes For FHSS systems PN sequences most common For DSSS systems not employing CDMA PN sequences most common For DSSS CDMA systems PN sequences Orthogonal codes 28
29 PN Sequences PN generator produces periodic sequence that appears to be random PN Sequences Generated by an algorithm using initial seed Sequence isn t statistically random but will pass many test of randomness Sequences referred to as pseudorandom numbers or pseudonoise sequences Unless algorithm and seed are known, the sequence is impractical to predict Additional reference materials Required Textbook: Antennas and Propagation for Wireless Communication Systems, by Simon R. Saunders and Alejandro Aragon Zavala, ISBN ; March 2007 (2 nd edition). Optional References: Wireless Communications and Networks, by William Stallings, ISBN , 2002 (1 st edition); Wireless Communication Networks and Systems, by Corey Beard & William Stallings (1 st edition); all material copyright 2016 Wireless Communications Principles and Practice, by Theodore S. Rappaport, ISBN (2 nd edition) 29
30 Required Textbook: Antennas and Propagation for Wireless Communication Systems, by Simon R. Saunders and Alejandro Aragon Zavala, ISBN ; March 2007 (2 nd edition). Optional References: Wireless Communications and Networks, by William Stallings, ISBN , 2002 (1 st edition); Wireless Communication Networks and Systems, by Corey Beard & William Stallings (1 st edition); all material copyright 2016 Wireless Communications Principles and Practice, by Theodore S. Rappaport, ISBN (2 nd edition) Acknowledgements: Additional reference materials OSI 7 layer model 30
31 Coping with Data Transmission Errors Error detection codes Detects the presence of an error Automatic repeat request (ARQ) protocols Block of data with error is discarded Transmitter retransmits that block of data Error correction codes, or forward correction codes (FEC) Designed to detect and correct errors Error Detection Probabilities Definitions P b : Probability of single bit error (BER) P 1 : Probability that a frame arrives with no bit errors P 2 : While using error detection, the probability that a frame arrives with one or more undetected errors P 3 : While using error detection, the probability that a frame arrives with one or more detected bit errors but no undetected bit errors 31
32 Error Detection Probabilities Definitions P b : Probability of single bit error (BER) P 1 : Probability that a frame arrives with no bit errors P 2 : While using error detection, the probability that a frame arrives with one or more undetected errors P 3 : While using error detection, the probability that a frame arrives with one or more detected bit errors but no undetected bit errors Error Detection Process Transmitter For a given frame, an error detecting code (check bits) is calculated from data bits Check bits are appended to data bits Receiver Separates incoming frame into data bits and check bits Calculates check bits from received data bits Compares calculated check bits against received check bits Detected error occurs if mismatch 32
33 Error Detection Process Transmitter For a given frame, an error detecting code (check bits) is calculated from data bits Check bits are appended to data bits Receiver Separates incoming frame into data bits and check bits Calculates check bits from received data bits Compares calculated check bits against received check bits Detected error occurs if mismatch Parity Check Parity bit appended to a block of data Even parity Added bit ensures an even number of 1s Odd parity Added bit ensures an odd number of 1s Example, 7 bit character [ ] Even parity [ ] Odd parity [ ] 33
34 Cyclic Redundancy Check (CRC) Transmitter For a k bit block, transmitter generates an (n k) bit frame check sequence (FCS) Resulting frame of n bits is exactly divisible by predetermined number Receiver Divides incoming frame by predetermined number If no remainder, assumes no error Wireless Transmission Errors Error detection requires retransmission Detection inadequate for wireless applications Error rate on wireless link can be high, results in a large number of retransmissions Long propagation delay compared to transmission time 34
35 Block Error Correction Codes Transmitter Forward error correction (FEC) encoder maps each k bit block into an n bit block codeword Codeword is transmitted; (analog transmission for wireless communications systems) Receiver Incoming signal is demodulated Block passed through an FEC decoder Forward Error Correction Process 35
36 FEC Decoder Outcomes No errors present Codeword produced by decoder matches original codeword Decoder detects and corrects bit errors Decoder detects but cannot correct bit errors; reports uncorrectable error Decoder incorrectly corrects bit errors Error pattern looks like a different block of data was sent Decoder detects no bit errors, though errors are present Block Code Principles Hamming distance for 2 n bit binary sequences, the number of different bits E.g., v 1 =011011; v 2 =110001; d(v1, v 2 )=3 Redundancy ratio of redundant bits to data bits Code rate ratio of data bits to total bits Coding gain the reduction in the required E b /N 0 to achieve a specified BER of an error correcting coded system 36
37 10.6 How Coding Improves System Performance Hamming code Designed to correct single bit errors Family of (n, k) block error correcting codes with parameters: Block length: n = 2 m 1 Number of data bits: k = 2 m m 1 Number of check bits: n k = m Minimum distance: d min = 3 Single error correcting (SEC) code SEC double error detecting (SEC DED) code 37
38 Hamming code Designed to correct single bit errors Family of (n, k) block error correcting codes with parameters: Block length: n = 2 m 1 Number of data bits: k = 2 m m 1 Number of check bits: n k = m Minimum distance: d min = 3 Single error correcting (SEC) code SEC double error detecting (SEC DED) code Hamming Code Process Encoding: k data bits + (n k) check bits Decoding: compares received (n k) bits with calculated (n k) bits using XOR Resulting (n k) bits called syndrome word Syndrome range is between 0 and 2 (n k) 1 Each bit of syndrome indicates a match (0) or conflict (1) in that bit position 38
39 Cyclic Codes Can be encoded and decoded using linear feedback shift registers (LFSRs) For cyclic codes, a valid codeword (c 0, c 1,, c n 1 ), shifted right one bit, is also a valid codeword (c n 1, c 0,, c n 2 ) Takes fixed length input (k) and produces fixedlength check code (n k) In contrast, CRC error detecting code accepts arbitrary length input for fixed length check code BCH Codes For positive pair of integers m and t, a (n, k) BCH code has parameters: Block length: n = 2 m 1 Number of check bits: n k mt Minimum distance: d min 2t + 1 Correct combinations of t or fewer errors Flexibility in choice of parameters Block length, code rate 39
40 Table 10.4 BCH Code Parameters Reed Solomon Codes Subclass of nonbinary BCH codes Data processed in chunks of m bits, called symbols An (n, k) RS code has parameters: Symbol length: m bits per symbol Block length: n = 2 m 1 symbols = m(2 m 1) bits Data length: k symbols Size of check code: n k = 2t symbols = m(2t) bits Minimum distance: d min = 2t + 1 symbols 40
41 Low density parity check (LDPC) codes Approach Shannon s limit Use very long codes Check for errors by using many equations that each add at least three bits together Variable nodescorrespond to bits Constraint nodes implement equations Uses iterative decoding Variable nodes estimate the bits And estimate the probabilities of being those bits Constraint nodes combine the estimates to see if they satisfy the equations Low density parity check (LDPC) codes Approach Shannon s limit Use very long codes Check for errors by using many equations that each add at least three bits together Variable nodescorrespond to bits Constraint nodes implement equations Uses iterative decoding Variable nodes estimate the bits And estimate the probabilities of being those bits Constraint nodes combine the estimates to see if they satisfy the equations 41
42 Tanner Graph for LDPC Iterative Decoding Block Interleaving Data written to and read from memory in different orders Data bits and corresponding check bits are interspersed with bits from other blocks At receiver, data are deinterleaved to recover original order A burst error that may occur is spread out over a number of blocks, making error correction possible 42
43 Block Interleaving Data written to and read from memory in different orders Data bits and corresponding check bits are interspersed with bits from other blocks At receiver, data are deinterleaved to recover original order A burst error that may occur is spread out over a number of blocks, making error correction possible Block Interleaving Data written to and read from memory in different orders Data bits and corresponding check bits are interspersed with bits from other blocks At receiver, data are deinterleaved to recover original order A burst error that may occur is spread out over a number of blocks, making error correction possible 43
44 Convolutional Codes Generates redundant bits continuously Error checking and correcting carried out continuously (n, k, K) code Input processes k bits at a time Output produces n bits for every k input bits K = constraint factor k and n generally very small n bit output of (n, k, K) code depends on: Current block of k input bits Previous k 1 blocks of k input bits Decoding Trellis diagram expanded encoder diagram Viterbi code error correction algorithm Compares received sequence with all possible transmitted sequences Algorithm chooses path through trellis whose coded sequence differs from received sequence in the fewest number of places Once a valid path is selected as the correct path, the decoder can recover the input data bits from the output code bits 44
45 Example Trellis Diagram for Encoding Trellis Diagrams for Encoder with (n, k, K) = (2, 1, 7) 45
46 Viterbi Algorithm for w = with decoding window b = 7 Turbo coding Popular for third and fourth generation cellular systems Perform very close to Shannon limit Three versions of the signal are transmitted, interleaved together Original signal Encoded version of the signal Interleaved version that is then encoded Some of the bits of the interleaved stream are removed 46
47 10.14 Turbo Encoding and Decoding Turbo coding Popular for third and fourth generation cellular systems Perform very close to Shannon limit Three versions of the signal are transmitted, interleaved together Original signal Encoded version of the signal Interleaved version that is then encoded Some of the bits of the interleaved stream are removed 47
48 Automatic Repeat Request Mechanism used in data link control and transport protocols Relies on use of an error detection code (such as CRC) Flow Control Error Control Flow Control Assures that transmitting entity does not overwhelm a receiving entity with data Protocols with flow control mechanism allow multiple PDUs in transit at the same time PDUs arrive in same order they re sent Sliding window flow control Transmitter maintains list (window) of sequence numbers allowed to send Receiver maintains list allowed to receive 48
49 Sliding Window Depiction Source system A Destination system B P0 P P RR RR 4 P3 P4 P5 P Example of a Sliding Window Protocol 49
50 Flow Control Reasons for breaking up a block of data before transmitting: Limited buffer size of receiver Retransmission of PDU due to error requires smaller amounts of data to be retransmitted On shared medium, larger PDUs occupy medium for extended period, causing delays at other sending stations Error Control Mechanisms to detect and correct transmission errors Types of errors: Lost PDU : a PDU fails to arrive Damaged PDU : PDU arrives with errors 50
51 10.17 Model of PDU Transmission Error Control Requirements Error detection Receiver detects errors and discards PDUs Positive acknowledgement Destination returns acknowledgment of received, errorfree PDUs Retransmission after timeout Source retransmits unacknowledged PDU Negative acknowledgement and retransmission Destination returns negative acknowledgment to PDUs in error 51
52 Go back N ARQ Acknowledgments RR = receive ready (no errors occur) REJ = reject (error detected) Contingencies Damaged PDU Damaged RR Damaged REJ Go back N ARQ Acknowledgments RR = receive ready (no errors occur) REJ = reject (error detected) Contingencies Damaged PDU Damaged RR Damaged REJ 52
53 HYBRID ARQ Hybrid Automatic Repeat Request (HARQ) Neither FEC or ARQ is adequate in practical situations FEC may add unnecessary redundancy ARQ may cause excessive delays from retransmissions HARQ is widely used Uses combination of FEC and ARQ Additional reference materials Required Textbook: Antennas and Propagation for Wireless Communication Systems, by Simon R. Saunders and Alejandro Aragon Zavala, ISBN ; March 2007 (2 nd edition). Optional References: Wireless Communications and Networks, by William Stallings, ISBN , 2002 (1 st edition); Wireless Communication Networks and Systems, by Corey Beard & William Stallings (1 st edition); all material copyright 2016 Wireless Communications Principles and Practice, by Theodore S. Rappaport, ISBN (2 nd edition) 53
CHAPTER 2. Instructor: Mr. Abhijit Parmar Course: Mobile Computing and Wireless Communication ( )
CHAPTER 2 Instructor: Mr. Abhijit Parmar Course: Mobile Computing and Wireless Communication (2170710) Syllabus Chapter-2.4 Spread Spectrum Spread Spectrum SS was developed initially for military and intelligence
More informationSpread Spectrum. Chapter 18. FHSS Frequency Hopping Spread Spectrum DSSS Direct Sequence Spread Spectrum DSSS using CDMA Code Division Multiple Access
Spread Spectrum Chapter 18 FHSS Frequency Hopping Spread Spectrum DSSS Direct Sequence Spread Spectrum DSSS using CDMA Code Division Multiple Access Single Carrier The traditional way Transmitted signal
More informationSimple Algorithm in (older) Selection Diversity. Receiver Diversity Can we Do Better? Receiver Diversity Optimization.
18-452/18-750 Wireless Networks and Applications Lecture 6: Physical Layer Diversity and Coding Peter Steenkiste Carnegie Mellon University Spring Semester 2017 http://www.cs.cmu.edu/~prs/wirelesss17/
More informationCHAPTER 2. Instructor: Mr. Abhijit Parmar Course: Mobile Computing and Wireless Communication ( )
CHAPTER 2 Instructor: Mr. Abhijit Parmar Course: Mobile Computing and Wireless Communication (2170710) Syllabus Chapter-2.3 Modulation Techniques Reasons for Choosing Encoding Techniques Digital data,
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 informationLecture 9: Spread Spectrum Modulation Techniques
Lecture 9: Spread Spectrum Modulation Techniques Spread spectrum (SS) modulation techniques employ a transmission bandwidth which is several orders of magnitude greater than the minimum required bandwidth
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 informationChapter 2 Overview - 1 -
Chapter 2 Overview Part 1 (last week) Digital Transmission System Frequencies, Spectrum Allocation Radio Propagation and Radio Channels Part 2 (today) Modulation, Coding, Error Correction Part 3 (next
More informationSpread Spectrum (SS) is a means of transmission in which the signal occupies a
SPREAD-SPECTRUM SPECTRUM TECHNIQUES: A BRIEF OVERVIEW SS: AN OVERVIEW Spread Spectrum (SS) is a means of transmission in which the signal occupies a bandwidth in excess of the minimum necessary to send
More informationMultiple Access Techniques
Multiple Access Techniques EE 442 Spring Semester Lecture 13 Multiple Access is the use of multiplexing techniques to provide communication service to multiple users over a single channel. It allows for
More informationSpread Spectrum Techniques
0 Spread Spectrum Techniques Contents 1 1. Overview 2. Pseudonoise Sequences 3. Direct Sequence Spread Spectrum Systems 4. Frequency Hopping Systems 5. Synchronization 6. Applications 2 1. Overview Basic
More informationECS455: Chapter 4 Multiple Access
ECS455: Chapter 4 Multiple Access 4.4 DS/SS 1 Dr.Prapun Suksompong prapun.com/ecs455 Office Hours: BKD 3601-7 Tuesday 9:30-10:30 Tuesday 13:30-14:30 Thursday 13:30-14:30 Spread spectrum (SS) Historically
More informationPart A: Spread Spectrum Systems
1 Telecommunication Systems and Applications (TL - 424) Part A: Spread Spectrum Systems Dr. ir. Muhammad Nasir KHAN Department of Electrical Engineering Swedish College of Engineering and Technology February
More informationChapter 2 Overview - 1 -
Chapter 2 Overview Part 1 (last week) Digital Transmission System Frequencies, Spectrum Allocation Radio Propagation and Radio Channels Part 2 (today) Modulation, Coding, Error Correction Part 3 (next
More informationTSTE17 System Design, CDIO. General project hints. Behavioral Model. General project hints, cont. Lecture 5. Required documents Modulation, cont.
TSTE17 System Design, CDIO Lecture 5 1 General project hints 2 Project hints and deadline suggestions Required documents Modulation, cont. Requirement specification Channel coding Design specification
More informationWireless Networks (PHY): Design for Diversity
Wireless Networks (PHY): Design for Diversity Y. Richard Yang 9/20/2012 Outline Admin and recap Design for diversity 2 Admin Assignment 1 questions Assignment 1 office hours Thursday 3-4 @ AKW 307A 3 Recap:
More informationBandwidth Utilization:
CHAPTER 6 Bandwidth Utilization: In real life, we have links with limited bandwidths. The wise use of these bandwidths has been, and will be, one of the main challenges of electronic communications. However,
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 informationECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013
ECE 5325/6325: Wireless Communication Systems Lecture Notes, Spring 2013 Lecture 17 Today: Spread Spectrum: (1) Frequency Hopping, (2) Direct Sequence Reading: Today Molisch 18.1, 18.2. Thu: MUSE Channel
More informationPart A: Spread Spectrum Systems
1 Telecommunication Systems and Applications (TL - 424) Part A: Spread Spectrum Systems Dr. ir. Muhammad Nasir KHAN Department of Electrical Engineering Swedish College of Engineering and Technology March
More informationDEPARTMENT OF COMPUTER GCE@Bodi_ SCIENCE GCE@Bodi_ AND ENIGNEERING GCE@Bodi_ GCE@Bodi_ GCE@Bodi_ Analog and Digital Communication GCE@Bodi_ DEPARTMENT OF CsE Subject Name: Analog and Digital Communication
More informationPage 1. Outline : Wireless Networks Lecture 6: Final Physical Layer. Direct Sequence Spread Spectrum (DSSS) Spread Spectrum
Outline 18-759 : Wireless Networks Lecture 6: Final Physical Layer Peter Steenkiste Dina Papagiannaki Spring Semester 2009 http://www.cs.cmu.edu/~prs/wireless09/ Peter A. Steenkiste 1 RF introduction Modulation
More informationCollege of information Technology Department of Information Networks Telecommunication & Networking I Chapter 5. Analog Transmission
Analog Transmission 5.1 DIGITAL-TO-ANALOG CONVERSION Digital-to-analog conversion is the process of changing one of the characteristics of an analog signal based on the information in digital data. The
More informationCHAPTER 2. Wireless Communication Networks and Systems 1 st edition Cory Beard, William Stallings 2016 Pearson Higher Education, Inc.
CHAPTER 2 These slides are made available to faculty in PowerPoint form. Slides can be freely added, modified, and deleted to suit student needs. They represent substantial work on the part of the authors;
More informationMobile & Wireless Networking. Lecture 2: Wireless Transmission (2/2)
192620010 Mobile & Wireless Networking Lecture 2: Wireless Transmission (2/2) [Schiller, Section 2.6 & 2.7] [Reader Part 1: OFDM: An architecture for the fourth generation] Geert Heijenk Outline of Lecture
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 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 informationCS263: Wireless Communications and Sensor Networks
CS263: Wireless Communications and Sensor Networks Matt Welsh Lecture 3: Antennas, Propagation, and Spread Spectrum September 30, 2004 2004 Matt Welsh Harvard University 1 Today's Lecture Antennas and
More informationOutline / Wireless Networks and Applications Lecture 5: Physical Layer Signal Propagation and Modulation
Outline 18-452/18-750 Wireless Networks and Applications Lecture 5: Physical Layer Signal Propagation and Modulation Peter Steenkiste Carnegie Mellon University Spring Semester 2017 http://www.cs.cmu.edu/~prs/wirelesss17/
More informationSpread Spectrum: Definition
Spread Spectrum: Definition refers to the expansion of signal bandwidth, by several orders of magnitude in some cases, which occurs when a key is attached to the communication channel an RF communications
More informationECS455: Chapter 4 Multiple Access
ECS455: Chapter 4 Multiple Access 4.4 DS/SS 1 Dr.Prapun Suksompong prapun.com/ecs455 Office Hours: BKD 3601-7 Wednesday 15:30-16:30 Friday 9:30-10:30 Spread spectrum (SS) Historically spread spectrum was
More informationPearson Education Limited Edinburgh Gate Harlow Essex CM20 2JE England and Associated Companies throughout the world
Pearson Education Limited Edinburgh Gate Harlow Essex CM20 2JE England and Associated Companies throughout the world Visit us on the World Wide Web at: www.pearsoned.co.uk Pearson Education Limited 2014
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 informationMultiple Access System
Multiple Access System TDMA and FDMA require a degree of coordination among users: FDMA users cannot transmit on the same frequency and TDMA users can transmit on the same frequency but not at the same
More informationDigital to Digital Encoding
MODULATION AND ENCODING Data must be transformed into signals to send them from one place to another Conversion Schemes Digital-to-Digital Analog-to-Digital Digital-to-Analog Analog-to-Analog Digital to
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 informationChapter 7. Multiple Division Techniques
Chapter 7 Multiple Division Techniques 1 Outline Frequency Division Multiple Access (FDMA) Division Multiple Access (TDMA) Code Division Multiple Access (CDMA) Comparison of FDMA, TDMA, and CDMA Walsh
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 informationUNIT 4 Spread Spectrum and Multiple. Access Technique
UNIT 4 Spread Spectrum and Multiple Access Technique Spread Spectrum lspread spectrumis a communication technique that spreads a narrowband communication signal over a wide range of frequencies for transmission
More informationWireless Communication in Embedded System. Prof. Prabhat Ranjan
Wireless Communication in Embedded System Prof. Prabhat Ranjan Material based on White papers from www.radiotronix.com Networked embedded devices In the past embedded devices were standalone Typically
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 informationUNIT- 7. Frequencies above 30Mhz tend to travel in straight lines they are limited in their propagation by the curvature of the earth.
UNIT- 7 Radio wave propagation and propagation models EM waves below 2Mhz tend to travel as ground waves, These wave tend to follow the curvature of the earth and lose strength rapidly as they travel away
More informationChapter 7 Multiple Division Techniques for Traffic Channels
Introduction to Wireless & Mobile Systems Chapter 7 Multiple Division Techniques for Traffic Channels Outline Introduction Concepts and Models for Multiple Divisions Frequency Division Multiple Access
More informationMultiple Access Schemes
Multiple Access Schemes Dr Yousef Dama Faculty of Engineering and Information Technology An-Najah National University 2016-2017 Why Multiple access schemes Multiple access schemes are used to allow many
More informationLecture #2. EE 471C / EE 381K-17 Wireless Communication Lab. Professor Robert W. Heath Jr.
Lecture #2 EE 471C / EE 381K-17 Wireless Communication Lab Professor Robert W. Heath Jr. Preview of today s lecture u Introduction to digital communication u Components of a digital communication system
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 informationQUESTION BANK EC 1351 DIGITAL COMMUNICATION YEAR / SEM : III / VI UNIT I- PULSE MODULATION PART-A (2 Marks) 1. What is the purpose of sample and hold
QUESTION BANK EC 1351 DIGITAL COMMUNICATION YEAR / SEM : III / VI UNIT I- PULSE MODULATION PART-A (2 Marks) 1. What is the purpose of sample and hold circuit 2. What is the difference between natural sampling
More informationOutline. Wireless Networks (PHY): Design for Diversity. Admin. Outline. Page 1. Recap: Impact of Channel on Decisions. [hg(t) + w(t)]g(t)dt.
Wireless Networks (PHY): Design or Diversity Admin and recap Design or diversity Y. Richard Yang 9/2/212 2 Admin Assignment 1 questions Assignment 1 oice hours Thursday 3-4 @ AKW 37A Channel characteristics
More informationPhysical Layer. Networks: Physical Layer 1
Physical Layer Networks: Physical Layer 1 Physical Layer Part 1 Definitions Nyquist Theorem - noiseless Shannon s Result with noise Analog versus Digital Amplifier versus Repeater Networks: Physical Layer
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 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 informationADVANCED WIRELESS TECHNOLOGIES. Aditya K. Jagannatham Indian Institute of Technology Kanpur
ADVANCED WIRELESS TECHNOLOGIES Aditya K. Jagannatham Indian Institute of Technology Kanpur Wireless Signal Fast Fading The wireless signal can reach the receiver via direct and scattered paths. As a result,
More informationLecture 3: Wireless Physical Layer: Modulation Techniques. Mythili Vutukuru CS 653 Spring 2014 Jan 13, Monday
Lecture 3: Wireless Physical Layer: Modulation Techniques Mythili Vutukuru CS 653 Spring 2014 Jan 13, Monday Modulation We saw a simple example of amplitude modulation in the last lecture Modulation how
More informationQUESTION BANK SUBJECT: DIGITAL COMMUNICATION (15EC61)
QUESTION BANK SUBJECT: DIGITAL COMMUNICATION (15EC61) Module 1 1. Explain Digital communication system with a neat block diagram. 2. What are the differences between digital and analog communication systems?
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 informationT325 Summary T305 T325 B BLOCK 3 4 PART III T325. Session 11 Block III Part 3 Access & Modulation. Dr. Saatchi, Seyed Mohsen.
T305 T325 B BLOCK 3 4 PART III T325 Summary Session 11 Block III Part 3 Access & Modulation [Type Dr. Saatchi, your address] Seyed Mohsen [Type your phone number] [Type your e-mail address] Prepared by:
More informationCSE 461 Bits and Links. David Wetherall
CSE 461 Bits and Links David Wetherall djw@cs.washington.edu Topic How do we send a message across a wire or wireless link? The physical/link layers: 1. Different kinds of media 2. Fundamental limits 3.
More informationCT-516 Advanced Digital Communications
CT-516 Advanced Digital Communications Yash Vasavada Winter 2017 DA-IICT Lecture 17 Channel Coding and Power/Bandwidth Tradeoff 20 th April 2017 Power and Bandwidth Tradeoff (for achieving a particular
More informationMODULATION AND MULTIPLE ACCESS TECHNIQUES
1 MODULATION AND MULTIPLE ACCESS TECHNIQUES Networks and Communication Department Dr. Marwah Ahmed Outlines 2 Introduction Digital Transmission Digital Modulation Digital Transmission of Analog Signal
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 information2018/11/1 Thursday. YU Xiangyu
2018/11/1 Thursday YU Xiangyu yuxy@scut.edu.cn Introduction ARQ FEC Parity Check Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Turbo Codes LDPC Information to
More informationDigital modulation techniques
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 informationIFH SS CDMA Implantation. 6.0 Introduction
6.0 Introduction Wireless personal communication systems enable geographically dispersed users to exchange information using a portable terminal, such as a handheld transceiver. Often, the system engineer
More informationSEN366 Computer Networks
SEN366 Computer Networks Prof. Dr. Hasan Hüseyin BALIK (5 th Week) 5. Signal Encoding Techniques 5.Outline An overview of the basic methods of encoding digital data into a digital signal An overview of
More informationLecture 3 Concepts for the Data Communications and Computer Interconnection
Lecture 3 Concepts for the Data Communications and Computer Interconnection Aim: overview of existing methods and techniques Terms used: -Data entities conveying meaning (of information) -Signals data
More informationSPREAD SPECTRUM (SS) SIGNALS FOR DIGITAL COMMUNICATIONS
Dr. Ali Muqaibel SPREAD SPECTRUM (SS) SIGNALS FOR DIGITAL COMMUNICATIONS VERSION 1.1 Dr. Ali Hussein Muqaibel 1 Introduction Narrow band signal (data) In Spread Spectrum, the bandwidth W is much greater
More informationYear : TYEJ Sub: Digital Communication (17535) Assignment No. 1. Introduction of Digital Communication. Question Exam Marks
Assignment 1 Introduction of Digital Communication Sr. Question Exam Marks 1 Draw the block diagram of the basic digital communication system. State the function of each block in detail. W 2015 6 2 State
More informationRELIABLE UNDERWATER COMMUNICATION SYSTEM FOR SHALLOW COASTAL WATERS JAN SCHMIDT
Volume 17 HYDROACOUSTICS RELIABLE UNDERWATER COMMUNICATION SYSTEM FOR SHALLOW COASTAL WATERS JAN SCHMIDT Gdansk University of Technology Faculty of Electronics, Telecommunication and Informatics Department
More informationIntroduction to Wireless Coding and Modulation
Introduction to Wireless Coding and Modulation Raj Jain Professor of Computer Science and Engineering Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings
More informationAdoption of this document as basis for broadband wireless access PHY
Project Title Date Submitted IEEE 802.16 Broadband Wireless Access Working Group Proposal on modulation methods for PHY of FWA 1999-10-29 Source Jay Bao and Partha De Mitsubishi Electric ITA 571 Central
More informationData Communications and Networking (Module 2)
Data Communications and Networking (Module 2) Chapter 5 Signal Encoding Techniques References: Book Chapter 5 Data and Computer Communications, 8th edition, by William Stallings 1 Outline Overview Encoding
More informationCSEP 561 Bits and Links. David Wetherall
CSEP 561 Bits and Links David Wetherall djw@cs.washington.edu Topic How do we send a message across a wire or wireless link? The physical/link layers: 1. Different kinds of media 2. Fundamental limits
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 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 informationIntroduction to Wireless Coding and Modulation
Introduction to Wireless Coding and Modulation Raj Jain Professor of Computer Science and Engineering Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings
More informationSNS COLLEGE OF ENGINEERING COIMBATORE DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK
SNS COLLEGE OF ENGINEERING COIMBATORE 641107 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK EC6801 WIRELESS COMMUNICATION UNIT-I WIRELESS CHANNELS PART-A 1. What is propagation model? 2. What are the
More informationCode Division Multiple Access.
Code Division Multiple Access Mobile telephony, using the concept of cellular architecture, are built based on GSM (Global System for Mobile communication) and IS-95(Intermediate Standard-95). CDMA allows
More informationQuestion Paper Profile
Question Paper Profile Max. Marks : 70 Time: 3 Hrs. Q.1) A) Attempt any FIVE of the following. 10 Marks a) Define the term Standard. State its two categories. b) List any two advantages of Unguided Media.
More informationChapter 6 Bandwidth Utilization: Multiplexing and Spreading 6.1
Chapter 6 Bandwidth Utilization: Multiplexing and Spreading 6.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-6 PERFORMANCE One important issue in networking
More informationPerformance Analysis of DSSS and FHSS Techniques over AWGN Channel
Performance Analysis of DSSS and FHSS Techniques over AWGN Channel M. Katta Swamy, M.Deepthi, V.Mounika, R.N.Saranya Vignana Bharathi Institute of Technology, Hyderabad, and Andhra Pradesh, India. Corresponding
More informationCSCD 433/533 Wireless Networks
CSCD 433/533 Wireless Networks Lecture 8 Physical Layer, and 802.11 b,g,a,n Differences Winter 2017 1 Topics Spread Spectrum in General Differences between 802.11 b,g,a and n Frequency ranges Speed DSSS
More informationNew Forward Error Correction and Modulation Technologies Low Density Parity Check (LDPC) Coding and 8-QAM Modulation in the CDM-600 Satellite Modem
New Forward Error Correction and Modulation Technologies Low Density Parity Check (LDPC) Coding and 8-QAM Modulation in the CDM-600 Satellite Modem Richard Miller Senior Vice President, New Technology
More informationEECS 380: Wireless Technologies Week 7-8
EECS 380: Wireless Technologies Week 7-8 Michael L. Honig Northwestern University May 2018 Outline Diversity, MIMO Multiple Access techniques FDMA, TDMA OFDMA (LTE) CDMA (3G, 802.11b, Bluetooth) Random
More informationMultilevel RS/Convolutional Concatenated Coded QAM for Hybrid IBOC-AM Broadcasting
IEEE TRANSACTIONS ON BROADCASTING, VOL. 46, NO. 1, MARCH 2000 49 Multilevel RS/Convolutional Concatenated Coded QAM for Hybrid IBOC-AM Broadcasting Sae-Young Chung and Hui-Ling Lou Abstract Bandwidth efficient
More informationWireless Medium Access Control and CDMA-based Communication Lesson 16 Orthogonal Frequency Division Medium Access (OFDM)
Wireless Medium Access Control and CDMA-based Communication Lesson 16 Orthogonal Frequency Division Medium Access (OFDM) 1 4G File transfer at 10 Mbps High resolution 1024 1920 pixel hi-vision picture
More informationNamaste Link Analysis
Namaste Link Analysis version 3.3 22 June 2008 by W5NYV, KA9Q, KB5MU k 1.3806503 10 23 := Boltzmann's constant. Tsys 0, 1.. 290 := System noise temperature. N0dB( Tsys) 10 log( k Tsys) := Noise power spectral
More informationB SCITEQ. Transceiver and System Design for Digital Communications. Scott R. Bullock, P.E. Third Edition. SciTech Publishing, Inc.
Transceiver and System Design for Digital Communications Scott R. Bullock, P.E. Third Edition B SCITEQ PUBLISHtN^INC. SciTech Publishing, Inc. Raleigh, NC Contents Preface xvii About the Author xxiii Transceiver
More informationQuick Introduction to Communication Systems
Quick Introduction to Communication Systems p. 1/26 Quick Introduction to Communication Systems Aly I. El-Osery, Ph.D. elosery@ee.nmt.edu Department of Electrical Engineering New Mexico Institute of Mining
More informationKINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING QUESTION BANK. Subject Name: Digital Communication Techniques
KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING QUESTION BANK Subject Code: EC1351 Year/Sem: III/IV Subject Name: Digital Communication Techniques UNIT I PULSE MODULATION
More informationPart 3. Multiple Access Methods. p. 1 ELEC6040 Mobile Radio Communications, Dept. of E.E.E., HKU
Part 3. Multiple Access Methods p. 1 ELEC6040 Mobile Radio Communications, Dept. of E.E.E., HKU Review of Multiple Access Methods Aim of multiple access To simultaneously support communications between
More informationDigital Communications: The ABCs Of Ones And Zeroes
Digital Communications: The ABCs Of Ones And Zeroes August 04, 2010 12:00 AM!""#$%%&'&(")*+,(-&.,/+0(*1%2)",('&%(*113+,(2",*+.%-,/,"2'4(*113+,(2",*+.4"!&425(.4*64*+&.42+-47&)*&.02.#8 Electronic Design
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 informationBSc (Hons) Computer Science with Network Security. Examinations for Semester 1
BSc (Hons) Computer Science with Network Security Cohort: BCNS/15B/FT Examinations for 2015-2016 Semester 1 MODULE: DATA COMMUNICATIONS MODULE CODE: CAN1101C Duration: 2 Hours Instructions to Candidates:
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 informationChapter 7 Spread-Spectrum Modulation
Chapter 7 Spread-Spectrum Modulation Spread Spectrum Technique simply consumes spectrum in excess of the minimum spectrum necessary to send the data. 7.1 Introduction o Definition of spread-spectrum modulation
More informationEITF25 Internet Techniques and Applications L2: Physical layer. Stefan Höst
EITF25 Internet Techniques and Applications L2: Physical layer Stefan Höst Data vs signal Data: Static representation of information For storage Signal: Dynamic representation of information For transmission
More informationPerformance Analysis of n Wireless LAN Physical Layer
120 1 Performance Analysis of 802.11n Wireless LAN Physical Layer Amr M. Otefa, Namat M. ElBoghdadly, and Essam A. Sourour Abstract In the last few years, we have seen an explosive growth of wireless LAN
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 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 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 information