1. VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Combined Multiuser Reception and Channel Decoding for TDMA Cellular Systems 48th Annual Vehicular Technology Conference Ottawa, Canada May 21, 1998 Matthew Valenti and Brian D. Woerner Mobile and Portable Radio Research Group Virginia Tech Blacksburg, Virginia

2. 5/21/98 Introduction n Performance of multiple access systems can be improved by multiuser detection (MUD). u Verdu, Trans. Info. Theory ‘86. u Viterbi algorithm, complexity O(2 K ). n MUD for CDMA systems. u Jointly detect signals from the same cell. u Optimal MUD is too complex for large K. n MUD for TDMA systems. u Jointly detect signal from within the cell plus one or two strong interferers from other cells.

3. 5/21/98 Introduction MUD for Coded TDMA n TDMA systems use error correction coding. n Soft-decision decoding outperforms hard- decision decoding (2-2.5dB). n However, the optimal MUD passes hard- decisions to the channel decoder! n Don’t use optimal MUD if loss due to hard- decision decoding is greater than gain due to multiuser detection. n Alternatively, the interface between MUD and channel decoder could be improved.

4. 5/21/98 Introduction Outline of Talk n System Model. u bit asynchronous. u Generalized for both TDMA and CDMA. n MUD for TDMA. n Proposed Receiver Architecture. u Turbo processing. n Simulation results u RSC coded system. u 1 strong interferer. u SOVA decoders.

5. 5/21/98 System Model n Received Signal: n For TDMA: n Matched Filter Output: System Model

6. 5/21/98 MUD Optimal Multiuser Detection n Place y and b into vectors: n Compute cross-correlation matrix: n For the TDMA case the above reduces to:

7. 5/21/98 MUD Optimal MUD (Continued) n Run Viterbi algorithm with branch metric: u where n Note that the p(b) term is usually dropped. u The channel decoder will provide this value. n The algorithm produces hard bit decisions. u Not suitable for soft-decision channel decoding.

8. 5/21/98 MUD Soft-Output MUD n Several algorithms can be used to produce soft-output. n Trellis-based. u MAP algorithm F Log-MAP, Robertson et al, ICC ‘95 F OSOME, Hafeez & Stark, VTC ‘97 u SOVA algorithm F Hagenauer & Hoeher, Globecom ‘89 n Non-trellis-based. u Suboptimal, reduced complexity.

9. 5/21/98 System Model Proposed System Architecture n Each user interleaves its coded bits prior to transmission. n Initialize p(b i ) = 1/2 Matched Filters SISO Multiuser Detector Deinterleaver Interleaver Channel Estimator SISO Channel Decoders

10. 5/21/98 Example Simulation Parameters n 2 users u Desired user u 1 co-channel interferer with 3 dB less power. n Recursive Systematic Convolutional codes u Constraint length 3. u Rate 1/2. n SOVA decoding. u Both MUD and Channel decoder. u Normalized outputs, Papke et al, ICC ‘96.

11. 5/21/98 Example Simulation Details n “Conservative” approach taken u Only the desired user is decoded. F No channel decoder for interferer. u Only the APP of the systematic bits of the desired user is fed back to the MUD. F The APP for the parity bits are not computed or used.

12. Simulation Results: Existing Methods n At BER=10 -3 u MUD gain is 4.7 dB. u Coding gain is 6.7 dB. u Gain using hard output MUD and coding, 4.6 dB. n Therefore it does not make sense to use (hard- outut) MUD and channel coding. 4681012141618 10 -6 10 -5 10 -4 10 -3 10 -2 10 E b /N o in dB BER matched filter, uncoded multiuser detector (MUD), uncoded MUD, hard-decision decoding matched filter, soft-decision decoding

13. Simulation Results: New Method n The proposed iterative MUD / channel decoding strategy is used. n At BER 10 -5 u After 2 iterations, proposed method shows.4 dB improvement over channel decoding alone. u After 3 iterations, the additional gain is.6 dB. u No measurable gain for more than 3 iterations. 99.51010.51111.51212.51313.514 10 -6 10 -5 10 -4 10 -3 10 -2 E b /N o in dB BER matched filter, soft-decision decoding combined MUD/decoding, 2 iterations combined MUD/decoding, 3 iterations

14. 5/21/98 Conclusion n Optimal MUD can be used for TDMA. u However, if channel coding is used then the interface between MUD and decoder is critical. n A strategy for iterative MUD/channel decoding is proposed. u Based on the concept of turbo processing. n Proposed strategy was illustrated by simulation example. u Modest gain by using proposed strategy over channel coding alone.

15. 5/21/98 Conclusion Future Work n More aggressive use of soft-information. u Use parity information for RSC codes, or use conventional convolutional coding. u Decode the interfering user. n Share information among base stations. u Decode each user at the closest base station. u Send the results to all the other base stations. n Use MAP algorithm instead of SOVA. n Fading, channel estimation, and equalization.

16. 5/21/98 Conclusion Future Work n Combine MUD, decoding, and base station diversity. MUD at B.S. #1 MUD at B.S. #M Maximal Ratio Combining Bank of K SISO Channel Decoders

17. Simulation Results: Diversity Combining n 2 users and 2 base station. u At each B.S. closer user is 3 dB stronger than more distant one. n Rayleigh fading channel. n log-MAP decoder and MUD. n K=3 r=1/2 conventional convolutional code. n 4 dB gain after 1 iteration n 6 dB after 2 iterations. 02468101214 10 -5 10 -4 10 -3 10 -2 10 10 0 E b /N o in dB BER MUD and decoding only MUD/decoding/diversity: One iteration MUD/decoding/diversity: Two iterations