Скачать презентацию Turbo Codes and Iterative Processing IEEE New Zealand Скачать презентацию Turbo Codes and Iterative Processing IEEE New Zealand

bae05770c10450cc7a42b56844eecc79.ppt

  • Количество слайдов: 35

Turbo Codes and Iterative Processing IEEE New Zealand Wireless Communications Symposium November 1998 VIRGINIA Turbo Codes and Iterative Processing IEEE New Zealand Wireless Communications Symposium November 1998 VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MPRG MOBILE & PORTABLE RADIO RESEARCH GROUP Matthew Valenti Mobile and Portable Radio Research Group Bradley Department of Electrical and Computer Engineering Virginia Tech Blacksburg, Virginia

Outline n Introduction u u n Turbo codes u u n Forward error correction Outline n Introduction u u n Turbo codes u u n Forward error correction (FEC) Channel capacity Encoding Decoding Performance analysis Applications Other applications of iterative processing u u Joint equalization/FEC Joint multiuser detection/FEC

Error Correction Coding n Channel coding adds structured redundancy to a transmission. Channel Encoder Error Correction Coding n Channel coding adds structured redundancy to a transmission. Channel Encoder u u n The input message m is composed of K symbols. The output code word x is composed of N symbols. Since N > K there is redundancy in the output. The code rate is r = K/N. Coding can be used to: u u Detect errors: ARQ Correct errors: FEC

Power Efficiency of Existing Standards Power Efficiency of Existing Standards

Turbo Codes n Backgound u u n Turbo codes were proposed by Berrou and Turbo Codes n Backgound u u n Turbo codes were proposed by Berrou and Glavieux in the 1993 International Conference in Communications. Performance within 0. 5 d. B of the channel capacity limit for BPSK was demonstrated. Features of turbo codes u u Parallel concatenated coding Recursive convolutional encoders Pseudo-random interleaving Iterative decoding

Motivation: Performance of Turbo Codes. Theoretical Limit! n Comparison: u u u n Rate Motivation: Performance of Turbo Codes. Theoretical Limit! n Comparison: u u u n Rate 1/2 Codes. K=5 turbo code. K=14 convolutional code. Plot is from: L. Perez, “Turbo Codes”, chapter 8 of Trellis Coding by C. Schlegel. IEEE Press, 1997. Gain of almost 2 d. B!

Concatenated Coding n n A single error correction code does not always provide enough Concatenated Coding n n A single error correction code does not always provide enough error protection with reasonable complexity. Solution: Concatenate two (or more) codes u n This creates a much more powerful code. Serial Concatenation (Forney, 1966) Outer Encoder Block Interleaver Inner Encoder Channel Outer Decoder Deinterleaver Inner Decoder

Parallel Concatenated Codes n Instead of concatenating in serial, codes can also be concatenated Parallel Concatenated Codes n Instead of concatenating in serial, codes can also be concatenated in parallel. The original turbo code is a parallel concatenation of two recursive systematic convolutional (RSC) codes. u systematic: one of the outputs is the input. Input Interleaver n Encoder #1 Systematic Output MUX Encoder #2 Parity Output

Pseudo-random Interleaving n The coding dilemma: u u n Shannon showed that large block-length Pseudo-random Interleaving n The coding dilemma: u u n Shannon showed that large block-length random codes achieve channel capacity. However, codes must have structure that permits decoding with reasonable complexity. Codes with structure don’t perform as well as random codes. “Almost all codes are good, except those that we can think of. ” Solution: u u Make the code appear random, while maintaining enough structure to permit decoding. This is the purpose of the pseudo-random interleaver. Turbo codes possess random-like properties. However, since the interleaving pattern is known, decoding is possible.

Recursive Systematic Convolutional Encoding n D D Constraint Length K= 3 n n D Recursive Systematic Convolutional Encoding n D D Constraint Length K= 3 n n D D n An RSC encoder can be constructed from a standard convolutional encoder by feeding back one of the outputs. An RSC encoder has an infinite impulse response. An arbitrary input will cause a “good” (high weight) output with high probability. Some inputs will cause “bad” (low weight) outputs.

Why Interleaving and Recursive Encoding? n In a coded systems: u n A “good” Why Interleaving and Recursive Encoding? n In a coded systems: u n A “good” code: u n will produce low weight outputs with very low probability. An RSC code: u u n Performance is dominated by low weight code words. Produces low weight outputs with fairly low probability. However, some inputs still cause low weight outputs. Because of the interleaver: u u The probability that both encoders have inputs that cause low weight outputs is very low. Therefore the parallel concatenation of both encoders will produce a “good” code.

Iterative Decoding Deinterleaver APP Decoder #1 systematic data parity data De. MUX Interleaver Decoder Iterative Decoding Deinterleaver APP Decoder #1 systematic data parity data De. MUX Interleaver Decoder #2 hard bit decisions Interleaver n n There is one decoder for each elementary encoder. Each decoder estimates the a posteriori probability (APP) of each data bit. The APP’s are used as a priori information by the other decoder. Decoding continues for a set number of iterations. u Performance generally improves from iteration to iteration, but follows a law of diminishing returns.

