ECE Theses and Dissertations
Permanent URI for this collection
Browse
Browsing ECE Theses and Dissertations by Author "Amiri, Kiarash"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Architecture for detection in MIMO wireless systems(2007) Amiri, Kiarash; Cavallaro, Joseph R.In this work, we study two main classes of detectors for spatially multiplexed Multiple-input Multiple-output (MIMO) systems. For the first group, i.e. hard-decision detectors, we study sphere detectors, and propose novel algorithms as well as efficient architectures which make them suitable for low-complexity implementations. Furthermore, different variations of such detectors are prototyped on Xilinx FPGAs embedded on Wireless Open-access Research Platform (WARP). The second class of detectors are soft-decision detectors where, generally, soft sphere detectors are used; however, we study a new class of detectors that can serve the same purpose through a stochastic approach known as Markov Chain Monte Carlo (MCMC) technique. A general architecture with various complexity reduction techniques is proposed for this scenario, and it is shown that MCMC achieves better performance compared to sphere detector; while it requires less computation when higher order modulations are used.Item Cooperative Partial Detection for MIMO Relay Networks(Rice University, 2011) Amiri, Kiarash; Cavallaro, Joseph R.Cooperative communication has recently re-emerged as a possible paradigm shift to realize the promises of the ever increasing wireless communication market; how- ever, there have been few, if any, studies to translate theoretical results into feasi- ble schemes with their particular practical challenges. The multiple-input multiple- output (MIMO) technique is another method that has been recently employed in different standards and protocols, often as an optional scenario, to further improve the reliability and data rate of different wireless communication applications. In this work, we look into possible methods and algorithms for combining these two tech- niques to take advantage of the benefits of both. In this thesis, we will consider methods that consider the limitations of practical solutions, which, to the best of our knowledge, are the first time to be considered in this context. We will present complexity reduction techniques for MIMO systems in cooperative systems. Furthermore, we will present architectures for flexible and configurable MIMO detectors. These architectures could support a range of data rates, modulation orders and numbers of antennas, and therefore, are crucial in the different nodes of cooperative systems. The breadth-first search employed in our realization presents a large opportunity to exploit the parallelism of the FPGA in order to achieve high data rates. Algorithmic modifications to address potential sequential bottlenecks in the traditional bread-first search-based SD are highlighted in the thesis. We will present a novel Cooperative Partial Detection (CPD) approach in MIMO relay channels, where instead of applying the conventional full detection in the relay, the relay performs a partial detection and forwards the detected parts of the message to the destination. We will demonstrate how this approach leads to controlling the complexity in the relay and helping it choose how much it is willing to cooperate based on its available resources. We will discuss the complexity implications of this method, and more importantly, present hardware verification and over-the-air experimentation of CPD using the Wireless Open-access Research Platform (WARP).Item Cooperative Partial Detection for MIMO Relay Networks(2011) Amiri, Kiarash; Cavallaro, Joseph R.Cooperative communication has recently re-emerged as a possible paradigm shift to realize the promises of the ever increasing wireless communication market; however, there have been few, if any, studies to translate theoretical results into feasible schemes with their particular practical challenges. The multiple-input multipleoutput (MIMO) technique is another method that has been recently employed in different standards and protocols, often as an optional scenario, to further improve the reliability and data rate of different wireless communication applications. In this work, we look into possible methods and algorithms for combining these two techniques to take advantage of the benefits of both. In this thesis, we will consider methods that consider the limitations of practical solutions, which, to the best of our knowledge, are the first time to be considered in this context. We will present complexity reduction techniques for MIMO systems in cooperative systems. Furthermore, we will present architectures for flexible and iii configurable MIMO detectors. These architectures could support a range of data rates, modulation orders and numbers of antennas, and therefore, are crucial in the different nodes of cooperative systems. The breadth-first search employed in our realization presents a large opportunity to exploit the parallelism of the FPGA in order to achieve high data rates. Algorithmic modifications to address potential sequential bottlenecks in the traditional bread-first search-based SD are highlighted in the thesis. We will present a novel Cooperative Partial Detection (CPD) approach in MIMO relay channels, where instead of applying the conventional full detection in the relay, the relay performs a partial detection and forwards the detected parts of the message to the destination. We will demonstrate how this approach leads to controlling the complexity in the relay and helping it choose how much it is willing to cooperate based on its available resources. We will discuss the complexity implications of this method, and more importantly, present hardware verification and over-the-air experimentation of CPD using the Wireless Open-access Research Platform (WARP)