Optimum Design of Spectral Efficient Green Wireless Communications

This dissertation focuses on the optimum design of spectral efficient green wireless communications. Energy efficiency (EE), which is defined as the inverse of average energy required to successfully deliver one information bit from a source to its destination, and spectral efficiency (SE), which is defined as the average data rate per unit bandwidth, are two fundamental performance metrics of wireless communication systems. We study the optimum designs of a wide range of practical wireless communication systems that can either maximize EE, or SE, or achieve a balanced tradeoff between the two metrics. There are three objectives in this dissertation. First, an accurate frame error rate (FER) expression is developed for practical coded wireless communication systems operating in quasi-static Rayleigh fading channels. The new FER expression enables the accurate modeling of EE and SE for various wireless communication systems. Second, the optimum designs of automatic repeat request (ARQ) and hybrid ARQ (HARQ) systems are performed to by using the EE and SE as design metrics. Specifically, a new metric of normalized EE, which is defined as the EE normalized by the SE, is proposed to achieve a balanced tradeoff between the EE and SE. Third, a robust frequency-domain on-off accumulative transmission (OOAT) scheme has been developed to achieve collision-tolerant media access control (CT-MAC) in a wireless network. The proposed frequency domain OOAT scheme can improve the SE and EE by allowing multiple users to transmit simultaneously over the same frequency bands, and the signal collisions at the receiver can be resolved by using signal processing techniques in the physical layer

Prioritized Random MAC Optimization via Graph-based Analysis

Motivated by the analogy between successive interference cancellation and iterative belief-propagation on erasure channels, irregular repetition slotted ALOHA (IRSA) strategies have received a lot of attention in the design of medium access control protocols. The IRSA schemes have been mostly analyzed for theoretical scenarios for homogenous sources, where they are shown to substantially improve the system performance compared to classical slotted ALOHA protocols. In this work, we consider generic systems where sources in different importance classes compete for a common channel. We propose a new prioritized IRSA algorithm and derive the probability to correctly resolve collisions for data from each source class. We then make use of our theoretical analysis to formulate a new optimization problem for selecting the transmission strategies of heterogenous sources. We optimize both the replication probability per class and the source rate per class, in such a way that the overall system utility is maximized. We then propose a heuristic-based algorithm for the selection of the transmission strategy, which is built on intrinsic characteristics of the iterative decoding methods adopted for recovering from collisions. Experimental results validate the accuracy of the theoretical study and show the gain of well-chosen prioritized transmission strategies for transmission of data from heterogenous classes over shared wireless channels

Digital communications over fading channels

In this report, the probabilities of bit error for the most commonly used digital modulation techniques are analyzed. Analytic solutions are developed for the probability of bit error when the signal is affected by the most commonly encountered impairment to system performance for a wireless channel, the transmission of the signal over a fading channel. In this report, the effect of a slow, flat Ricean fading channel on communications systems performance is examined. Since channel fading significantly degrades the performance of a communication system, the performance of digital communication systems that also use forward error correction channel coding is analyzed for hard decision decoding and, where appropriate, for soft decision decoding. Diversity, another technique to mitigate the effect of fading channels on digital communication systems performance, is also discussed. Also included is a discussion of the effect of narrowband noise interference, both continuous and pulsed, on digital communication systems. We then discuss the analysis of the probability of bit error for the combination of error correction coding and diversity. Following this, we briefly discuss spread spectrum systems. Next, we examine the link budget analysis and various models for channel loss. Finally, we examine in detail the second generation digital wireless standard Global System for Mobile (GSM).Approved for public release; distribution is unlimited

Application of statistical decision theory to the detection of radiotelegraph signals

Imperial Users onl

Efficient Transmission Techniques in Cooperative Networks: Forwarding Strategies and Distributed Coding Schemes

This dissertation focuses on transmission and estimation schemes in wireless relay network, which involves a set of source nodes, a set of destination nodes, and a set of nodes helps communication between source nodes and destination nodes, called relay nodes. It is noted that the overall performance of the wireless relay systems would be impacted by the relay methods adopted by relay nodes. In this dissertation, efficient forwarding strategies and channel coding involved relaying schemes in various relay network topology are studied.First we study a simple structure of relay systems, with one source, one destination and one relay node. By exploiting “analog codes” -- a special class of error correction codes that can directly encode and protect real-valued data, a soft forwarding strategy –“analog-encode-forward (AEF)”scheme is proposed. The relay node first soft-decodes the packet from the source, then re-encodes this soft decoder output (Log Likelihood Ratio) using an appropriate analog code, and forwards it to the destination. At the receiver, both a maximum-likelihood (ML) decoder and a maximum a posterior (MAP) decoder are specially designed for the AEF scheme.The work is then extended to parallel relay networks, which is consisted of one source, one destination and multiple relay nodes. The first question confronted with us is which kind of soft information to be relayed at the relay nodes. We analyze a set of prevailing soft information for relaying considered by researchers in this field. A truncated LLR is proved to be the best choice, we thus derive another soft forwarding strategy – “Z” forwarding strategy. The main parameter effecting the overall performance in this scheme is the threshold selected to cut the LLR information. We analyze the threshold selection at the relay nodes, and derive the exact ML estimation at the destination node. To circumvent the catastrophic error propagation in digital distributed coding scheme, a distributed soft coding scheme is proposed for the parallel relay networks. The key idea is the exploitation of a rate-1 soft convolutional encoder at each of the parallel relays, to collaboratively form a simple but powerful distributed analog coding scheme. Because of the linearity of the truncated LLR information, a nearly optimal ML decoder is derived for the distributed coding scheme. In the last part, a cooperative transmission scheme for a multi-source single-destination system through superposition modulation is investigated. The source nodes take turns to transmit, and each time, a source “overlays” its new data together with (some or all of) what it overhears from its partner(s), in a way similar to French-braiding the hair. We introduce two subclasses of braid coding, the nonregenerative and the regenerative cases, and, using the pairwise error probability (PEP) as a figure of merit, derive the optimal weight parameters for each one. By exploiting the structure relevance of braid codes with trellis codes, we propose a Viterbi maximum-likelihood (ML) decoding method of linear-complexity for the regenerative case. We also present a soft-iterative joint channel-network decoding. The overall decoding process is divided into the forward message passing and the backward message passing, which makes effective use of the available reliability information from all the received signals. We show that the proposed “braid coding” cooperative scheme benefits not only from the cooperative diversity but also from the bit error rate (BER) performance gain

