Statistical Communication Theory
|
|
- Katherine Webb
- 5 years ago
- Views:
Transcription
1 Statistical Communication Theory Mark Reed 1 1 National ICT Australia, Australian National University 21st February 26
2 Topic Formal Description of course:this course provides a detailed study of fundamental statistical principles that underpin this subject. Emphasis will be on a modern treatment of detection and estimation theory. Elements of modulation theory and channel coding will be introduced at specific points in the course to link up with practical realities of digital communications. Informal Description of course: The outcome of the course for interested students is a fundamental understanding of detection and estimation theory. The course will examine the underlying statistical tools to perform detection and estimation, including probability theory, detection theory, maximum likelihood detection with memory, MAP detection with memory, turbo processing, parameter estimation theory, synchronisation, channel state estimation and multiuser detection.
3 Housekeeping 1 lectures, 2hrs each, over approx. 1 weeks (see schedule) Mon 3th Jan 2-4pm Mon 6th Jan 2-4pm Mon 13th Feb 2-4pm Thur 23rd Feb 2-4pm Mon 27th Feb 2-4 Mon 6 March 2-4pm Mon 13 March 2-4pm Tue 21st March 1-12 Mon 1th April 2-4pm Mon 17th April 2-4pm Assessment, 4 assignments handed out during the course
4 Topic The proposed course outline is: - Introduction (Week 1) Historical Evolution of Digital Communications: How and Why The Challenge in Designing High-performance Receivers Detection and Estimation using Statistics Probability Theory and Statistics (Week 2) The Inference Problem Bayesian Theory Hypothesis Testing Hypothesis-Testing (M-ary) Parameter Estimation Channel Models Markov Models and Chains
5 - Detection Theory (Week 3) Gram-Schmidt Orthoganalization Matched Filtering Sufficient Statistics Detection Criteria The Receiver in its most Basic Form Receiver-operating Characteristic (ROC) and its Properties Bounds on Receiver Performance ML Detection with Memory (Week 4) Channel Memory The ML Criterion extended to deal with memory State and Trellis Diagram Dynamic Programming The Viterbi Algorithm Computational Limitations The SOVA Algorithm Theme Example - Viterbi Equalization for a Wireless Channel
6 MAP Detection with Memory (Week 5) The MAP Criteria Extended to Deal with Memory Two Basic Notions of Estimation Markov Chain Revisited The (BCJR) APP Algorithm Variants of the APP Algorithm Forward-backward Interpretation of the APP Algorithm Need for pre-processing Theme Example - MAP Equalization for a Wireless Channel Turbo Processing (Week 6) The Turbo Principle Concatenated Transmitter configurations Likelihood-ratio Calculations Turbo Decoding Turbo Equalization Analysis Schemes Complexity Reduction Strategies Theme Example: Turbo Equalization for a Wireless Channel
7 Parameter Estimation Theory (Week 7) Parameter Estimation in Digital Communication Receivers MSE, ML and MAP Estimation Procedures, and Their Statistical Properties Amplitude Estimation in Noise Phase/Frequency Estimation Timing Estimation Performance Bounds Synchronization (Week 8) The Receiver Synchronization Problem Signal Acquisition Signal Tracking Turbo Synchronization Theme Example: Turbo Phase Synchronization for a Wireless Channel
8 Channel State Estimation (Week 9) Pilot Assisted (Supervised) Training Approach Semi-blind State Estimation State-space Model of the Channel Kalman Filtering Strategy Particle Filtering Strategy Particle Filtering as a Feed-forward Method for Signal Tracking Theme Example: Turbo Phase Synchronization for a Wireless Channel Revisited Multi-user Detection (Week 1) The Multi-user Detection Problem Maximum Likelihood Detector (Optimum Detector) The Conventional Detector (Matched Filter) Successive Interference Cancellation Strategy Parallel Interference Cancellation Turbo Multi-user Detection Reduced Complexity Turbo Multi-user Receivers
9 ML Detection with Memory (Week 4) Channel Memory The ML Criterion extended to deal with memory State and Trellis Diagram Dynamic Programming The Viterbi Algorithm Computational Limitations The SOVA Algorithm Theme Example - Viterbi Equalization for a Wireless Channel
10 Detection for Channels without Memory Channel Model y j = b j + n j A-Posteriori Prob. (APP) Maximum- A-Posteriori (MAP) Pr{b j = b (m) y j } = p(y j b j = b (m) ) Pr{b j = b (m) } p(y j ) arg max b (m) Pr{b j = b (m) y j } = arg max b (m) p(y j b j = b (m) ) Pr{b j = b (m) } Maximum Likelihood (ML) Detection arg max Pr{b j = b (m) y j } = arg max b (m) p(y j b j = b (m) ).5.45 APP/MAP A-prior information provides hint of real data value Normalised Likelihood p(y mx=+1) =.243 y p(y j b j ) is a point from a Gaussian Distribution.15.1 mx= 1 mx=+1.5 p(y mx= 1)= Received value Turbo Receiver Design:From Principles to Practice c 24 Mark C. Reed. 24
11 The Channel Model is Detection for Channels with Memory y = b + n The APP outputs are Pr{b j = b y 1,, y j+m }. The MAP decision criterion is then ˆbj = arg max b ±1 Pr{b j = b y 1,, y j+m } = arg max b ±1 p(y 1,, y j+m b j = b) Pr{b j = b} p(y 1,, y j+m ) = arg max b ±1 p(y 1,, y j+m b j = b) Pr{b j = b}. Turbo Receiver Design:From Principles to Practice c 24 Mark C. Reed. 25
12 Dynamic Programming Published by Andrew Viterbi in 1967 as a decoder for convolutional codes Explained in more detail by Forney in 1972 Method also know as Maximum Likelihood sequence Estimation Finds best sequence but may not minimise probability of errors Method collapses infinite tree into a trellis for decoding Tree methods include Fano, Sequential decoding (Stack) algorithms
13 The Viterbi Algorithm 1 Compute the transition metric for bit k of the actual received signal and state v of the equalizer, where v =, 1, 2,..., 2 l 1 and l is the memory of the channel. 2 Compute the accumulated transition metric for every possible path in the trellis representing the equalizer. The metric for a particular path is defined as the squared Euclidean distance between the estimated received waveform represented by that path and the actual received waveform. For each node in the trellis, the Viterbi equalizer compares the two paths entering that node. The path with lower metric is retained, and the other path is discarded. 3 Repeat the computation for every bit of the received signal. 4 The survivor, or maximum likelihood sequence, path determined by the algorithm defines the most likely l-bit sequence. Typically the survivor path is selected after a delay equal to five times the memory of the channel.
14 Computational Limitations States of trellis grow exponentially with Memory of Channel If we are transmitting high order constellations (16-QAM) then number of states increase with M n M = cardinality of symbols (16-QAM this equals 4) n = memory of Channel e.g. memory 8, 16 QAM, States!! Lower complexity solutions are often required (eg) Multi-user detection for CDMA)
15 The SOVA Algorithm Produces A-Posteriori Probability (reliability value) for each bit Overcomes hard decision output from VA for a turbo system Saves delta value = max ACS value - min. ACS value Computes Likelihood See Hagenauer and Hoeher A Viterbi Algorithm with soft-decision outputs and its applications in Proc. IEEE Globecom (Dallas, U.S.A.) pp , 1989
16 Theme Example - Viterbi Equalization for a Wireless Channel
17 CHAPTER 1 THEMES This Chapter just contains all the themes I have to develop in one central place, latter on they will be shifted to each appropriate chapter. 1.1 THEME EXAMPLE - VITERBI EQUALIZATION FOR A WIRELESS CHANNEL Introduction The Viterbi Equalizer (VE) determines the maximum likelihood data sequence for an Inter- Symbol Interference channel. In a similar way to Viterbi decoding the VE searches over all possible transmitted data symbols to determine the maximum likelihood path. The fundamental differences in the channel model between a convolutional code and an ISI channel are:- 1. With an ISI Channel the code rate equals one (one output bit for every input bit) 2. The channel is a real code, where the different delayed outputs are added together as real numbers instead of modulo-2 arithmetric Transmitter and Channel Model Figure 1.1. shows a simple modulator and ISI channel, the modulator simply converts binary values to real values where a 1 and The input binary data is modulated, Statistical Communication Theory, First Edition. By Simon Haykin and Mark C. Reed ISBN c 26 John Wiley & Sons, Inc. 1
18 2 THEMES in this case we consider only the real channel, however this can be easily extended to a complex channel with complex valued coefficients, the input data can also be complex, representing QPSK or higher order modulation schemes. The ISI channel contains a delay line where each delay of the signal is multiplied by a different channel coefficient, labeled c 1 to c 4. In a mathematical form the ISI channel can be represented as y t = i=t+m i=t c i d i + n t (1.1) where d i represents the modulated data stream, c i represents the channel coefficients, and n t represents the additive white Gaussian noise term. The output of the ISI channel is /1 Input Data Stream Modulator -1/+1 T T T c 1 c 2 c 3 c 4 Sum Output Data Stream AWGN Figure 1.1. Modulator and ISI Channel. essentially the input data smeared with the ISI channel coefficients plus the additive white Gaussian noise (AWGN). This means that the received data is effected by the channel coefficients as well as the data values directly before and after the bit of interest. In this example we assume we know the coefficients of the ISI channel and the challenge is to detect the data values. If we can correctly detect the data values then we can achieve the performance of the channel without ISI (i.e. just effected by AWGN) otherwise if we just use conventional detection our performance will be severely degraded. Figure 1.2. shows the effect of ISI on a transmitted signal using the channel [.48,.815,.48]. The modulated data symbols with four times over sampling are shown as impulses with amplitude equal to one, this signal is then convolved with a low pass filter (in this case a root raised cosine filter with four times oversampling). The received signal without any ISI effects is then filtered again with the root raised cosine filter by again convolving this filter by the received waveform. This is shown as the dotted line and perfect sample restoration is possible (i.e. the filter output passes directly through the modulated data peaks). Now with the ISI channel inserted and convolving the received signal by the channel as well as the root raised cosine filter the received signal with ISI can be observed (solid line). It is clear here that the received signal has been significantly disturbed by the ISI. For example data sample three and four have different signs than the data transmitted. This diagram clearly shows the effect of ISI on a transmitted signal and the need for a method of removing it s effect Viterbi Equalization The Viterbi equalizer assumes knowledge of the channel coefficients and checks each possible data combination to determine the most likely sequence, essentially the steps in performing the Viterbi equalization function are:-
19 THEME EXAMPLE - VITERBI EQUALIZATION FOR A WIRELESS CHANNEL Modulated Data with 4x oversampling Matched Filtered Output No ISI Pulse and Channel Matched Filtered Output with ISI Amplitude Sample Number (4x Oversampling) Figure 1.2. Signals with and without ISI. 1. Compute the transition metric for bit k of the actual received signal and state v of the equalizer, where v =, 1, 2,..., 2 l 1 and l is the memory of the channel. 2. Compute the accumulated transition metric for every possible path in the trellis representing the equalizer. The metric for a particular path is defined as the squared Euclidean distance between the estimated received waveform represented by that path and the actual received waveform. For each node in the trellis, the Viterbi equalizer compares the two paths entering that node. The path with lower metric is retained, and the other path is discarded. 3. Repeat the computation for every bit of the received signal. 4. The survivor, or maximum likelihood sequence, path determined by the algorithm defines the most likely l-bit sequence. Typically the survivor path is selected after a delay equal to five times the memory of the channel. The trellis diagram for a ISI channel with memory two is shown in Figure 1.3. The states are labeled in the first column. For time point three the current state is represented by the data bits at time one and two while the transition represents the data at time three. For the time epoch four the current state now represents the data at time two and three, while the transition represents the data at time four. This continues for as long as the block of data maybe. In systems like telephone line modems the data is continuous so there is no end to this data sequence. For mobile phone systems like GSM [?] the data is blocked so special handling of the bits at the start and end of the block is needed to minimise errors and perform traceback. Figure 1.4. shows a bit error rate (BER) performance curve of the Viterbi equaliser, on the x-axis is the E b /N, or the energy per information bit divided by the noise, where the noise variance is σ 2 n = N /2. The y-axis shows the bit error rate or the probability of error.
20 4 THEMES d d d d d 3 d 4 d 4 d 5 d 5 d6 d 6 d 7 d 7 d d d 4 d 5 d 6 d 7 d Figure 1.3. Trellis Diagram for a memory two ISI channel. Ideally we want to have a low E b /N and have a low probability of error, thus the lower left hand corner of the graph is where we would ideally like to be. Our performance is however limited by the modulation and coding methods we use as well as the channel conditions. In this example we have no channel coding and our modulation is simply real BPSK. The ISI channel used is h = [.47,.815,.47], that is, a memory two channel with three channel coefficients. In the BER plot the AWGN performance is shown, this is to indicate the best possible performance that can be achieved if the equalizer can fully remove the interference. Also shown is the performance of a conventional detector, this detector simply makes the following decision, if the data value is positive then the data transmitted was +1, while if the data is negative then the data transmitted was 1. This conventional detector works fine in AWGN channels, however, with the introduction of the ISI the degradation in performance is substantial. So much so that performance at normal operating points of one error in 1 (BER = 1 2 or one error in is just not possible, regardless of the signal to noise ratio AWGN Simulated Performance Conventional Receiver Performance Viterbi Equalizer Performance. AWGN Performance BER E /N b Figure 1.4. Bit Error Rate performance of Viterbi Equalizer.
21 THEME EXAMPLE - VITERBI EQUALIZATION FOR A WIRELESS CHANNEL 5 For this channel the conventional receiver cannot overcome the ISI and the error rate is fixed to approximately.4 (four errors in every 1 bits) regardless of the signal to noise ratio. The Viterbi Equalizer can achieve low bit error rates for a given E b /N, for example for an operating point of one error in 1 bits (P e = 1 2 ) the Viterbi equalizer requires an E b /N = 7dB, while if there was no interference then the E b /N = 4dB. This demonstrates that although the Viterbi equalizer removes a large proportion of the interference, there is still some residual interference that remains. We will later demonstrate how this can be overcome A Small Example This example illustrates the advantage of performing equalization at the receiver. Ten data symbols are modulated and transmitted over an ISI channel, as used above. In Table 1.1. the trace values for the Viterbi Equalizer are shown. These indicate for the first ten data values received the most likely previous state from the current state and time interval. Therefore from the tenth symbol both state three and four say that the maximum likelihood sequence must go to state four, while state one and two believe the maximum likelihood sequence in the previous time interval must pass through state three. Table 1.1. Prefered Previous State values states \ time s= s= s= s= In Table 1.2. the accumulated metric values are shown for the first ten time intervals, each state has a value which corresponds to the trace values provided in Table 1.1. Here for example at time symbol ten the lowest metric is state three, therefore this is where the traceback should start in the preferred previous state Table 1.1. Tracing back the values from Table 1.2. Accumulated Transition Metric states \ time s= s= s= s= state three at the tenth time interval the previous states are then [3, 2, 3, 2, 1, 3, 2, 1, 1, 1] in reverse order read from right to left. The final transition is from state two at time one to state one at time zero. this transition represents a transmitted bit of +1(1), therefore this is the resultant answer of the Viterbi Equalizer. Table 1.3. shows the resultant detected values for the first ten data symbols transmitted, using the traceback path. Figure 1.5. shows the trellis for the ISI channel and the traceback path for our example. The output values can also be seen here, which are computed based on the path on the traceback. Typically only the last value in the traceback is output, however, at the end of a
22 6 THEMES Table 1.3. Detected Values Time Detected Values block the final traceback path is used to compute all values to the end of the block, in much the same way we have performed the task here. The bits closest to the end of the block have the least reliability as the traceback length is limited and therefore errors in the values can result (unless termination of the data is used). Time Output Figure 1.5. ISI Trellis showing Traceback and Output.
23 Assignment 1 Implement an orthogonisation algorithm and compare to qr() in MATLAB use a random matrix as input say a 1 by 1 provide the code of your implementation
24 Assignment 2 Implement an AFC loop to track a frequency offset in baseband Symbol Rate 15Hz, Frequency offset 5Hz Assume BPSK and sequence is known at rx Assume perfect timing information Provide Performance Plots (freq vs symbols) Determine 2nd order Filter Parameters Provide source code
25 References H. V. Poor An Introduction to Signal Detection and Estimation D. MacKay, Information Theory, Inference, and Learning Algorithms U. Mengali, Synchronization Techniques for Digital Receivers, Kluwer Academic/Plenum Publishers, C.. Helstrom, Elements of Signal Detection and Estimation Prentice-Hall G. Golub, C. Van Loan Matrix Computations R. Peterson R. Ziemer D. Borth Introduction to Spread Spectrum Communications Prentice-Hall
Proposed Graduate Course at ANU: Statistical Communication Theory
Proposed Graduate Course at ANU: Statistical Communication Theory Mark Reed mark.reed@nicta.com.au Title of the course: Statistical Communication Theory Course Director: Dr. Mark Reed (ANU Adjunct Fellow)
More informationNotes 15: Concatenated Codes, Turbo Codes and Iterative Processing
16.548 Notes 15: Concatenated Codes, Turbo Codes and Iterative Processing Outline! Introduction " Pushing the Bounds on Channel Capacity " Theory of Iterative Decoding " Recursive Convolutional Coding
More informationDepartment of Electronic Engineering FINAL YEAR PROJECT REPORT
Department of Electronic Engineering FINAL YEAR PROJECT REPORT BEngECE-2009/10-- Student Name: CHEUNG Yik Juen Student ID: Supervisor: Prof.
More informationChapter 3 Convolutional Codes and Trellis Coded Modulation
Chapter 3 Convolutional Codes and Trellis Coded Modulation 3. Encoder Structure and Trellis Representation 3. Systematic Convolutional Codes 3.3 Viterbi Decoding Algorithm 3.4 BCJR Decoding Algorithm 3.5
More informationStudy of Turbo Coded OFDM over Fading Channel
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 3, Issue 2 (August 2012), PP. 54-58 Study of Turbo Coded OFDM over Fading Channel
More informationConvolutional Coding Using Booth Algorithm For Application in Wireless Communication
Available online at www.interscience.in Convolutional Coding Using Booth Algorithm For Application in Wireless Communication Sishir Kalita, Parismita Gogoi & Kandarpa Kumar Sarma Department of Electronics
More informationISSN: International Journal of Innovative Research in Science, Engineering and Technology
ISSN: 39-8753 Volume 3, Issue 7, July 4 Graphical User Interface for Simulating Convolutional Coding with Viterbi Decoding in Digital Communication Systems using Matlab Ezeofor C. J., Ndinechi M.C. Lecturer,
More informationContents Chapter 1: Introduction... 2
Contents Chapter 1: Introduction... 2 1.1 Objectives... 2 1.2 Introduction... 2 Chapter 2: Principles of turbo coding... 4 2.1 The turbo encoder... 4 2.1.1 Recursive Systematic Convolutional Codes... 4
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 informationMaximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm
Maximum Likelihood Sequence Detection (MLSD) and the utilization of the Viterbi Algorithm Presented to Dr. Tareq Al-Naffouri By Mohamed Samir Mazloum Omar Diaa Shawky Abstract Signaling schemes with memory
More informationNear-Optimal Low Complexity MLSE Equalization
Near-Optimal Low Complexity MLSE Equalization Abstract An iterative Maximum Likelihood Sequence Estimation (MLSE) equalizer (detector) with hard outputs, that has a computational complexity quadratic in
More informationLab 3.0. Pulse Shaping and Rayleigh Channel. Faculty of Information Engineering & Technology. The Communications Department
Faculty of Information Engineering & Technology The Communications Department Course: Advanced Communication Lab [COMM 1005] Lab 3.0 Pulse Shaping and Rayleigh Channel 1 TABLE OF CONTENTS 2 Summary...
More informationTable of Contents. Acknowledgments... XVII Prologue... 1
Introduction to Spread-Spectrum Communications By Roger L. Peterson (Motorola), Rodger E. Ziemer (University of Co. at Colorado Springs), and David E. Borth (Motorola) Prentice Hall, 1995 (Navtech order
More informationEFFECTIVE CHANNEL CODING OF SERIALLY CONCATENATED ENCODERS AND CPM OVER AWGN AND RICIAN CHANNELS
EFFECTIVE CHANNEL CODING OF SERIALLY CONCATENATED ENCODERS AND CPM OVER AWGN AND RICIAN CHANNELS Manjeet Singh (ms308@eng.cam.ac.uk) Ian J. Wassell (ijw24@eng.cam.ac.uk) Laboratory for Communications Engineering
More informationAN INTRODUCTION TO ERROR CORRECTING CODES Part 2
AN INTRODUCTION TO ERROR CORRECTING CODES Part Jack Keil Wolf ECE 54 C Spring BINARY CONVOLUTIONAL CODES A binary convolutional code is a set of infinite length binary sequences which satisfy a certain
More informationECE 8771, Information Theory & Coding for Digital Communications Summer 2010 Syllabus & Outline (Draft 1 - May 12, 2010)
ECE 8771, Information Theory & Coding for Digital Communications Summer 2010 Syllabus & Outline (Draft 1 - May 12, 2010) Instructor: Kevin Buckley, Tolentine 433a, 610-519-5658 (W), 610-519-4436 (F), buckley@ece.vill.edu,
More informationImplementation of Different Interleaving Techniques for Performance Evaluation of CDMA System
Implementation of Different Interleaving Techniques for Performance Evaluation of CDMA System Anshu Aggarwal 1 and Vikas Mittal 2 1 Anshu Aggarwal is student of M.Tech. in the Department of Electronics
More informationA JOINT MODULATION IDENTIFICATION AND FREQUENCY OFFSET CORRECTION ALGORITHM FOR QAM SYSTEMS
A JOINT MODULATION IDENTIFICATION AND FREQUENCY OFFSET CORRECTION ALGORITHM FOR QAM SYSTEMS Evren Terzi, Hasan B. Celebi, and Huseyin Arslan Department of Electrical Engineering, University of South Florida
More informationChapter 9. Digital Communication Through Band-Limited Channels. Muris Sarajlic
Chapter 9 Digital Communication Through Band-Limited Channels Muris Sarajlic Band limited channels (9.1) Analysis in previous chapters considered the channel bandwidth to be unbounded All physical channels
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 informationMaster s Thesis Defense
Master s Thesis Defense Comparison of Noncoherent Detectors for SOQPSK and GMSK in Phase Noise Channels Afzal Syed August 17, 2007 Committee Dr. Erik Perrins (Chair) Dr. Glenn Prescott Dr. Daniel Deavours
More informationABHELSINKI UNIVERSITY OF TECHNOLOGY
CDMA receiver algorithms 14.2.2006 Tommi Koivisto tommi.koivisto@tkk.fi CDMA receiver algorithms 1 Introduction Outline CDMA signaling Receiver design considerations Synchronization RAKE receiver Multi-user
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 informationDecoding of Block Turbo Codes
Decoding of Block Turbo Codes Mathematical Methods for Cryptography Dedicated to Celebrate Prof. Tor Helleseth s 70 th Birthday September 4-8, 2017 Kyeongcheol Yang Pohang University of Science and Technology
More informationAn Energy-Division Multiple Access Scheme
An Energy-Division Multiple Access Scheme P Salvo Rossi DIS, Università di Napoli Federico II Napoli, Italy salvoros@uninait D Mattera DIET, Università di Napoli Federico II Napoli, Italy mattera@uninait
More informationBit-Interleaved Coded Modulation: Low Complexity Decoding
Bit-Interleaved Coded Modulation: Low Complexity Decoding Enis Aay and Ender Ayanoglu Center for Pervasive Communications and Computing Department of Electrical Engineering and Computer Science The Henry
More informationWireless Communication Systems Laboratory Lab#1: An introduction to basic digital baseband communication through MATLAB simulation Objective
Wireless Communication Systems Laboratory Lab#1: An introduction to basic digital baseband communication through MATLAB simulation Objective The objective is to teach students a basic digital communication
More informationPRINCIPLES OF COMMUNICATIONS
PRINCIPLES OF COMMUNICATIONS Systems, Modulation, and Noise SIXTH EDITION INTERNATIONAL STUDENT VERSION RODGER E. ZIEMER University of Colorado at Colorado Springs WILLIAM H. TRANTER Virginia Polytechnic
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 informationNear-Optimal Low Complexity MLSE Equalization
Near-Optimal Low Complexity MLSE Equalization HC Myburgh and Jan C Olivier Department of Electrical, Electronic and Computer Engineering, University of Pretoria RSA Tel: +27-12-420-2060, Fax +27 12 362-5000
More informationLecture 12: Summary Advanced Digital Communications (EQ2410) 1
: Advanced Digital Communications (EQ2410) 1 Monday, Mar. 7, 2016 15:00-17:00, B23 1 Textbook: U. Madhow, Fundamentals of Digital Communications, 2008 1 / 15 Overview 1 2 3 4 2 / 15 Equalization Maximum
More informationPerformance Analysis of Maximum Likelihood Detection in a MIMO Antenna System
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 2, FEBRUARY 2002 187 Performance Analysis of Maximum Likelihood Detection in a MIMO Antenna System Xu Zhu Ross D. Murch, Senior Member, IEEE Abstract In
More informationTHE EFFECT of multipath fading in wireless systems can
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 47, NO. 1, FEBRUARY 1998 119 The Diversity Gain of Transmit Diversity in Wireless Systems with Rayleigh Fading Jack H. Winters, Fellow, IEEE Abstract In
More informationPERFORMANCE ANALYSIS OF AN UPLINK MISO-CDMA SYSTEM USING MULTISTAGE MULTI-USER DETECTION SCHEME WITH V-BLAST SIGNAL DETECTION ALGORITHMS
PERFORMANCE ANALYSIS OF AN UPLINK MISO-CDMA SYSTEM USING MULTISTAGE MULTI-USER DETECTION SCHEME WITH V-BLAST SIGNAL DETECTION ALGORITHMS 1 G.VAIRAVEL, 2 K.R.SHANKAR KUMAR 1 Associate Professor, ECE Department,
More informationComparison of ML and SC for ICI reduction in OFDM system
Comparison of and for ICI reduction in OFDM system Mohammed hussein khaleel 1, neelesh agrawal 2 1 M.tech Student ECE department, Sam Higginbottom Institute of Agriculture, Technology and Science, Al-Mamon
More informationComparative Analysis of the BER Performance of WCDMA Using Different Spreading Code Generator
Science Journal of Circuits, Systems and Signal Processing 2016; 5(2): 19-23 http://www.sciencepublishinggroup.com/j/cssp doi: 10.11648/j.cssp.20160502.12 ISSN: 2326-9065 (Print); ISSN: 2326-9073 (Online)
More informationLow Complexity Decoding of Bit-Interleaved Coded Modulation for M-ary QAM
Low Complexity Decoding of Bit-Interleaved Coded Modulation for M-ary QAM Enis Aay and Ender Ayanoglu Center for Pervasive Communications and Computing Department of Electrical Engineering and Computer
More informationDetection and Estimation of Signals in Noise. Dr. Robert Schober Department of Electrical and Computer Engineering University of British Columbia
Detection and Estimation of Signals in Noise Dr. Robert Schober Department of Electrical and Computer Engineering University of British Columbia Vancouver, August 24, 2010 2 Contents 1 Basic Elements
More informationJoint Transmitter-Receiver Adaptive Forward-Link DS-CDMA System
# - Joint Transmitter-Receiver Adaptive orward-link D-CDMA ystem Li Gao and Tan. Wong Department of Electrical & Computer Engineering University of lorida Gainesville lorida 3-3 Abstract A joint transmitter-receiver
More informationA New Complexity Reduced Hardware Implementation of 16 QAM Using Software Defined Radio
A New Complexity Reduced Hardware Implementation of 16 QAM Using Software Defined Radio K.Bolraja 1, V.Vinod kumar 2, V.JAYARAJ 3 1Nehru Institute of Engineering and Technology, PG scholar, Dept. of ECE
More informationBit error rate simulation using 16 qam technique in matlab
Volume :2, Issue :5, 59-64 May 2015 www.allsubjectjournal.com e-issn: 2349-4182 p-issn: 2349-5979 Impact Factor: 3.762 Ravi Kant Gupta M.Tech. Scholar, Department of Electronics & Communication, Bhagwant
More informationThe Case for Optimum Detection Algorithms in MIMO Wireless Systems. Helmut Bölcskei
The Case for Optimum Detection Algorithms in MIMO Wireless Systems Helmut Bölcskei joint work with A. Burg, C. Studer, and M. Borgmann ETH Zurich Data rates in wireless double every 18 months throughput
More informationTHE computational complexity of optimum equalization of
214 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 53, NO. 2, FEBRUARY 2005 BAD: Bidirectional Arbitrated Decision-Feedback Equalization J. K. Nelson, Student Member, IEEE, A. C. Singer, Member, IEEE, U. Madhow,
More informationTCM-coded OFDM assisted by ANN in Wireless Channels
1 Aradhana Misra & 2 Kandarpa Kumar Sarma Dept. of Electronics and Communication Technology Gauhati University Guwahati-781014. Assam, India Email: aradhana66@yahoo.co.in, kandarpaks@gmail.com Abstract
More informationCHAPTER 3 ADAPTIVE MODULATION TECHNIQUE WITH CFO CORRECTION FOR OFDM SYSTEMS
44 CHAPTER 3 ADAPTIVE MODULATION TECHNIQUE WITH CFO CORRECTION FOR OFDM SYSTEMS 3.1 INTRODUCTION A unique feature of the OFDM communication scheme is that, due to the IFFT at the transmitter and the FFT
More informationPerformance of Wideband Mobile Channel with Perfect Synchronism BPSK vs QPSK DS-CDMA
Performance of Wideband Mobile Channel with Perfect Synchronism BPSK vs QPSK DS-CDMA By Hamed D. AlSharari College of Engineering, Aljouf University, Sakaka, Aljouf 2014, Kingdom of Saudi Arabia, hamed_100@hotmail.com
More informationUNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences EECS 121 FINAL EXAM
Name: UNIVERSIY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences Professor David se EECS 121 FINAL EXAM 21 May 1997, 5:00-8:00 p.m. Please write answers on
More informationLayered Space-Time Codes
6 Layered Space-Time Codes 6.1 Introduction Space-time trellis codes have a potential drawback that the maximum likelihood decoder complexity grows exponentially with the number of bits per symbol, thus
More informationModern Quadrature Amplitude Modulation Principles and Applications for Fixed and Wireless Channels
1 Modern Quadrature Amplitude Modulation Principles and Applications for Fixed and Wireless Channels W.T. Webb, L.Hanzo Contents PART I: Background to QAM 1 Introduction and Background 1 1.1 Modulation
More informationBLIND DETECTION OF PSK SIGNALS. Yong Jin, Shuichi Ohno and Masayoshi Nakamoto. Received March 2011; revised July 2011
International Journal of Innovative Computing, Information and Control ICIC International c 2012 ISSN 1349-4198 Volume 8, Number 3(B), March 2012 pp. 2329 2337 BLIND DETECTION OF PSK SIGNALS Yong Jin,
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 informationSimulink Modeling of Convolutional Encoders
Simulink Modeling of Convolutional Encoders * Ahiara Wilson C and ** Iroegbu Chbuisi, *Department of Computer Engineering, Michael Okpara University of Agriculture, Umudike, Abia State, Nigeria **Department
More informationOFDM and MC-CDMA A Primer
OFDM and MC-CDMA A Primer L. Hanzo University of Southampton, UK T. Keller Analog Devices Ltd., Cambridge, UK IEEE PRESS IEEE Communications Society, Sponsor John Wiley & Sons, Ltd Contents About the Authors
More informationON SYMBOL TIMING RECOVERY IN ALL-DIGITAL RECEIVERS
ON SYMBOL TIMING RECOVERY IN ALL-DIGITAL RECEIVERS 1 Ali A. Ghrayeb New Mexico State University, Box 30001, Dept 3-O, Las Cruces, NM, 88003 (e-mail: aghrayeb@nmsu.edu) ABSTRACT Sandia National Laboratories
More informationCOMMUNICATION SYSTEMS
COMMUNICATION SYSTEMS 4TH EDITION Simon Hayhin McMaster University JOHN WILEY & SONS, INC. Ш.! [ BACKGROUND AND PREVIEW 1. The Communication Process 1 2. Primary Communication Resources 3 3. Sources of
More informationRealization of Peak Frequency Efficiency of 50 Bit/Second/Hz Using OFDM MIMO Multiplexing with MLD Based Signal Detection
Realization of Peak Frequency Efficiency of 50 Bit/Second/Hz Using OFDM MIMO Multiplexing with MLD Based Signal Detection Kenichi Higuchi (1) and Hidekazu Taoka (2) (1) Tokyo University of Science (2)
More informationMITIGATING CARRIER FREQUENCY OFFSET USING NULL SUBCARRIERS
International Journal on Intelligent Electronic System, Vol. 8 No.. July 0 6 MITIGATING CARRIER FREQUENCY OFFSET USING NULL SUBCARRIERS Abstract Nisharani S N, Rajadurai C &, Department of ECE, Fatima
More information6. FUNDAMENTALS OF CHANNEL CODER
82 6. FUNDAMENTALS OF CHANNEL CODER 6.1 INTRODUCTION The digital information can be transmitted over the channel using different signaling schemes. The type of the signal scheme chosen mainly depends on
More informationPERFORMANCE EVALUATION OF WCDMA SYSTEM FOR DIFFERENT MODULATIONS WITH EQUAL GAIN COMBINING SCHEME
PERFORMANCE EVALUATION OF WCDMA SYSTEM FOR DIFFERENT MODULATIONS WITH EQUAL GAIN COMBINING SCHEME Rajkumar Gupta Assistant Professor Amity University, Rajasthan Abstract The performance of the WCDMA system
More informationPrinciples of Communication Systems
Principles of Communication Systems Course code: EEE351 (3+1) Prerequisites: EEE223 - Signal and Systems Co requisites: - Course Catalog Description: Introduction to communication systems: Fundamental
More informationAnalysis of Convolutional Encoder with Viterbi Decoder for Next Generation Broadband Wireless Access Systems
International Journal of Engineering and Technical Research (IJETR) ISSN: 2321-0869, Volume-3, Issue-4, April 2015 Analysis of Convolutional Encoder with Viterbi Decoder for Next Generation Broadband Wireless
More informationAdvanced channel coding : a good basis. Alexandre Giulietti, on behalf of the team
Advanced channel coding : a good basis Alexandre Giulietti, on behalf of the T@MPO team Errors in transmission are fowardly corrected using channel coding e.g. MPEG4 e.g. Turbo coding e.g. QAM source coding
More informationInternational Journal of Computer Trends and Technology (IJCTT) Volume 40 Number 2 - October2016
Signal Power Consumption in Digital Communication using Convolutional Code with Compared to Un-Coded Madan Lal Saini #1, Dr. Vivek Kumar Sharma *2 # Ph. D. Scholar, Jagannath University, Jaipur * Professor,
More informationOFDM Systems For Different Modulation Technique
Computing For Nation Development, February 08 09, 2008 Bharati Vidyapeeth s Institute of Computer Applications and Management, New Delhi OFDM Systems For Different Modulation Technique Mrs. Pranita N.
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 informationA Sphere Decoding Algorithm for MIMO
A Sphere Decoding Algorithm for MIMO Jay D Thakar Electronics and Communication Dr. S & S.S Gandhy Government Engg College Surat, INDIA ---------------------------------------------------------------------***-------------------------------------------------------------------
More informationA Novel Adaptive Method For The Blind Channel Estimation And Equalization Via Sub Space Method
A Novel Adaptive Method For The Blind Channel Estimation And Equalization Via Sub Space Method Pradyumna Ku. Mohapatra 1, Pravat Ku.Dash 2, Jyoti Prakash Swain 3, Jibanananda Mishra 4 1,2,4 Asst.Prof.Orissa
More informationGOPALAN COLLEGE OF ENGINEERING AND MANAGEMENT Electronics and communication Department
Appendix - F GOPALAN COLLEGE OF ENGINEERING AND MANAGEMENT Electronics and Department Academic Year: 2016-17 Semester: EVEN 6. COURSE PLAN Semester: VI Subject Code: 10EC61 Name of Subject: Digital Communication
More informationIMPROVED QR AIDED DETECTION UNDER CHANNEL ESTIMATION ERROR CONDITION
IMPROVED QR AIDED DETECTION UNDER CHANNEL ESTIMATION ERROR CONDITION Jigyasha Shrivastava, Sanjay Khadagade, and Sumit Gupta Department of Electronics and Communications Engineering, Oriental College of
More informationComputer Exercises in. Communication Theory SMS016
Luleå Tekniska Universitet Avd. för Signalbehandling Jan-Jaap van de Beek Frank Sjöberg Computer Exercises in Communication Theory SMS016 November 2001 Computer Exercises to be carried out in groups of
More informationPerformance of Combined Error Correction and Error Detection for very Short Block Length Codes
Performance of Combined Error Correction and Error Detection for very Short Block Length Codes Matthias Breuninger and Joachim Speidel Institute of Telecommunications, University of Stuttgart Pfaffenwaldring
More informationUNIT I Source Coding Systems
SIDDHARTH GROUP OF INSTITUTIONS: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code: DC (16EC421) Year & Sem: III-B. Tech & II-Sem Course & Branch: B. Tech
More informationTurbo Equalization: An Overview Michael Tüchler and Andrew C. Singer, Fellow, IEEE
920 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 57, NO 2, FEBRUARY 2011 Turbo Equalization: An Overview Michael Tüchler Andrew C Singer, Fellow, IEEE Dedicated to the memory of Ralf Koetter (1963 2009)
More informationExploring QAM using LabView Simulation *
OpenStax-CNX module: m14499 1 Exploring QAM using LabView Simulation * Robert Kubichek This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 1 Exploring
More informationDigital Modulation Schemes
Digital Modulation Schemes 1. In binary data transmission DPSK is preferred to PSK because (a) a coherent carrier is not required to be generated at the receiver (b) for a given energy per bit, the probability
More informationCOMPARISON OF CHANNEL ESTIMATION AND EQUALIZATION TECHNIQUES FOR OFDM SYSTEMS
COMPARISON OF CHANNEL ESTIMATION AND EQUALIZATION TECHNIQUES FOR OFDM SYSTEMS Sanjana T and Suma M N Department of Electronics and communication, BMS College of Engineering, Bangalore, India ABSTRACT In
More informationCognitive Radio Transmission Based on Chip-level Space Time Block Coded MC-DS-CDMA over Fast-Fading Channel
Journal of Scientific & Industrial Research Vol. 73, July 2014, pp. 443-447 Cognitive Radio Transmission Based on Chip-level Space Time Block Coded MC-DS-CDMA over Fast-Fading Channel S. Mohandass * and
More informationPerformance analysis of BPSK system with ZF & MMSE equalization
Performance analysis of BPSK system with ZF & MMSE equalization Manish Kumar Department of Electronics and Communication Engineering Swift institute of Engineering & Technology, Rajpura, Punjab, India
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 informationA Steady State Decoupled Kalman Filter Technique for Multiuser Detection
A Steady State Decoupled Kalman Filter Technique for Multiuser Detection Brian P. Flanagan and James Dunyak The MITRE Corporation 755 Colshire Dr. McLean, VA 2202, USA Telephone: (703)983-6447 Fax: (703)983-6708
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 informationField Experiments of 2.5 Gbit/s High-Speed Packet Transmission Using MIMO OFDM Broadband Packet Radio Access
NTT DoCoMo Technical Journal Vol. 8 No.1 Field Experiments of 2.5 Gbit/s High-Speed Packet Transmission Using MIMO OFDM Broadband Packet Radio Access Kenichi Higuchi and Hidekazu Taoka A maximum throughput
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 informationSNR Estimation in Nakagami-m Fading With Diversity Combining and Its Application to Turbo Decoding
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 50, NO. 11, NOVEMBER 2002 1719 SNR Estimation in Nakagami-m Fading With Diversity Combining Its Application to Turbo Decoding A. Ramesh, A. Chockalingam, Laurence
More informationAdaptive Kalman Filter based Channel Equalizer
Adaptive Kalman Filter based Bharti Kaushal, Agya Mishra Department of Electronics & Communication Jabalpur Engineering College, Jabalpur (M.P.), India Abstract- Equalization is a necessity of the communication
More informationInternational Journal of Scientific & Engineering Research Volume 9, Issue 3, March ISSN
International Journal of Scientific & Engineering Research Volume 9, Issue 3, March-2018 1605 FPGA Design and Implementation of Convolution Encoder and Viterbi Decoder Mr.J.Anuj Sai 1, Mr.P.Kiran Kumar
More informationS Laboratory Works in Radiocommunications RECEIVER
Laboratory Works in Radiocommunications RECEIVER 2 FREQUENCY RESPONSES 5 channel ZF equalizer system 5 H(f) [db] 5 5 2.5.5 2 2.5 3 freq Prerequisites: S-72.328 (or S-88.22), knowledge of MALAB. See the
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 informationPerformance Evaluation of V-Blast Mimo System in Fading Diversity Using Matched Filter
Performance Evaluation of V-Blast Mimo System in Fading Diversity Using Matched Filter Priya Sharma 1, Prof. Vijay Prakash Singh 2 1 Deptt. of EC, B.E.R.I, BHOPAL 2 HOD, Deptt. of EC, B.E.R.I, BHOPAL Abstract--
More informationDigital Signal Analysis
Digital Signal Analysis Objectives - Provide a digital modulation overview - Review common digital radio impairments Digital Modulation Overview Signal Characteristics to Modify Polar Display / IQ Relationship
More informationTABLE OF CONTENTS CHAPTER TITLE PAGE
TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK TABLE OF CONTENTS LIST OF TABLES LIST OF FIGURES LIST OF ABBREVIATIONS i i i i i iv v vi ix xi xiv 1 INTRODUCTION 1 1.1
More informationFund. of Digital Communications Ch. 3: Digital Modulation
Fund. of Digital Communications Ch. 3: Digital Modulation Klaus Witrisal witrisal@tugraz.at Signal Processing and Speech Communication Laboratory www.spsc.tugraz.at Graz University of Technology November
More informationModulation and Coding Tradeoffs
0 Modulation and Coding Tradeoffs Contents 1 1. Design Goals 2. Error Probability Plane 3. Nyquist Minimum Bandwidth 4. Shannon Hartley Capacity Theorem 5. Bandwidth Efficiency Plane 6. Modulation and
More informationPerformance Evaluation of ½ Rate Convolution Coding with Different Modulation Techniques for DS-CDMA System over Rician Channel
Performance Evaluation of ½ Rate Convolution Coding with Different Modulation Techniques for DS-CDMA System over Rician Channel Dilip Mandloi PG Scholar Department of ECE, IES, IPS Academy, Indore [India]
More informationMULTILEVEL CODING (MLC) with multistage decoding
350 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 3, MARCH 2004 Power- and Bandwidth-Efficient Communications Using LDPC Codes Piraporn Limpaphayom, Student Member, IEEE, and Kim A. Winick, Senior
More informationELT Receiver Architectures and Signal Processing Fall Mandatory homework exercises
ELT-44006 Receiver Architectures and Signal Processing Fall 2014 1 Mandatory homework exercises - Individual solutions to be returned to Markku Renfors by email or in paper format. - Solutions are expected
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 informationMultiuser Detection for Synchronous DS-CDMA in AWGN Channel
Multiuser Detection for Synchronous DS-CDMA in AWGN Channel MD IMRAAN Department of Electronics and Communication Engineering Gulbarga, 585104. Karnataka, India. Abstract - In conventional correlation
More informationSignal Processing in Mobile Communication Using DSP and Multi media Communication via GSM
Signal Processing in Mobile Communication Using DSP and Multi media Communication via GSM 1 M.Sivakami, 2 Dr.A.Palanisamy 1 Research Scholar, 2 Assistant Professor, Department of ECE, Sree Vidyanikethan
More informationSYSTEM MODEL. Transmitter Preamble Configuration
ACQUISITION FOR SATELLITE UMTS WITH LARGE FREQUENCY OFFSETS M. C. Reed Applicable Research and Technology Ascom Systec AG, Switzerland Ph: +41 62 889 5293 Fx: +41 62 889 529 mark.reed@ascom.ch Abstract-
More information