No description available.

Turbo codes are a class of forward error correction (FEC) codes that offer energy efficiencies close to the limits predicted by information theory. The features of turbo codes include parallel code concatenation, recursive convolutional encoding, nonuniform interleaving, and an associated iterative decoding algorithm. Although the iterative decoding algorithm has been primarily used for the decoding of turbo codes, it represents a solution to a more general class of estimation problems that can be described as follows: a data set directly or indirectly drives the state transitions of two or more Markov processes; the output of one or more of the Markov processes is observed through noise; based on the observations, the original data set is estimated. This dissertation specifically describes the process of encoding and decoding turbo codes. In addition, a more general discussion of iterative decoding is presented. Then, several new applications of iterative decoding are proposed and investigated through computer simulation. The new applications solve two categories of problems: the detection of turbo codes over time-varying channels, and the distributed detection of coded multiple-access signals. Because turbo codes operate at low signal-to-noise ratios, the process of phase estimation and tracking becomes difficult to perform. Additionally, the turbo decoding algorithm requires precise estimates of the channel gain and noise variance. The first significant contribution of this dissertation is a study of several methods of channel estimation suitable specifically for turbo coded systems. The second significant contribution of this dissertation is a proposed method for jointly detecting coded multiple-access signals using observations from several locations, such as spatially separated base stations. The proposed system architecture draws from the concepts of macrodiversity combining, multiuser detection, and iterative decoding. Simulation results show that when the system is applied to the time division multiple-access cellular uplink, a significant improvement in system capacity results. / Ph. D.

This thesis investigates the application of an iterative leakage-based precoding algorithm to practical multiuser-MIMO systems. We consider the effect of practical impairments including imperfect channel state information, transmit antenna correlation, and time-varying channels. Solutions are derived which improve performance of the algorithm with imperfect channel state information at the transmitter by leveraging knowledge of the second-order statistics of the error. From this work we draw a number of conclusions on how imperfect channel state information may impact the system design including the importance of interference suppression at the receiver and the selection of the number of co-scheduled users. We also demonstrate an efficient approach to improve the convergence of the algorithm when using interference-rejection-combining receivers. Finally, we conduct simulations of an LTE-A system employing the improved algorithm to show its utility for modern communication systems. / Master of Science

WCDMA is typically characterised as a system capable of providing mobile users with data rates up to 2 Mb/s and beyond. It has been termed an ultra high-speed, ultra high-capacity radio technology that will be able to carry a new range of fast, colourful media, such as colour graphics, video, animations, digital audio, Internet and e-mail that consumers will be able to access over their mobiles devices. This current study has researched on the various existing Multiuser detection (MUD) processes or proposals conducted by various research institutions around the world. It has identified the advantages that the past work offers, and it is these advantages that form the basis of the current research into the improvement techniques. The proposed Partial Parallel Pipelined Multiuser Detector (PPPMUD or P3MUD) has come about from two main flavours or directions of research. The first one seeks to promote the Soft Parallel Interference Cancellation technique as an effective bias mitigation technique. This bias occurring in the second stage decision statistics, exhibits a very harmful effect on system Bit Error Rate, (BER), particularly for large system loads. This current study goes further by carefully analysing the Soft Cancellation Factor, SCF behaviour to eventually derive and determine the optimum SCF value which exhibits positive characteristics when varied with the increasing system load (number of users). This optimum SCF value is called the universal SCF or SCFUNV, as it is theoretically supposed to perform favourably under various system loads. A favourable or acceptable performance would be characterised by low observed or measured BER during the system processing stages. A further enhancement to the operational performance of the SCFUNV algorithm is the SCFUNV Compensator, which is basically a compensation mechanism created by modelling the behaviour of the SCF values, and adjusts the SCFUNV depending on the system load, (number of simultaneous users). Thus, the SCFUNV is adaptively adjusted in order to perform acceptably under all load conditions. The second direction of research, as regards improvements in MUD techniques, involves the conventional Bit-Streaming, Pipelined Multiuser Detector. This came about due to the computational complexity as well as matrix inversions which affected earlier asynchronous multiuser detection techniques. This detector has a pipelined architecture which avoids multishot (block-based) detection and instead, processes the bits in a streaming fashion. The architecture consists of a matched filter followed by three stages of parallel interference cancellation, (PIC). This present study extends that research by outlining the advantages of incorporating the soft parallel interference cancellation technique, by way of the universal soft cancellation factor, (SCFUNV), into the conventional pipelined multiuser detector architecture to form the P3MUD architecture, which includes the compensator. The contributions of the proposed P3MUD system is that the observed BER output simulations are promising, with an observed overall decrease in the error rate for the P3MUD process, as compared to the conventional pipelined detection method. This decrease signifies an improvement offered by the proposed (P3MUD) algorithm. Further observed analysis indicates the possibility of decreasing the number of parallel interference cancellation stages from three to at least two, after the matched filter detection stage, without an observable change in system BER. Hence, the proposal of the two-stage P3MUD. / Dissertation (MEng (Electronic))--University of Pretoria, 2006. / Electrical, Electronic and Computer Engineering / unrestricted