A time spread diversity technique with integrated coding and interference cancellation

Conventional signal diversity techniques increase system complexity and/or result in an increase in the required signal bandwidth. A novel Time Spread (TS) diversity technique has been proposed in [1] aimed at improving the performance of digital communication systems in flat-fading channels without increasing their complexity or bandwidth usage. With TS, time diversity is obtained by transmitting a modulated spreading sequence, spanning over a temporal period longer than the channel coherence time Tc, for each information symbol. Unfortunately, this TS technique exhibits a Bit Error Rate (BER) performance floor at higher SNR values that renders the original technique less attractive. This dissertation is primarily concerned with the nullification of this BER performance floor. Sec¬ondly, the ability of the TS technique to transform a flat-fading channel into an Additive White Gaus¬sian Noise (AWGN) channel is investigated and exploited to enhance the performance of coding techniques designed for AWGN channels, when used in flat-fading channels. A new method is described by which TS sequences can be temporally expanded, thereby increas¬ing their obtainable time diversity gains. This method also reduces the computational complexity of a TS system, while retaining the signal diversity properties of a longer non-expanded sequence. The BER floor in TS systems is caused by the distortion of the Aperiodic Auto-Correlation (AAC) properties of overlapping spreading sequences in fading channels, resulting in Inter Code(Sequence) Interference (ICI) between spreading sequences. A Pilot Symbol Aided Modulation (PSAM) tech¬nique is adapted for the TS system to provide accurate channel estimates required by the Inter Code(Sequence) Interference Cancellation (lCIC) module. A hybrid ICIC technique, which corrects the fading TS symbol amplitudes during periods of above average instantaneous SNR levels, is shown to be the most effective. This ICIC technique enables the TS technique to provide gains similar to that of conventional third order diversity techniques at average Eb/ No ratios above 10 dB. Finally, the transparency and ability of the TS technique to transform fading channels into Gaus¬sian channels are exploited to allow the integration of conventional convolutional codes with the TS system. The coded TS system achieves substantial gains when operating in a Rayleigh flat-fading channel when a soft decision Viterbi decoder is used in the TS receiver. A strategy by which Turbo Code (TC) techniques can be integrated with the TS technique is discussed as a concluding notion to illustrate the flexibility of the TS technique. Future research areas are identified based on the findings of this dissertation. These include the investigation of more effective adaptive ICIC schemes and the possibility of using Code Division Multiple Access (CDMA) communication techniques over a narrow band channel by employing TS- and Multi-User (MU)-detection methods, combined with existing ICIC techniques. The cryptographic value of the TS technique also provides ground for future research.Dissertation (MEng (Electronic Engineering))--University of Pretoria, 2006.Electrical, Electronic and Computer Engineeringunrestricte

Performance analysis of diversity techniques in wireless communication systems: Cooperative systems with CCI and MIMO-OFDM systems

This Dissertation analyzes the performance of ecient digital commu- nication systems, the performance analysis includes the bit error rate (BER) of dier- ent binary and M-ary modulation schemes, and the average channel capacity (ACC) under dierent adaptive transmission protocols, namely, the simultaneous power and rate adaptation protocol (OPRA), the optimal rate with xed power protocol (ORA), the channel inversion with xed rate protocol (CIFR), and the truncated channel in- version with xed transmit power protocol (CTIFR). In this dissertation, BER and ACC performance of interference-limited dual-hop decode-and-forward (DF) relay- ing cooperative systems with co-channel interference (CCI) at both the relay and destination nodes is analyzed in small-scale multipath Nakagami-m fading channels with arbitrary (integer as well as non-integer) values of m. This channel condition is assumed for both the desired signal as well as co-channel interfering signals. In addition, the practical case of unequal average fading powers between the two hops is assumed in the analysis. The analysis assumes an arbitrary number of indepen- dent and non-identically distributed (i.n.i.d.) interfering signals at both relay (R) and destination (D) nodes. Also, the work extended to the case when the receiver employs the maximum ratio combining (MRC) and the equal gain combining (EGC) schemes to exploit the diversity gain