In this thesis we present the concept of concatenated multilevel codes. These codes are a combination of generalized concatenated codes with multilevel coding. The structure of these codes is simple and relies on the concatenation of two or more codes of shorter length. These codes can be designed to have large diversity which makes them attractive for use in fading channels. We also present an iterative decoding algorithm taylored to fit the properties of the proposed codes. The iterative decoding algorithm we present has a complexity comparable to the complexity of GMD decoding of the same codes. However, The gain obtained by using the iterative decoder as compared to GMD decdoing of these codes is quite high for Rayleigh fading channels at bit error rates of interest. Some bounds on the performance of these codes are given in this thesis. Some of the bounds are information theoretic bounds which can be used regardless of the code under study. Other bounds are on the error probability of concatenated multilevel codes. Finally we give examples on the implementation of these codes in adaptive coding of OFDM channels and MIMO channels. / QC 20100629
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-4011 |
| Date | January 2006 |
| Creators | Al-Askary, Omar |
| Publisher | KTH, Kommunikationssystem, CoS, Stockholm : KTH |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Doctoral thesis, monograph, info:eu-repo/semantics/doctoralThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | Trita-ICT-COS, 1653-6347 ; 0603 |
Page generated in 0.1038 seconds