Limited Feedback Techniques in Multiple Antenna Wireless Communication Systems

Multiple antenna systems provide spatial multiplexing and diversity benefits.These systems also offer beamforming and interference mitigation capabilities in single-user (SU) and multi-user (MU) scenarios, respectively. Although diversity can be achieved without channel state information (CSI) at the transmitter using space-time codes, the knowledge of instantaneous CSI at the transmitter is essential to the above mentioned gains. In frequency division duplexing (FDD) systems, limited feedback techniques are employed to obtain CSI at the transmitter from the receiver using a low-rate link. As a consequence, CSI acquired by the transmitter in such manner have errors due to channel estimation and codebook quantization at the receiver, resulting in performance degradation of multi-antenna systems. In this thesis, we examine CSI inaccuracies due to codebook quantization errors and investigate several other aspects of limited feedback in SU, MU and multicell wireless communication systems with various channel models. For SU multiple-input multiple-output (MIMO) systems, we examine the capacity loss using standard codebooks. In particular, we consider single-stream and two-stream MIMO transmissions and derive capacity loss expressions in terms of minimum squared chordal distance for various MIMO receivers. Through simulations, we investigate the impact of codebook quantization errors on the capacity performance in uncorrelated Rayleigh, spatially correlated Rayleigh and standardized MIMO channels. This work motivates the need of effective codebook design to reduce the codebook quantization errors in correlated channels. Subsequently, we explore the improvements in the design of codebooks in temporally and spatially correlated channels for MU multiple-input single-output (MISO) systems, by employing scaling and rotation techniques. These codebooks quantize instantaneous channel direction information (CDI) and are referred as differential codebooks in the thesis. We also propose various adaptive scaling techniques for differential codebooks where packing density of codewords in the differential codebook are altered according to the channel condition, in order to reduce the quantization errors. The proposed differential codebooks improve the spectral efficiency of the system by minimizing the codebook quantization errors in spatially and temporally correlated channels. Later, we broaden the scope to massive MISO systems and propose trellis coded quantization (TCQ) schemes to quantize CDI. Unlike conventional codebook approach, the TCQ scheme does not require exhaustive search to select an appropriate codeword, thus reducing computational complexity and memory requirement at the receiver. The proposed TCQ schemes yield significant performance improvements compared to the existing TCQ based limited feedback schemes in both temporally and spatially correlated channels. Finally, we investigate interference coordination for multicell MU MISO systems using regularized zero-forcing (RZF) precoding. We consider random vector quantization (RVQ) codebooks and uncorrelated Rayleigh channels. We derive expected SINR approximations for perfect CDI and RVQ codebook-based CDI. We also propose an adaptive bit allocation scheme which aims to minimize the network interference and moreover, improves the spectral efficiency compared to equal bit allocation and coordinated zero-forcing (ZF) based adaptive bit allocation schemes

Performance of Massive MIMO with Interference Decoding

