In wireless communication, multipath fading distorts the phase and the amplitude of received signals and increases error rate, which degrades causes communication quality. Multiple-input-multiple-output (MIMO) techniques can be adopted to achieve diversity gain and reduce error rate. However, MIMO is hard to be implemented in mobile devices due to size limitation. With this regard, cooperative communications are proposed to allow users to cooperate each other¡¦s and then achieve diversity without equipping multiple antennas. On the other hand, if source and relays adopt fixed-rate transmission under time-varying wireless channels, it requires timely feedback about channel-information for transmitters to adjust the rate of channel encoder. To reduce overhead required for aforementioned scheme, we adopt rateless fountain codes in cooperative networks. In recent year, most related studies focus on information-theoretical aspect, but it lacks discussion of practical coding. In our work, we use fountain codes in dual-hop cooperative communication and analyse transmission rate in terms of transmitting time. Fountain code was first proposed as Luby transform codes(LTC) for erasure channels. We combine low-density parity-check code( LDPC code) and LTC in cooperative communication networks, and analyze required transmission time under different cooperative protocols.

In embedded system, multimedia application is more important than before, And these products appearing more often. In addition, handholding devices are more and more popular, so these products¡¦ price is usually chip than others, and they concern more about power consumption. So in our design, we can¡¦t only focus on performance, low power and low cost are become the one of the most important factors. The main contribution of this thesis is that in MP3 multimedia application we analyzed ¡Bestimated and optimized our hardware and software to achieve low power and low cost issues. In software part, we used the skill of optimization to optimize our complied assembly codes. In hardware part, we analyzed the MP3 decode algorithm, found the critical part, and implement them with hardware to hope we can use the smallest hardware cost, to achieve highest acceleration. And we hope that through our research, we can establish a fundament about development a special application platform.

Cooperative communications have the ability to induce spatial diversity, increase channel capacity, and attain broader cell coverage with single-antenna terminals. This thesis focuses on the performance study of both unidirectional and bidirectional cooperative diversity networks employing the decode-and-forward (DF) protocol. For the unidirectional cooperative diversity network, we study the average bit-error rate (BER) performance of a DF protocol with maximum-likelihood (ML) detection. Closed-form approximate average BER expressions involving only elementary functions are presented for a cooperative diversity network with one or two relays. The proposed BER expressions are valid for both coherent and non-coherent binary signallings. With Monte-Carlo simulations, it is verified that the proposed BER expressions are extremely accurate for the whole signal-to-noise ratio (SNR) range. For the bidirectional cooperative diversity network, we study and compare the performance of three very typical bidirectional communication protocols based on the decode-and-forward relaying: time division broadcast (TDBC), physical-layer network coding (PNC), and opportunistic source selection (OSS). Specifically, we derive an exact outage probability in a one-integral form for the TDBC protocol, and exact closed-form outage probabilities for the PNC and OSS protocols. For the TDBC protocol, we also derive extremely tight upper and lower bounds on the outage probability in closed-form. Moreover, asymptotic outage probability performance of each protocol is studied. Finally, we study the diversity-multiplexing tradeoff (DMT) performance of each protocol both in the finite and infinite SNR regimes. The performance analysis presented in this thesis can be used as a useful tool to guide practical system designs for both unidirectional and bidirectional cooperative diversity networks. / Thesis (Master, Electrical & Computer Engineering) -- Queen's University, 2009-09-12 14:36:05.05

Recently, lattices - a mathematical representation of infinite discrete points in the Euclidean space, have become an effective way to describe and analyze communication systems especially system those that can be modeled as linear Gaussian vector channel model. Channel codes based on lattices are preferred due to three facts: lattice codes have simple structure, the code can achieve the limits of the channel, and they can be decoded efficiently using lattice decoders which can be considered as the Closest Lattice Point Search (CLPS). Since the time lattice codes were introduced to Multiple Input Multiple Output (MIMO) channel, Sphere Decoder (SD) has been an efficient way to implement lattice decoders. Sphere decoder offers the optimal performance at the expense of high decoding complexity especially for low signal-to-noise ratios (SNR) and for high- dimensional systems. On the other hand, linear and non-linear receivers, Minimum Mean Square Error (MMSE), and MMSE Decision-Feedback Equalization (DFE), provide the lowest decoding complexity but unfortunately with poor performance. Several studies works have been conducted in the last years to address the problem of designing low complexity decoders for the MIMO channel that can achieve near optimal performance. It was found that sequential decoders using backward tree 
search can bridge the gap between SD and MMSE. The sequential decoder provides an interesting performance-complexity trade-off using a bias term. Yet, the sequential decoder still suffers from high complexity for mid-to-high SNR values. In this work, we propose a new algorithm for Bidirectional Fano sequential Decoder (BFD) in order to reduce the mid-to-high SNR complexity. Our algorithm consists of first constructing a unidirectional Sequential Decoder based on forward search using the QL decomposition. After that, BFD incorporates two searches, forward and backward, to work simultaneously till they merge and find the closest lattice point to the received signal. We show via computer simulations that BFD can reduce the mid-to-high SNR complexity for the sequential decoder without changing the bias value.

