Browsing by Author "Hocevar , Dale"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Bit Interleaved Space-Time Codes
    (2001-09-20) Muharemovic, Tarik; Gatherer, Alan; Ebel, Will; Srihosour, Srinath; Hocevar , Dale; Huang, Everest; Center for Multimedia Communications (http://cmc.rice.edu/)
    We develop a new construction criterion for BSPK space-time codes which simultaneously reflects both "coding" and "diversity" advantage. Furthermore, we propose a new method of improving the performance of space-time codes, naemly bit interleaving. Subsequently we provide a computationally effective, iterative way of decoding bit interleaved space-time codes. At the end we note the 2dB gain due to the new approach. We note the sixteen state code which operates close to 3dB from the outage probability.
  • Thumbnail Image
    Item
    Improving Performance of a Space-Time Turbo Code in a Rayleigh Faded Channel
    (2001-10-20) Huang, Everest; Gatherer, Alan; Muharemovic, Tarik; Hocevar , Dale; Center for Multimedia Communications (http://cmc.rice.edu/)
    Starting with an ordinary parallel concatenated turbo encoder in a block fading Rayleigh channel, we introduce bit-interleaving of the outputs, not for time diversity, but to increase the coding gain. We develop a guideline metric for designing QPSK space-time codes which reveals both the coding and diversity advantage of the system, as well as shows that it is unnecessary to guarantee full space diversity to achieve good performance in Rayleigh fading. Using channel a priori information in the MAP interations for decoding, we achieve frame error rates within 1 dB of the outage probability with only modest increases in decoding complexity.
  • Thumbnail Image
    Item
    Space-Time Codes with Bit Interleaving
    (2001-11-20) Muharemovic, Tarik; Gatherer, Alan; Ebel, Will; Srihosour, Srinath; Hocevar , Dale; Huang, Everest; Center for Multimedia Communications (http://cmc.rice.edu/)
    We develop a new construction criterioin for BSPK space-time codes. Based on this criterion, we propose a new method of improving the performance of space-time codes, namely bit interleaving. Then, we provide a computationally effective, iterative way of decoding bit interleaved space-time codes. At the end, we note the 2dB gain due to the new approach. A proposed 16 state bit interleaved code operates close to 3dB from the outage probability.