Iterative Code Acquisition for DS-UWB Downlink using Multiple-Component Decoders

Iterative code acquisition schemes employing beneficially chosen higher-order generator polynomials and multiple-component decoders are analysed in terms of the correct detection probability of the direct sequence-ultra-wideband (DS-UWB) downlink. The proposed technique can maintain high acquisition performance, while reducing associated complexity by up to 30%

Fast antijamming timing acquisition using multilayer synchronization sequence

Pseudonoise (PN) sequences are widely used as preamble sequences to establish timing synchronization in military wireless communication systems. At the receiver, searching and detection techniques, such as the full parallel search (FPS) and the serial search (SS), are usually adopted to acquire correct timing position. However, the synchronization sequence has to be very long to combat jamming that reduces the signal-to-noise ratio (SNR) to an extremely low level. In this adverse scenario, the FPS scheme becomes too complex to implement, whereas the SS method suffers from the drawback of long mean acquisition time (MAT). In this paper, a fast timing acquisition method is proposed, using the multilayer synchronization sequence based on cyclical codes. Specifically, the transmitted preamble is the Kronecker product of Bose–Chaudhuri-Hocquenghem (BCH) codewords and PN sequences. At the receiver, the cyclical nature of BCH codes is exploited to test only a part of the entire sequence, resulting in shorter acquisition time. The algorithm is evaluated using the metrics of MAT and detection probability (DP). Theoretical expressions of MAT and DP are derived from the constant false-alarm rate (CFAR) criterion. Theoretical analysis and simulation results show that our proposed scheme dramatically reduces the acquisition time while achieving similar DP performance and maintaining a reasonably low real-time hardware implementation complexity, in comparison with the SS schem

Iterative code acquisition for DS-UWB downlink using multiple-component decoders

Dynamic branch predictors account for between 10% and 40% of a processor’s dynamic power consumption. This power cost is proportional to the number of accesses made to that dynamic predictor during a program’s execution. In this paper we propose the combined use of local delay region scheduling and profiling with an original adaptive branch bias measurement. The adaptive branch bias measurement takes note of the dynamic predictor’s accuracy for a given branch and decides whether or not to assign a static prediction for that branch. The static prediction and local delay region scheduling information is represented as two hint bits in branch instructions. We show that, with the combined use of these two methods, the number of dynamic branch predictor accesses/updates can be reduced by up to 62%. The associated average power saving is very encouraging; for the example high-performance embedded architecture n average global processor power saving of 6.22% is achieved

Iterative message-passing-based algorithms to detect spreading codes

This thesis tackles the issue of the rapid acquisition of spreading codes in Direct-Sequence Spread-Spectrum (DS/SS) communication systems. In particular, a new algorithm is proposed that exploits the experience of the iterative decoding of modern codes (LDPC and turbo codes) to detect these sequences. This new method is a Message-Passing-based algorithm. Specifically, instead of correlating the received signal with local replicas of the transmitted linear feedback shift register (LFSR) sequence, an iterative Message-Passing algorithm is implemented to be run on a loopy graph. In particular, these graphical models are designed by manipulating the generating polynomial structure of the considered LFSR sequence. Therefore, this contribution is a detailed analysis of the detection technique based on Message-Passing algorithms to acquire m-Sequences and Gold codes. More in detail, a unified treatment to design and implement a specific set of graphical models for these codes is reported. A theoretical study on the acquisition time performance and their comparison to the standard algorithms (full-parallel, simple-serial, and hybrid searches) is done. A preliminary architectural design is also provided. Finally, the analysis is also enriched by comparing this new technique to the standard algorithms in terms of computational complexity and (missed/wrong/correct) acquisition probabilities as derived by simulations

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

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