Multiple-symbol detection of space-time differential codes (MS-STDC) decodes N consecutive space-time symbols using maximum likelihood (ML) sequence detection to gain in performance over the conventional differential detection scheme. However its computational complexity is exponential in N . A fast algorithm for implementing the MD-STDC in block-fading channels with complexity O(N 4) is developed. Its performance in both block-fading and symbol-by-symbol fading channels is demonstrated through simulations. Set partitioning in hierarchical trees (SPIHT) coupled with rate compatible punctured convolution code (RCPC) and cyclic redundancy check (CRC) is employed as a generalized multiple description source coder with robustness to channel errors. We propose a serial concatenation of the above with a differential space-time code (STDC) and invoke an iterative joint source channel decoding procedure for decoding differentially space-time coded multiple descriptions. Experiments show a gain of up to 5 dB in PSNR with four iterations for image transmission in the absence of channel state information (CSI) at the receiver. A serial concatenation of SPIHT
+ RCPC/CRC is also considered with space-time codes (STC) instead of STDC. Experiments show a gain of up to 7 dB with four iterations in the absence of CSI
| Identifer | oai:union.ndltd.org:tamu.edu/oai:repository.tamu.edu:1969.1/344 |
| Date | 30 September 2004 |
| Creators | Singhal, Rohit |
| Contributors | Wang, Xiaodong, Georghiades, Costas N. |
| Publisher | Texas A&M University |
| Source Sets | Texas A and M University |
| Language | en_US |
| Detected Language | English |
| Type | Book, Thesis, Electronic Thesis, text |
| Format | 582663 bytes, 56832 bytes, electronic, application/pdf, text/plain, born digital |
Page generated in 0.002 seconds