Since direct-sequence code-division multiple-access (DS-CDMA) is an interference-limited random multiple-access scheme, the reduction of co-channel interference with either interference suppression or interference cancellation multiuser receivers and/or power control to prevent detrimental near-far situations is vital for improved performance. Up to date, some contributions investigated randomly-spread asymptotically - large number of users and large bandwidth - large CDMA systems with multiuser receivers and power control via random matrix theoretic and free probability theoretic tools especially over Gaussian and single-path fading channels. As complement within this thesis, we analyze also within the generalized random spreading framework but at finite system sizes and without power control the capacity achievable with linear multichannel multiuser receivers / i.e. RAKE, zero-forcing decorrelator, linear minimum mean-squared error (LMMSE) multiuser receivers, within a single-cell setting over generalized time-varying GWSSUS - Rayleigh/Ricean - fading channels via random matrix theoretic tools. Assuming maximal-ratio combining (MRC) of resolved frequency - multipath - diversity channels due to wideband transmission, the signal-to-interference ratios (SIRs) with multichannel multiuser receivers that set the basis for further derivations are statistically characterized. The information-theoretic ergodic and outage sum-rates spectral efficiencies are then derived and analyzed.

In multiuser wireless communications, interference not only limits the performance of the system, but also allows users to eavesdrop on other users’ messages. Hence, interference management in multiuser wireless communication has received significant attention in the last decade, both in the academia and industry. The interference channel (IC) is one of the simplest information theoretic models to analyze the effect of interference on the throughput and secrecy of individual messages in a multiuser setup. In this thesis, the IC is studied under different settings with and without the secrecy constraint. The main contributions of the thesis are as follows: • The generalized degrees of freedom (GDOF) has emerged as a useful approximate measure of the potential throughput of a multiuser wireless system. Also, multiple antennas at the transmitter and receiver can provide additional dimension for signaling, which can in turn improve the GDOF performance of the IC. In the initial part of the thesis, a K-user MIMO Gaussian IC (GIC) is studied from an achievable GDOF perspective. An inner bound on GDOF is derived using a combination of techniques such as treating interference as noise, zero-forcing receiving, interference alignment (IA), and extending the Han-Kobayashi (HK) scheme to K users. Also, outer bounds on the sum rate of the K-user MIMO GIC are derived, under different assumptions of cooperation and providing side information to the receivers. The derived outer bounds are simplified to obtain outer bounds on the GDOF. The relative performance of these bounds yields insight into the performance limits of the multiuser MIMO GIC and the relative merits of different schemes for interference management. • Then, the problem of designing the precoding and receive filtering matrices for IA is explored for K-user MIMO (M × N) GIC. Two algorithms for designing the precoding and receive filtering matrices for IA in the block fading or constant MIMO IC with a finite number of symbol extensions are proposed. The first algorithm for IA is based on aligning a subset of the interfering signal streams at each receiver. As the first algorithm requires global channel knowledge at each node, a distributed algorithm is proposed which requires only limited channel knowledge at each node. A new performance metric is proposed, that captures the possible loss in signal dimension while designing the precoders. The performance of the algorithms are evaluated by comparing them with existing algorithms for IA precoder design. • In the later part of the thesis, a 2-user IC with limited-rate transmitter cooperation is studied, to investigate the role of cooperation in managing interference and ensuring secrecy. First, the problem is studied in the deterministic setting, and achievable schemes are proposed, which use a combination of interference cancelation, relaying of the other user’s data bits, time sharing, and transmission of random bits, depending on the rate of the cooperative link and the relative strengths of the signal and the interference. Outer bounds on the secrecy rate are derived, under different assumptions of providing side information to receivers and partitioning the encoded message/output depending on the relative strength of the signal and the interference. The achievable schemes and outer bounds are extended to the Gaussian case. For example, while obtaining outer bounds, for the Gaussian case, it is not possible to partition the encoded message or output as performed in the deterministic case, and the novelty lies in finding the analogous quantities for the Gaussian case. The proposed achievable scheme for the Gaussian case uses a combination of cooperative and stochastic encoding along with dummy message transmission. For both the models, one of the key techniques used in the achievable scheme is interference cancelation, which has two benefits: it cancels interference and ensures secrecy simultaneously. The results show that limited-rate transmitter cooperation can greatly facilitate secure communications over 2-user ICs.