In a massive MIMO system, base stations (BS) utilize a large number of antennas to simultaneously serve several (single or multi-antenna) users at once, where the number of BS antennas is normally assumed to be significantly larger than the number of users. In massive MIMO systems operating in time division duplex (TDD) mode, the channel state information (CSI) is estimated via uplink pilot sequences that are orthogonal in a cell but re-used in other cells. Re-using the pilots, however, contaminates the CSI estimate at BSs by the channel of the users sharing the same pilot in other cells; thus causing pilot contamination which creates coherent interference that, as the number of BS antennas grows, scales at the same rate as the desired signal. Hence, in the asymptotic limits of large antennas, the effects of non-coherent interference terms and noise disappear, except for the pilot contamination interference. A common technique used in the literature to deal with this interference is to treat it as noise (TIN). When using TIN, users' throughput will converge to a constant and thus the benefits of using an ever greater number of BS antennas saturate. However, it is known that the use of TIN in interference networks is only preferred in the weak interference regime, and it is sub-optimal in other regimes (e.g., moderate or strong interference). In this thesis, we show that as the number of BS antennas increases, the pilot contamination interference is no longer weak, and therefore it is beneficial to treat it differently (e.g., decode it jointly with the desired signal) to improve users’ throughput. In the first part of the thesis, we study the performance of interference decoding schemes based on simultaneous unique decoding (SD) and simultaneous non-unique decoding (SND), and show that by doing so the rate saturation effect is eliminated as the number of antennas increases; hence, the per-user rates grow unbounded. We analytically study the performance of two well-known linear combining/precoding methods, namely, MRC/MRT and ZF, for spatially correlated/uncorrelated Rayleigh fading channel models, and obtain closed-form expressions of rate lower bounds for these using a worst-case uncorrelated noise technique for multi-user channels. We compare the performance of the different interference management schemes, TIN/SD/SND, based on the maximum symmetric rate they can offer to the users. Specifically, we first obtain structural results for a symmetric two-cell setting as well as the high SINR regime, that provide insights into the benefits of using interference decoding schemes in different regimes of number of BS antennas. We numerically illustrate the performance of the different schemes and show that with a practical number of antennas, SND strictly outperforms TIN. This gain improves with increasing the number of antennas, and also ZF performs significantly better than MRC/MRT due to better mitigation of multi-user interference. Furthermore, we study the performance of regularized ZF (RZF) via Monte Carlo simulations, and observe that it achieves better rates than ZF for moderately small number of antennas only. Lastly, we numerically investigate the impact of increasing the number of cells, the cell radius, the number of users, the correlation of the channel across antennas and the degree of shadow fading on system performance. In the second part of the thesis, we study the performance of partial interference decoding based on rate splitting (RS) and non-unique decoding. Specifically, we propose to partition each user’s message into two independent layers, and partially decode the pilot contamination interference while treating the remaining part as noise based on a power splitting strategy. In particular, for a two-cell system, we investigate the benefits of an RS scheme based on the celebrated Han-Kobayashi (HK) region, which provides the best known achievable performance for a two-user interference channel (IC). In the case of more than two cells, we propose a generalized RS scheme that non-uniquely decodes each layer of the pilot contamination interference and uses only one power splitting coefficient per IC. In addition, we establish an achievable region for this generalized RS scheme using the non-unique decoding technique. In both cases of two cells and more than two cells and for a practical number of antennas, we numerically study the performance of the proposed RS schemes by numerically optimizing the power splitting coefficients, and show that they achieve significantly higher rates than TIN/SD/SND in all scenarios. Similar to the first part of the thesis, we also numerically examine the impact of increasing the number of cells, the cell radius, the number of users, the correlation of the channel across antennas and the degree of shadow fading on the performance of the RS schemes. Lastly, our simulation results reveal that by replacing the numerically optimized values of the power splitting coefficients with their pre-computed average values (over a large number of realizations), the performance loss is quite negligible, thus reducing the optimization complexity

Bandwidth-efficient communication systems based on finite-length low density parity check codes

Low density parity check (LDPC) codes are linear block codes constructed by pseudo-random parity check matrices. These codes are powerful in terms of error performance and, especially, have low decoding complexity. While infinite-length LDPC codes approach the capacity of communication channels, finite-length LDPC codes also perform well, and simultaneously meet the delay requirement of many communication applications such as voice and backbone transmissions. Therefore, finite-length LDPC codes are attractive to employ in low-latency communication systems. This thesis mainly focuses on the bandwidth-efficient communication systems using finite-length LDPC codes. Such bandwidth-efficient systems are realized by mapping a group of LDPC coded bits to a symbol of a high-order signal constellation. Depending on the systems' infrastructure and knowledge of the channel state information (CSI), the signal constellations in different coded modulation systems can be two-dimensional multilevel/multiphase constellations or multi-dimensional space-time constellations. In the first part of the thesis, two basic bandwidth-efficient coded modulation systems, namely LDPC coded modulation and multilevel LDPC coded modulation, are investigated for both additive white Gaussian noise (AWGN) and frequency-flat Rayleigh fading channels. The bounds on the bit error rate (BER) performance are derived for these systems based on the maximum likelihood (ML) criterion. The derivation of these bounds relies on the union bounding and combinatoric techniques. In particular, for the LDPC coded modulation, the ML bound is computed from the Hamming distance spectrum of the LDPC code and the Euclidian distance profile of the two-dimensional constellation. For the multilevel LDPC coded modulation, the bound of each decoding stage is obtained for a generalized multilevel coded modulation, where more than one coded bit is considered for level. For both systems, the bounds are confirmed by the simulation results of ML decoding and/or the performance of the ordered-statistic decoding (OSD) and the sum-product decoding. It is demonstrated that these bounds can be efficiently used to evaluate the error performance and select appropriate parameters (such as the code rate, constellation and mapping) for the two communication systems.The second part of the thesis studies bandwidth-efficient LDPC coded systems that employ multiple transmit and multiple receive antennas, i.e., multiple-input multiple-output (MIMO) systems. Two scenarios of CSI availability considered are: (i) the CSI is unknown at both the transmitter and the receiver; (ii) the CSI is known at both the transmitter and the receiver. For the first scenario, LDPC coded unitary space-time modulation systems are most suitable and the ML performance bound is derived for these non-coherent systems. To derive the bound, the summation of chordal distances is obtained and used instead of the Euclidean distances. For the second case of CSI, adaptive LDPC coded MIMO modulation systems are studied, where three adaptive schemes with antenna beamforming and/or antenna selection are investigated and compared in terms of the bandwidth efficiency. For uncoded discrete-rate adaptive modulation, the computation of the bandwidth efficiency shows that the scheme with antenna selection at the transmitter and antenna combining at the receiver performs the best when the number of antennas is small. For adaptive LDPC coded MIMO modulation systems, an achievable threshold of the bandwidth efficiency is also computed from the ML bound of LDPC coded modulation derived in the first part

