ACM Home Page
Please provide us with feedback. Feedback
Iterative decoding for the concatenated system of VLC and STTC in presence of channel estimation errors
Full text PdfPdf (340 KB)
Source
International Conference On Communications And Mobile Computing archive
Proceedings of the 2007 international conference on Wireless communications and mobile computing table of contents
Honolulu, Hawaii, USA
SESSION: Mobile computing symposium: multimedia coding and optimization table of contents
Pages: 671 - 676  
Year of Publication: 2007
ISBN:978-1-59593-695-0
Authors
Huijun Chen  The University of Mississippi, University, MS
Lei Cao  The University of Mississippi, University, MS
Sponsors
ACM: Association for Computing Machinery
SIGDOC : ACM Special Interest Group on Systems Documentation
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 35,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1280940.1281083
What is a DOI?

ABSTRACT

For wireless communications with limited bandwidth and fading channels, both source coding and MIMO techniqueare generally desired. In this paper, we consider the receiver design for a concatenated system with reversible variable length code (RVLC) and space time trellis code (STTC). The maximum a posteriori probability (MAP) decoding algorithm is adapted for both component decoders considering the facts that information are in both bit and symbol domains; systematic information are inseparable and the trellis structure of RVLC is non-symmetric. Conversion from the extrinsic information to the a priori information is also designed based on the modulation mode and mapping method. As a result, the decoding results of each component decoder can be utilized by the other component decoder iteratively so as to improve the overall decoding performance. The designed receiver is then tested for both quasi-static at and rapid fading channels when channel information is known to the receiver either perfectly or non-perfectly, which has shown significant improvement over the traditional receiver without iterative decoding.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Y. Takishima, M. Wada, and H. Murakami, "Reversible variable length codes," IEEE Transactions on Commununications, vol.43, pp. 158--162, Feb.-Apr. 1995.
 
2
V. Tarokh, N. Seshadri, and A. R. Calderbank, "Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction," IEEE Transaction on Information Theory, Vol. 44, No. 2, pp. 744--765, March 1998.
 
3
 
4
S. X. Ng, J. Y. Chung, F. Guo, and L. Hanzo, "A Turbo-detection Aided Serially Concatenated MPEG-4/TCM Videophone Transceiver," in IEEE Vehicular Technology Conference, pp. 2606--2610, 2004.
 
5
S. X. Ng, J. Wang, L.-L. Yang, and L. Hanzo, "Variable Length Space Time Coded Modulation," inIEEE Vehicular Technology Conference, pp. 1049--1053, 2005.
 
6
V. B. Balakirsky, "Joint source-channel coding with variable length codes," in Proc. IEEE Int. Symp. Information Theory, Jun. 1997, p.419.
 
7
D. Divsalar and F. Pollara, "Serial and Hybrid Concatenated Codes with Applications," International Symposium on Turbo Codes, Brest, France, 1997, pp. 80--87.
 
8
S. Benedetto and G. Montorsi, "Unveiling Turbo codes: some results on parallel concatenated coding schemes", IEEE Transactions on Information Theory, vol. 42, no. 2, March 1996.
 
9
Djordje Tujkovic, "Recursive Space-Time Trellis Codes for Turbo Coded Modulation," in Proc. IEEE Global Communications Conference GLOBECOM 2000, Vol. 2, pp.1010--1015, San Francisco, CAL, USA, November 27 -- December 1 2000.
 
10
L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Transactions on Information Theory, vol. IT-20, pp. 284--287, Mar. 1974.