Show simple item record

dc.contributor Graduate Program in Electrical and Electronic Engineering.
dc.contributor.advisor Koca, Mutlu.
dc.contributor.author Kadı, Furkan Kerim.
dc.date.accessioned 2023-03-16T10:20:28Z
dc.date.available 2023-03-16T10:20:28Z
dc.date.issued 2019.
dc.identifier.other EE 2019 K35
dc.identifier.uri http://digitalarchive.boun.edu.tr/handle/123456789/12975
dc.description.abstract Spatial modulation is a novel modulation technique that utilize antenna space in addition to symbol space for information transmission. This technique is implemented with the well known BICM system to provide robustness and better error protection. This thesis focus on two main problems, how much coding is required for antenna and symbol bits and how equal or unequal coding strategies can be implemented to perform better on various channel conditions. To determine amount of required protection for antenna and symbol bits a new metric is developed. This metric also provide insight for system design in different channel conditions and for required coding strategies. Moreover, an upper bounding technique is developed for performance evaluation of both BICSM-EEP and BICSM-UEP systems with hard decision decoding. This tech nique is used for performance comparison of different coding schemes in various channel conditions and to develop best punctured code selection mechanism. Punctured con volutional codes are one of the most vital part of both BICSM-EEP and BICSM-UEP systems and because of that, their effect on implementing EEP or UEP coding strate gies are well investigated. Finally observations about factors that affect overall system performance of EEP and UEP systems are presented in light of comparative perfor mance analysis.
dc.format.extent 30 cm.
dc.publisher Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2019.
dc.subject.lcsh Spatial systems.
dc.subject.lcsh Coding theory.
dc.title BIT interleaved coded spatial modulation
dc.format.pages xvi, 54 leaves ;


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Digital Archive


Browse

My Account