MIMO Systems

In recent years, it was realized that the MIMO communication systems seems to be inevitable in accelerated evolution of high data rates applications due to their potential to dramatically increase the spectral efficiency and simultaneously sending individual information to the corresponding users in wireless systems. This book, intends to provide highlights of the current research topics in the field of MIMO system, to offer a snapshot of the recent advances and major issues faced today by the researchers in the MIMO related areas. The book is written by specialists working in universities and research centers all over the world to cover the fundamental principles and main advanced topics on high data rates wireless communications systems over MIMO channels. Moreover, the book has the advantage of providing a collection of applications that are completely independent and self-contained; thus, the interested reader can choose any chapter and skip to another without losing continuity

Performance of quantized random beamforming in delay-tolerant machine-type communication

Machine-to-machine (M2M) communication represents a new paradigm for mobile cellular networks, where a massive number of low-cost devices request the transfer of small amounts of data without human intervention. One option to tackle this problem is obtained by combining random beamforming (RBF) with opportunistic scheduling. RBF can be used to induce larger channel fluctuations, and opportunistic scheduling can be used to select M2M devices when their overall channel quality is good. Traditional RBF does not fulfill M2M requirements, because overall channel quality needs to be tracked continuously. In order to tackle this limitation, a novel codebook-based RBF architecture that identifies in advance the time instants in which overall channel quality should be reported, within a coherence time window, is proposed. This opportunistic feedback mechanism reduces signaling overhead and enables energy saving at M2M devices. A simplified methodology is presented to evaluate the system mean data rate, using for this purpose closed form formulas derived from SNR distribution approximations. Results reveal that the performance loss that is experienced for introducing the proposed modifications to traditional RBF scheme is negligible. The concepts analyzed in this paper provide useful insights, and show that codebook-based RBF with simplified opportunistic scheduling algorithms is an excellent combination to provide wide-area M2M services with low-cost devices and limited signaling overhead.Fil: Dowhuszko, Alexis Alfredo. Centre Tecnològic de Les Telecomunicacions de Catalunya; España. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Corral Briones, Graciela. Universidad Nacional de Córdoba; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Estudios Avanzados en Ingeniería y Tecnología. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Estudios Avanzados en Ingeniería y Tecnología; ArgentinaFil: Hamalainen, Jyri. Aalto University; FinlandiaFil: Wichman, Risto Ilari. Aalto University; Finlandi

Initial Synchronisation in the Multiple-Input Multiple-Output Aided Single- and Multi-Carrier DS-CDMA as well as DS-UWB Downlink