The Turbo-Principle n Turbo codes get their name because the decoder uses feedback, like The Turbo-Principle n Turbo codes get their name because the decoder uses feedback, like a turbo engine.

Performance as a Function of Number of Iterations n n n K=5 r=1/2 L=65, Performance as a Function of Number of Iterations n n n K=5 r=1/2 L=65, 536

The log-MAP algorithm 1/10 0/0 S 3 0/0 1 1 S 2 0 1/1 The log-MAP algorithm 1/10 0/0 S 3 0/0 1 1 S 2 0 1/1 0/0 0 1/1 1 S 1 11 1/ 0/00 S 0 i=1 i=2 i=3 The log-MAP algorithm: Performs arithmetic in the log domain Multiplies become additions Additions use the Jacobian Logarithm: i=4 i=5 i=6

Performance Factors and Tradeoffs n Complexity vs. performance u u u n Latency vs. Performance Factors and Tradeoffs n Complexity vs. performance u u u n Latency vs. performance u n Frame size. Spectral efficiency vs. performance u n Decoding algorithm. Number of iterations. Encoder constraint length Overall code rate Other factors u u u Interleaver design. Puncture pattern. Trellis termination.

Performance Bounds for Linear Block Codes n Union bound for soft-decision decoding: n For Performance Bounds for Linear Block Codes n Union bound for soft-decision decoding: n For convolutional and turbo codes this becomes: n The free-distance asymptote is the first term of the sum: n For convolutional codes N is unbounded and:

Free-distance Asymptotes n For convolutional code: u u n dfree = 18 Wdo = Free-distance Asymptotes n For convolutional code: u u n dfree = 18 Wdo = 187 For turbo code u u u dfree = 6 Nfree = 3 wfree = 2

Application: Turbo Codes for Wireless Multimedia n Multimedia systems require varying quality of service. Application: Turbo Codes for Wireless Multimedia n Multimedia systems require varying quality of service. u u Qo. S Latency F u Bit/frame error rate (BER, FER) F n Low latency for voice, teleconferencing Low BER for data transmission. The tradeoffs inherent in turbo codes match with the tradeoffs required by multimedia systems. u Data: use large frame sizes F u Low BER, but long latency Voice: use small frame sizes F Short latency, but higher BER

Influence of Interleaver Size n n n Constraint Length 5. Rate r = 1/2. Influence of Interleaver Size n n n Constraint Length 5. Rate r = 1/2. Log-MAP decoding. 18 iterations. AWGN Channel. Voice Video Conferencing Replayed Video Data

Application: Turbo Codes for Fading Channels n The turbo decoding algorithm requires accurate estimates Application: Turbo Codes for Fading Channels n The turbo decoding algorithm requires accurate estimates of channel parameters: u Branch metric: u Average signal-to-noise ratio (SNR). Fading amplitude. Phase. u u n Because turbo codes operate at low SNR, conventional methods for channel estimation often fail. u Therefore channel estimation and tracking is a critical issue with turbo codes.

Fading Channel Model n n Turbo Encoder Channel BPSK Interleaver Modulator Antipodal modulation: Gaussian Fading Channel Model n n Turbo Encoder Channel BPSK Interleaver Modulator Antipodal modulation: Gaussian Noise: n Complex Fading: u is a constant. F F u Turbo Decoder Deinterleaver BPSK Demod =0 for Rayleigh Fading >0 for Rician Fading X and Y are Gaussian random processes with autocorrelation:

Pilot Symbol Assisted Modulation n Pilot symbols: u u u Known values that are Pilot Symbol Assisted Modulation n Pilot symbols: u u u Known values that are periodically inserted into the transmitted code stream. Used to assist the operation of a channel estimator at the receiver. Allow for coherent detection over channels that are unknown and time varying. segment #1 symbol #1 segment #2 symbol #Mp pilot symbol #1 symbol #Mp pilot symbols added here symbol #Mp

Pilot Symbol Assisted Turbo Decoding Turbo Encoder Channel Interleaver Insert Pilot Symbols n n Pilot Symbol Assisted Turbo Decoding Turbo Encoder Channel Interleaver Insert Pilot Symbols n n Delay Filter n Compare to Threshold Channel Interleaver Insert Pilot Symbols n Remove Pilot Symbols Channel Deinterleaver Turbo Decoder Desired statistic: Initial estimates are found using pilot symbols only. Estimates for later iterations also use data decoded with high reliability. “Decision directed”

Performance of Pilot Symbol Assisted Decoding 1 10 n DPSK with differential detection BPSK Performance of Pilot Symbol Assisted Decoding 1 10 n DPSK with differential detection BPSK with estimation prior to decoding BPSK with refined estimation BPSK with perfect channel estimates 0 10 Simulation parameters: u Rayleigh flat-fading. u r=1/2, K=3 1, 024 bit random interleaver. 8 iterations of log-MAP. fd. Ts =. 005 Mp = 16 u u -1 10 u BER u -2 10 n n -3 10 n -4 10 -5 10 0 1 2 3 4 5 6 E b /N o in d. B 7 8 9 10 Estimation prior to decoding degrades performance by 2. 5 d. B. Estimation during decoding only degrades performance by 1. 5 d. B. Noncoherent reception degrades performance by 5 d. B.