We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have suggested that, in such a scenario, selection, i.e., a single relay helping the source, is the best relaying option in terms of the resulting complexity and overhead. However, in a multiuser setting, optimal relay assignment is a combinatorial problem. We formulate a related convex optimization problem that provides an extremely tight upper bound on performance and show that selection is, almost always, inherent in the solution. We also provide a heuristic to find a close-to-optimal relay assignment and power allocation across users supported by a single relay. Simulation results using realistic channel models demonstrate the efficacy of the proposed schemes, but also raise the question as to whether the gains from relaying are worth the additional costs.

We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have suggested that, in such a scenario, selection, i.e., a single relay helping the source, is the best relaying option in terms of the resulting complexity and overhead. However, in a multiuser setting, optimal relay assignment is a combinatorial problem. We formulate a related convex optimization problem that provides an extremely tight upper bound on performance and show that selection is, almost always, inherent in the solution. We also provide a heuristic to find a close-to-optimal relay assignment and power allocation across users supported by a single relay. Simulation results using realistic channel models demonstrate the efficacy of the proposed schemes, but also raise the question as to whether the gains from relaying are worth the additional costs.

In cooperative communications systems, multiple relays selection scheme and adaptive relay selection scheme are usually adopted. In both schemes, the system makes selections based on instantaneous channel status. However, such schemes have an extremely high computational complexity. In particular, when the channels experience fast fading, the systems do not have sufficient to make a correct decision. In this thesis, statistical channel properties are utilized in deciding whether cooperative transmission should be adopted or not. In our investigations, the cooperative mechanism includes direct transmission (DT), decode-and-forward (DF) relaying and amplify-and-forward (AF) relaying. The Ergodic capacity is adopted throughout the theoretical analyses. In addition, a number of approximated thresholds are derived to assist the decision process. Simulation experiments are conducted to verify the derived results. It is shown that the proposed transmission scheme using the cooperative thresholds is effective in deciding when the cooperative communication is necessary.

none

In this paper, we investigate an adaptive decode-and-forward (DF) cooperative diversity scheme based on bit interleaved coded modulation with iterative decoding (BICM-ID). Data bits are first encoded by using a convolutional code and the coded bits after an interleaver are modulated before transmission. Iterative decoding is used at the receiver. Optimized constellation mapping is designed jointly for the source and the relay using a genetic algorithm. A novel error performance analysis for the adaptive DF scheme using BICM-ID is proposed. The simulation results agree well with the analytical results at high signal-to-noise ratio (SNR). More than 5.8 dB gain in terms of SNR over the existing mappings is achieved with proposed mappings.

The focus of this thesis is on end-to-end (e2e) queueing performance evaluation and resource allocation in order to improve the performance of the relay-enhanced cellular networks. It is crucial to study both the performance of the data link layer and the physical layer issues. Therefore, we first consider end-to-end queueing performance evaluation and after that to consider physical layer issues, we present power allocation schemes, relay load balancing and relay assignment. First, we presented a framework for the link-level end-to-end queueing performance evaluation. Our system model consists of a base station, a relay, and multiple users. The e2e system is modeled as a probabilistic tandem of two finite queues. Using the decomposed model, radio link-level performance measures such as e2e packet loss rate, e2e delay and throughput are obtained analytically and compared with simulation results. A framework for power allocation for downlink transmissions in decode-and-forward relay networks is investigated. We consider a system with a single base station communicating with multiple users assisted by multiple relays. The relays have limited power which must be divided among the users they support in order to maximize the data rate of the whole network. Based on knapsack problem, the optimal power allocation is proposed. To consider fairness, weighted-based scheme is presented. Moreover, to utilize the power wisely, an efficient power reallocation scheme is proposed. Simulation results demonstrate the efficacy of the proposed schemes. By applying the relay selection scheme, it may happen that some relays have more users connected to them than other relays, which results in having unbalanced load among the relays. In order to address this issue, a game theoretic approach is presented. Coalition formation game is proposed based on merge-and-split rule to form the optimal structure. The simulation results demonstrate the effect of applying game in proposed problem. Finally, the relay assignment procedure is studied. The optimal solution is found using Lagrangian Relaxation. Then, a lighter algorithm is proposed to efficiently carry out the relay assignment. Simulation results show that the proposed algorithm can achieve near optimal data rate, while it decreases the processing time significantly.