In this thesis, we propose and investigate code acquisition schemes employing both colocated and cooperative Multiple Input/Multiple Output (MIMO) aided Single-Carrier (SC) and Multi-Carrier (MC) Code Division Multiple Access (CDMA) DownLink (DL) schemes. We study their characteristics and performance in terms of both Non-Coherent (NC) and Differentially Coherent (DC) MIMO scenarios. Furthermore, we also propose iterative code acquisition schemes for the Direct Sequence-Ultra WideBand (DS-UWB) DL. There is a paucity of code acquisition techniques designed for transmit diversity aided systems. Moreover, there are no in-depth studies representing the fundamental characteristics of code acquisition schemes employing both co-located and cooperative MIMOs. Hence we investigate both NC and DC code acquisition schemes in the co-located and cooperative MIMO aided SC and MC DS-CDMA DL, when communicating over spatially uncorrelated Rayleigh channels. The issues of NC initial and post-initial acquisition schemes as well as DC schemes are studied as a function of the number of co-located antennas by quantifying the attainable correct detection probability and mean acquisition time performances. The research of DS-UWB systems has recently attracted a significant interest in both the academic and industrial community. In the DS-UWB DL, initial acquisition is required for both coarse timing as well as code phase alignment. Both of these constitute a challenging problem owing to the extremely short chip-duration of UWB systems. This leads to a huge acquisition search space size, which is represented as the product of the number of legitimate code phases in the uncertainty region of the PN code and the number of legitimate signalling pulse positions. Therefore the benefits of the iterative code acquisition schemes are analysed in terms of the achievable correct detection probability and mean acquisition time performances. Hence we significantly reduce the search space size with the aid of a Tanner graph based Message Passing (MP) technique, which is combined with the employment of beneficially selected generator polynomials, multiple receive antennas and appropriately designed multiple-component decoders. Finally, we characterise a range of two-stage iterative acquisition schemes employing iterative MP designed for a multiple receive antenna assisted DS-UWB DL scenario

Analyse et modélisation du canal radio pour la génération de clés secrètes

Nowadays, the security of ubiquitous wireless communications becomes more and more a crucial requirement. Even though data is widely protected via symmetric ciphering keys, a well-known difficulty is the generation and distribution of such keys. In the recent years therefore, a set of works have addressed the exploitation of inherent characteristics of the fading propagation channel for security. In particular, secret keys could be generated from the wireless channel, considered as a shared source of randomness, available merely to a pair of communicating entities. ln the present dissertation, we are interested in the approach of secret key generation (SKG) from wireless channels, especially in relating the radio channel properties to the generated keys quality. We first develop a stochastic channel model, focusing on the security with respect to the eavesdropper side, which shows a residual channel memory weil beyond a few wavelengths distance (spatially nonstationary scenarios). Then, we analyze the channel degrees of freedom (DoF) and their impact on the SKG performance in different channel conditions, especially by considering more realistic channels in both outdoor and indoor environments (respectively through simulated ray tracing data and through measurements). The results show that, even for moderately wide band (such as standardized in IEEE 802.11), the sole frequency DOF or its association with the spatial DOF is often enough for generating long keys, provided an efficient quantization method of the complex channel coefficients is used.La sécurité des communications sans fil omniprésentes devient, ces dernières années, de plus en plus une exigence incontournable. Bien que la cryptographie symétrique assure largement la confidentialité des données, la difficulté concerne la génération et la distribution de clés secrètes. Récemment, des études indiquent que les caractéristiques inhérentes du canal de propagation peuvent être exploitées afin de consolider la sécurité. En particulier, le canal radio fournit en effet une source d'aléa commune à deux utilisateurs à partir de laquelle des clés secrètes peuvent être générées. Dans la présente dissertation, nous nous intéressons au processus de génération de clés secrètes (SKG), tout en reliant les propriétés du canal radio à la qualité des clés générées. D'abord nous développons un modèle du canal stochastique, traitant la sécurité du point de vue de l'espion, qui montre une mémoire de canal résiduelle bien au-delà d'une distance de quelques longueurs d'onde (scénarios spatialement non-stationnaires). Ensuite, nous exploitons les degrés de liberté (DOF) du canal et analysons leur impact sur la performance de SKG dans différentes conditions, tout en considérant des canaux plus réalistes en environnements extérieur et intérieur (respectivement grâce à des données déterministes simulées et à des mesures). Les résultats montrent que, même pour des bandes modérées (comme standardisées dans la norme IEEE 802.11), le seul DoF de fréquence ou de son association avec le DoF spatial est souvent suffisant pour générer des longues clés, à condition d'utiliser une méthode efficace de quantification des coefficients complexes du canal

Transmission strategies for broadband wireless systems with MMSE turbo equalization