Other Applications of Turbo Decoding n n The turbo-principle is more general than merely Other Applications of Turbo Decoding n n The turbo-principle is more general than merely its application to the decoding of turbo codes. The “Turbo Principle” can be described as: u “Never discard information prematurely that may be useful in making a decision until all decisions related to that information have been completed. ” -Andrew Viterbi u “It is a capital mistake to theorize before you have all the evidence. It biases the judgement. ” -Sir Arthur Conan Doyle n Can be used to improve the interface in systems that employ multiple trellis-based algorithms.

Applications of the Turbo Principle n Other applications of the turbo principle include: u Applications of the Turbo Principle n Other applications of the turbo principle include: u u Decoding serially concatenated codes. Combined equalization and error correction decoding. Combined multiuser detection and error correction decoding. (Spatial) diversity combining for coded systems in the presence of MAI or ISI.

Serial Concatenated Codes n The turbo decoder can also be used to decode serially Serial Concatenated Codes n The turbo decoder can also be used to decode serially concatenated codes. u Data Typically two convolutional codes. Outer Convolution al Encoder interleaver Inner Convolution al Encoder Turbo Decoder interleaver APP Inner Decode r deinterleav er n(t) AWGN Outer Decoder Estimated Data

Performance of Serial Concatenated Turbo Code n n n Plot is from: S. Benedetto, Performance of Serial Concatenated Turbo Code n n n Plot is from: S. Benedetto, et al “Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding” Proc. , Int. Symp. on Info. Theory, 1997. Rate r=1/3. Interleaver size L = 16, 384. K = 3 encoders. Serial concatenated codes do not seem to have a bit error rate floor.

Turbo Equalization n The “inner code” of a serial concatenation could be an Intersymbol Turbo Equalization n The “inner code” of a serial concatenation could be an Intersymbol Interference (ISI) channel. u Data ISI channel can be interpreted as a rate 1 code defined over the field of real numbers. (Outer) Convolution al Encoder interleaver ISI Channel Turbo Equalizer interleaver APP SISO Equaliz er deinterleav er n(t) AWGN (Outer) SISO Decoder Estimated Data

Performance of Turbo Equalizer n Plot is from: C. Douillard, et al “Iterative Correction Performance of Turbo Equalizer n Plot is from: C. Douillard, et al “Iterative Correction of Intersymbol Interference: Turbo. Equaliztion”, European Transactions on Telecommuications, Sept. /Oct. 1997. n M=5 independent multipaths. u u u n Symbol spaced paths Stationary channel. Perfectly known channel. (2, 1, 5) convolutional code.

Turbo Multiuser Detection n The “inner code” of a serial concatenation could be a Turbo Multiuser Detection n The “inner code” of a serial concatenation could be a multiple-access interference (MAI) channel. u u n MAI channel describes the interaction between K nonorthogonal users sharing the same channel. MAI channel can be thought of as a time varying ISI channel. MAI channel is a rate 1 code with time-varying coefficients over the field of real numbers. The input to the MAI channel consists of the encoded and interleaved sequences of all K users in the system. MAI channel can be: u u CDMA: Code Division Multiple Access TDMA: Time Division Multiple Access

System Diagram Convolution al Encoder #1 Convolution al Encoder #K “multiuser interleaver” interleaver #1 System Diagram Convolution al Encoder #1 Convolution al Encoder #K “multiuser interleaver” interleaver #1 Parallel to Serial MAI Channel n(t) AWGN interleaver #K Turbo MUD multiuser interleaver APP SISO MUD multiuser deinterleav er Bank of K SISO Decoders Estimated Data

Simulation Results: MAI Channel w/ AWGN n From: u n Generic MA system u Simulation Results: MAI Channel w/ AWGN n From: u n Generic MA system u u u n K=3 asynchronous users. Identical pulse shapes. Each user has its own interleaver. Convolutionally coded. u u n M. Moher, “An iterative algorithm for asynchronous coded multiuser detection, ” IEEE Comm. Letters, Aug. 1998. Constraint length 3. Code rate 1/2. Iterative decoder.

Conclusion n Turbo code advantages: u u n Turbo code disadvantages: u u u Conclusion n Turbo code advantages: u u n Turbo code disadvantages: u u u n Remarkable power efficiency in AWGN and flat-fading channels for moderately low BER. Deign tradeoffs suitable for delivery of multimedia services. Long latency. Poor performance at very low BER. Because turbo codes operate at very low SNR, channel estimation and tracking is a critical issue. The principle of iterative or “turbo” processing can be applied to other problems. u Turbo-multiuser detection can improve performance of coded multiple-access systems.