The monitoring of traffic signal systems can be of great importance for identifying problems, self-assessment, budgeting, creating the strategy for future steps, etc. Monitoring procedure was developed through a set of dashboards with relevant signal performance and reliability measures. The dashboards were created to reflect performance and reliability of a specific signal system on a weekly or monthly level. The author used data from ATMS.now signal system central software to illustrate how similar dashboards could be developed from any central software to enable operators to promptly and efficiently monitor various parameters of traffic signals. The main outcome of the study is a pair of Excel dashboards accompanied with appropriate user manual. The dashboards represent the tool for monitoring which can be helpful in the process of evaluation for traffic signal systems. / Includes bibliography. / Thesis (M.S.)--Florida Atlantic University, 2017. / FAU Electronic Theses and Dissertations Collection

Design and analysis of random-like codes for various multiple-input and multiple-output communication systems are addressed in this work. Random-like codes have drawn significant interest because they offer capacity-achieving performance. We first consider the analysis and design of low-density parity-check (LDPC) codes for turbo multiuser detection in multipath CDMA channels. We develop techniques for computing the probability density function (pdf) of the extrinsic messages at the output of the soft-input soft-output (SISO) multiuser detectors as a function of the pdf of input extrinsic messages, user spreading codes, channel impulse responses, and signal-to-noise ratios. Using these techniques, we are able to accurately compute the thresholds for LDPC codes and design good irregular LDPC codes. We then apply the tools of density evolution with mixture Gaussian approximations to optimize irregular LDPC codes and to compute minimum operational signal-to-noise ratios for ergodic MIMO OFDM channels. In particular, the optimization is done for various MIMO OFDM system configurations which include different number of antennas, different channel models and different demodulation schemes. We also study the coding-spreading tradeoff in LDPC coded CDMA systems employing multiuser joint decoding. We solve the coding-spreading optimization based on the extrinsic information SNR evolution curves for the SISO multiuser detectors and the SISO LDPC decoders. Both single-cell and multi-cell scenarios will be considered. For each of these cases, we will characterize the extrinsic information for both finite-size systems and the so-called large systems where asymptotic performance results must be evoked. Finally, we consider the design optimization of irregular repeat accumulate (IRA) codes for MIMO communication systems employing iterative receivers. We present the density evolution-based procedure with Gaussian approximation for optimizing the IRA code ensemble. We adopt an approximation method based on linear programming to design an IRA code with the extrinsic information transfer (EXIT) chart matched to that of the soft MIMO demodulator.

A fundamental aspect in performance engineering of wireless networks is optimizing the set of links that can be concurrently activated to meet given signal-to-interference-and-noise ratio (SINR) thresholds. The solution of this combinatorial problem is the key element in scheduling and cross-layer resource management. In this paper, we assume multiuser decoding receivers, which can cancel strongly interfering signals. As a result, in contrast to classical spatial reuse, links being close to each other are more likely to be active concurrently. Our focus is to gauge the gain of successive interference cancellation (SIC), as well as the simpler, yet instructive, case of parallel interference cancellation (PIC), in the context of optimal link activation. We show that both problems are NP-hard and develop compact integer linear programming formulations that enable to approach global optimality. We provide an extensive numerical performance evaluation, indicating that for low to medium SINR thresholds the improvement is quite substantial, especially with SIC, whereas for high SINR thresholds the improvement diminishes and both schemes perform equally well.

Nowadays, multiuser Multiple-In Multiple-Out systems (MU-MIMO) are used in a new generation wireless technologies. Due to that wireless technology improvement is ongoing, the numbers of users and applications increase rapidly. Then, wireless communications need the high data rate and link reliability at the same time. Therefore, MU-MIMO improvements have to consider 1) providing the high data rate and link reliability, 2) support all users in the same time and frequency resource, and 3) using low power consumption. In practice, the interuser interference has a strong impact when more users access to the wireless link. Complicated transmission techniques such as interference cancellation should be used to maintain a given desired quality of service. Due to these problems, MU-MIMO with very large antenna arrays (known as massive MIMO) are proposed. With a massive MU-MIMO system, we mean a hundred of antennas or more serving tens of users. The channel vectors are nearly orthogonal, and then the interuser interference is reduced significantly. Therefore, the users can be served with high data rate simultaneously. In this thesis, we focus on the performance of the massive MU-MIMO downlink where the base station uses linear precoding techniques to serve many users over Rayleigh and Nakagami-m fading channels.