This monograph details efficient transmission strategies for single-carrier wireless broadband communication systems employing iterative (turbo) equalization. In particular, the first part focuses on the design and analysis of low complexity and robust MMSE-based turbo equalizers operating in the frequency domain. Accordingly, several novel receiver schemes are presented which improve the convergence properties and error performance over the existing turbo equalizers. The second part discusses concepts and algorithms that aim to increase the power and spectral efficiency of the communication system by efficiently exploiting the available resources at the transmitter side based upon the channel conditions. The challenging issue encountered in this context is how the transmission rate and power can be optimized, while a specific convergence constraint of the turbo equalizer is guaranteed.Die vorliegende Arbeit beschäftigt sich mit dem Entwurf und der Analyse von effizienten Übertragungs-konzepten für drahtlose, breitbandige Einträger-Kommunikationssysteme mit iterativer (Turbo-) Entzerrung und Kanaldekodierung. Dies beinhaltet einerseits die Entwicklung von empfängerseitigen Frequenzbereichs-entzerrern mit geringer Komplexität basierend auf dem Prinzip der Soft Interference Cancellation Minimum-Mean Squared-Error (SC-MMSE) Filterung und andererseits den Entwurf von senderseitigen Algorithmen, die durch Ausnutzung von Kanalzustandsinformationen die Bandbreiten- und Leistungseffizienz in Ein- und Mehrnutzersystemen mit Mehrfachantennen (sog. Multiple-Input Multiple-Output (MIMO)) verbessern. Im ersten Teil dieser Arbeit wird ein allgemeiner Ansatz für Verfahren zur Turbo-Entzerrung nach dem Prinzip der linearen MMSE-Schätzung, der nichtlinearen MMSE-Schätzung sowie der kombinierten MMSE- und Maximum-a-Posteriori (MAP)-Schätzung vorgestellt. In diesem Zusammenhang werden zwei neue Empfängerkonzepte, die eine Steigerung der Leistungsfähigkeit und Verbesserung der Konvergenz in Bezug auf existierende SC-MMSE Turbo-Entzerrer in verschiedenen Kanalumgebungen erzielen, eingeführt. Der erste Empfänger - PDA SC-MMSE - stellt eine Kombination aus dem Probabilistic-Data-Association (PDA) Ansatz und dem bekannten SC-MMSE Entzerrer dar. Im Gegensatz zum SC-MMSE nutzt der PDA SC-MMSE eine interne Entscheidungsrückführung, so dass zur Unterdrückung von Interferenzen neben den a priori Informationen der Kanaldekodierung auch weiche Entscheidungen der vorherigen Detektions-schritte berücksichtigt werden. Durch die zusätzlich interne Entscheidungsrückführung erzielt der PDA SC-MMSE einen wesentlichen Gewinn an Performance in räumlich unkorrelierten MIMO-Kanälen gegenüber dem SC-MMSE, ohne dabei die Komplexität des Entzerrers wesentlich zu erhöhen. Der zweite Empfänger - hybrid SC-MMSE - bildet eine Verknüpfung von gruppenbasierter SC-MMSE Frequenzbereichsfilterung und MAP-Detektion. Dieser Empfänger besitzt eine skalierbare Berechnungskomplexität und weist eine hohe Robustheit gegenüber räumlichen Korrelationen in MIMO-Kanälen auf. Die numerischen Ergebnisse von Simulationen basierend auf Messungen mit einem Channel-Sounder in Mehrnutzerkanälen mit starken räumlichen Korrelationen zeigen eindrucksvoll die Überlegenheit des hybriden SC-MMSE-Ansatzes gegenüber dem konventionellen SC-MMSE-basiertem Empfänger. Im zweiten Teil wird der Einfluss von System- und Kanalmodellparametern auf die Konvergenzeigenschaften der vorgestellten iterativen Empfänger mit Hilfe sogenannter Korrelationsdiagramme untersucht. Durch semi-analytische Berechnungen der Entzerrer- und Kanaldecoder-Korrelationsfunktionen wird eine einfache Berechnungsvorschrift zur Vorhersage der Bitfehlerwahrscheinlichkeit von SC-MMSE und PDA SC-MMSE Turbo Entzerrern für MIMO-Fadingkanäle entwickelt. Des Weiteren werden zwei Fehlerschranken für die Ausfallwahrscheinlichkeit der Empfänger vorgestellt. Die semi-analytische Methode und die abgeleiteten Fehlerschranken ermöglichen eine aufwandsgeringe Abschätzung sowie Optimierung der Leistungsfähigkeit des iterativen Systems. Im dritten und abschließenden Teil werden Strategien zur Raten- und Leistungszuweisung in Kommunikationssystemen mit konventionellen iterativen SC-MMSE Empfängern untersucht. Zunächst wird das Problem der Maximierung der instantanen Summendatenrate unter der Berücksichtigung der Konvergenz des iterativen Empfängers für einen Zweinutzerkanal mit fester Leistungsallokation betrachtet. Mit Hilfe des Flächentheorems von Extrinsic-Information-Transfer (EXIT)-Funktionen wird eine obere Schranke für die erreichbare Ratenregion hergeleitet. Auf Grundlage dieser Schranke wird ein einfacher Algorithmus entwickelt, der für jeden Nutzer aus einer Menge von vorgegebenen Kanalcodes mit verschiedenen Codierraten denjenigen auswählt, der den instantanen Datendurchsatz des Mehrnutzersystems verbessert. Neben der instantanen Ratenzuweisung wird auch ein ausfallbasierter Ansatz zur Ratenzuweisung entwickelt. Hierbei erfolgt die Auswahl der Kanalcodes für die Nutzer unter Berücksichtigung der Einhaltung einer bestimmten Ausfallwahrscheinlichkeit (outage probability) des iterativen Empfängers. Des Weiteren wird ein neues Entwurfskriterium für irreguläre Faltungscodes hergeleitet, das die Ausfallwahrscheinlichkeit von Turbo SC-MMSE Systemen verringert und somit die Zuverlässigkeit der Datenübertragung erhöht. Eine Reihe von Simulationsergebnissen von Kapazitäts- und Durchsatzberechnungen werden vorgestellt, die die Wirksamkeit der vorgeschlagenen Algorithmen und Optimierungsverfahren in Mehrnutzerkanälen belegen. Abschließend werden außerdem verschiedene Maßnahmen zur Minimierung der Sendeleistung in Einnutzersystemen mit senderseitiger Singular-Value-Decomposition (SVD)-basierter Vorcodierung untersucht. Es wird gezeigt, dass eine Methode, welche die Leistungspegel des Senders hinsichtlich der Bitfehlerrate des iterativen Empfängers optimiert, den konventionellen Verfahren zur Leistungszuweisung überlegen ist

