1 / 12

ECE 5233 Satellite Communications

Prepared by: Dr . Ivica Kostanic Lecture 19: Multiple Access Schemes (4) (Section 6.8). ECE 5233 Satellite Communications. Spring 2011. Outline . CDMA principles CDMA transmission and reception DS-SS CDMA capacity Examples.

vicki
Télécharger la présentation

ECE 5233 Satellite Communications

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Prepared by: Dr. Ivica Kostanic Lecture 19: Multiple Access Schemes (4) (Section 6.8) ECE 5233 Satellite Communications Spring 2011

  2. Outline • CDMA principles • CDMA transmission and reception • DS-SS CDMA capacity • Examples Important note: Slides present summary of the results. Detailed derivations are given in notes.

  3. CDMA – basic principle • Code Division Multiple Access (CDMA) • Users are transmitting co-time and co-frequency • The signals from different users are separated by codes FDMA TDMA Common analogies used for the access schemes CDMA

  4. CDMA TXC and RX (single link) • At the TX - signal multiplied by a spreading sequence • Spreading sequence – code with higher data rate and god autocorrelation properties • Spread signal send to satellite and received by all earth stations • Received signal correlated with the same spreading code

  5. CDMA example – 2 Processing gain (PG) is the ratio of chip and bit rates Note: codes in this example are synchronized in time

  6. CDMA access • Signals from different earth stations are co-spectrum and co time • Signals are spread using codes that are orthogonal even when not synchronized • All signals are amplified by the transponder and send towards the ground • Transmission from the earth stations must me power managed so that the product of processing gain and power is constant – for all earth stations • If the earth stations have same processing gain – they should be received at the same power CDMA scheme

  7. PN sequences (AKA M-sequences) • Have “noise like” auto-correlation properties • Generated as output of shift registers that have taps indicated by primitive polynomials • Taps need to be in “special places” • Location of taps for different code lengths: http://www.newwaveinstruments.com/resources/articles/m_sequence_linear_feedback_shift_register_lfsr.htm Remember: 1 maps into -1 0 maps into 1 Shift register for generation of binary sequence

  8. M sequences - properties 1. An m-bit register produces an m-sequence of period 2m-1. 2. An m-sequence contains exactly 2(m-1) ones and 2(m-1)-1 zeros. 3. The modulo-2 sum of an m-sequence and another phase (i.e. time-delayed version) of the same sequence yields yet a third phase of the sequence. 3a. (A corollary of 3.) Each stage of an m-sequence generator runs through some phase of the sequence. (While this is obvious with a Fibonacci LFSR, it may not be with a Galois LFSR.) 4. A sliding window of length m, passed along an m-sequence for 2m-1 positions, will span every possible m-bit number, except all zeros, once and only once. That is, every state of an m-bit state register will be encountered, with the exception of all zeros. 5. Define a run of length r to be a sequence of r consecutive identical numbers, bracketed by non-equal numbers. Then in any m-sequence there are: 1 run of ones of length m.1 run of zeros of length m-1.1 run of ones and 1 run of zeros, each of length m-2.2 runs of ones and 2 runs of zeros, each of length m-3.4 runs of ones and 4 runs of zeros, each of length m-4.…2m-3 runs of ones and 2m-3 runs of zeros, each of length 1. 6. If an m-sequence is mapped to an analog time-varying waveform, by mapping each binary zero to 1 and each binary one to -1, then the autocorrelation function for the resulting waveform will be unity for zero delay, and -1/(2m-1) for any delay greater that one bit, either positive or negative in time. The shape of the autocorrelation function between -1 bit and +1 bit will be triangular, centered around time 0. That is, the function will rise linearly from time = -(one-bit) to time 0, and then decline linearly from time 0 to time = +(one-bit).

  9. Circular autocorrelation of PN sequence PN sequence of length N: Circular autocorrelation: Note: PN sequences are practically orthogonal to their delayed versions For PN sequences Consider N=15 sequence in the attached spreadsheet

  10. CDMA capacity On the ground S/N ratio for a given link (in dB) Consider Q identical earth stations using a transponder in a CDMA mode For large Q Therefore Solving for Q Max number of earth stations

  11. Example 1.Consider DS-CDMA system with processing gain of 1023. Required S/N at the output of the earth station receive is 12dB. Estimate the number of the earth stations that can be supported in the system 2. Example 6.8.1

  12. Homework Problems 6.5, 6.6 and 6.7

More Related