Initial synchronisation in the multiple-input multiple-output aided single- and multi-carrier DS-CDMA as well as DS-UWB downlink

In this thesis, we propose and investigate code acquisition schemes employing both colocated and cooperative Multiple Input/Multiple Output (MIMO) aided Single-Carrier (SC) and Multi-Carrier (MC) Code Division Multiple Access (CDMA) DownLink (DL) schemes. We study their characteristics and performance in terms of both Non-Coherent (NC) and Differentially Coherent (DC) MIMO scenarios. Furthermore, we also propose iterative code acquisition schemes for the Direct Sequence-Ultra WideBand (DS-UWB) DL. There is a paucity of code acquisition techniques designed for transmit diversity aided systems. Moreover, there are no in-depth studies representing the fundamental characteristics of code acquisition schemes employing both co-located and cooperative MIMOs. Hence we investigate both NC and DC code acquisition schemes in the co-located and cooperative MIMO aided SC and MC DS-CDMA DL, when communicating over spatially uncorrelated Rayleigh channels. The issues of NC initial and post-initial acquisition schemes as well as DC schemes are studied as a function of the number of co-located antennas by quantifying the attainable correct detection probability and mean acquisition time performances. The research of DS-UWB systems has recently attracted a significant interest in both the academic and industrial community. In the DS-UWB DL, initial acquisition is required for both coarse timing as well as code phase alignment. Both of these constitute a challenging problem owing to the extremely short chip-duration of UWB systems. This leads to a huge acquisition search space size, which is represented as the product of the number of legitimate code phases in the uncertainty region of the PN code and the number of legitimate signalling pulse positions. Therefore the benefits of the iterative code acquisition schemes are analysed in terms of the achievable correct detection probability and mean acquisition time performances. Hence we significantly reduce the search space size with the aid of a Tanner graph based Message Passing (MP) technique, which is combined with the employment of beneficially selected generator polynomials, multiple receive antennas and appropriately designed multiple-component decoders. Finally, we characterise a range of two-stage iterative acquisition schemes employing iterative MP designed for a multiple receive antenna assisted DS-UWB DL scenario.EThOS - Electronic Theses Online ServiceGBUnited Kingdo