by Yeung Chi Kit. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 89-91). / Chapter I --- Hybrid FDMA/CDMA Wireless ATM --- p.1 / Chapter 1 --- Introduction --- p.2 / Chapter 1.1 --- Motivation --- p.2 / Chapter 1.2 --- Thesis Organization (PART I) --- p.5 / Chapter 2 --- Fundamentals --- p.6 / Chapter 2.1 --- Spread Spectrum --- p.6 / Chapter 2.1.1 --- Direct Sequence (DS) CDMA --- p.6 / Chapter 2.1.2 --- Frequency Hopping (FH) CDMA --- p.8 / Chapter 2.1.3 --- Time Hopping (TH) CDMA --- p.8 / Chapter 2.1.4 --- MC-CDMA (Multicarrier-CDMA) --- p.9 / Chapter 2.2 --- Asynchronous Transfer Mode (ATM) --- p.10 / Chapter 3 --- System Model --- p.12 / Chapter 4 --- System Capacity --- p.16 / Chapter 4.0.1 --- One Homogeneous User Population --- p.16 / Chapter 4.0.2 --- Two Homogeneous User Populations --- p.18 / Chapter 5 --- Conclusion --- p.24 / Chapter II --- Subband Image Coding --- p.28 / Chapter 6 --- Introduction --- p.29 / Chapter 6.1 --- Motivation --- p.29 / Chapter 6.2 --- Thesis Organization (PART II) --- p.31 / Chapter 7 --- Fundamentals --- p.33 / Chapter 7.1 --- Image Fidelity Criteria --- p.33 / Chapter 7.1.1 --- Numerical (Quantitative) Measures --- p.34 / Chapter 7.1.2 --- Perceptual (Subjective) Measure --- p.34 / Chapter 8 --- Wavelet Transform --- p.36 / Chapter 8.1 --- Wavelet Theory --- p.37 / Chapter 8.2 --- Multiresolution Analysis --- p.39 / Chapter 8.3 --- Quality Criteria for Wavelets --- p.42 / Chapter 8.4 --- Criteria for filters...................´ب --- p.43 / Chapter 8.5 --- Orthogonal Discrete Wavelet Transform --- p.45 / Chapter 8.6 --- Biorthogonal Discrete Wavelet Transform --- p.47 / Chapter 8.7 --- Wavelet Packets Transform --- p.48 / Chapter 8.8 --- Appendix --- p.50 / Chapter 8.8.1 --- QMF & CQF --- p.50 / Chapter 8.8.2 --- Examples of Orthogonal Filters --- p.53 / Chapter 8.8.3 --- Examples of Biorthogonal Filters --- p.53 / Chapter 9 --- Transform Coding and Compression --- p.55 / Chapter 9.1 --- Transformation Techniques --- p.56 / Chapter 9.2 --- Quantization --- p.57 / Chapter 9.2.1 --- Scalar Quantization --- p.57 / Chapter 9.2.2 --- Llyod-Max Quantization --- p.59 / Chapter 9.2.3 --- Vector Quantization --- p.59 / Chapter 9.2.4 --- Successive Approximation Entropy-Coded Quantization --- p.60 / Chapter 9.3 --- Entropy Coding --- p.61 / Chapter 9.3.1 --- Huffman Coding --- p.61 / Chapter 9.3.2 --- Arithmetic Coding --- p.62 / Chapter 9.3.3 --- Dictionary Based Coding --- p.64 / Chapter 9.3.4 --- Run Length Coding --- p.65 / Chapter 9.3.5 --- Example --- p.65 / Chapter 10 --- Embedded Zerotree Algorithm --- p.69 / Chapter 10.1 --- Significance Map Encoding --- p.70 / Chapter 10.2 --- Successive Approximation Entropy Coded Quantization --- p.72 / Chapter 10.3 --- Example --- p.74 / Chapter 10.4 --- Comments on EZW --- p.77 / Chapter 11 --- Residue Coding Using Embedded Zerotree Algorithm --- p.79 / Chapter 11.1 --- Residue Coding --- p.80 / Chapter 11.2 --- Results --- p.81 / Chapter 12 --- Conclusion --- p.86

One of the fundamental problems related to the development of direct sequence code division multiple access (DS CDMA) wireless data networks is design of spreading sequences possessing semi-optimal characteristics. In this thesis, we introduce three new methods to design spreading sequences, which can be optimised to achieve the desired characteristics.We show that the level of MAI for the DS CDMA systems utilising the example sets of sequences designed by the use of these techniques can be relatively low, compare to the case when the well known Gold-like sequences [29] are used. In addition, we show that by using one of the methods introduced in the thesis, we can construct sets of orthogonal sequences possessing acceptable correlation properties, even for an asynchronous operation, while another of the introduced methods can be used if design of sequences of an arbitrary length is required.Our new methods to design complex polyphase sequences are orientated towards the short length sequences, as a target application for them are high data rate wireless networks. Those methods are based on using discretised chirp pulses, pulses consisting of discretised multiple chirps, or linear combinations of them. In order to achieve orthogonality among the designed polyphase sequences, we combined the sequences based on superimposed chirps and double chirps with the sequences derived from the orthogonal Walsh functions.Finally, we utilise the three most promising sequence sets designed by the use of die introduced methods to simulate the multiuser DS CDMA systems. We compare performance of those simulated systems with the performance of the simulated system utilising 15-chip Gold- like sequences. The comparison results indicate that by using our design methods, we can produce useful sequence sets for applications where short spreading sequences are required. The presented ++ / results also demonstrate that the performance of systems utilising those sequences can be significantly better in terms of the number of simultaneously active users or bit error rate (BER) that the performance of the system employing Gold or Gold-like sequences of the similar length.

New approaches and algorithms are developed for the identification and estimation of low order models that represent multipath channel effects in Code Division Multiple Access (CDMA) communication systems. Based on these parsimonious channel models, low complexity receivers such as RAKE receivers are considered to exploit these propagation effects and enhance the system performance. We consider the scenario where multipath is frequency selective slowly fading and where the channel components including delays and attenuation coefficients are assumed to be constant over one or few signalling intervals. We model the channel as a long FIR-like filter (or a tapped delay line filter) with the number of taps related to the ratio between the channel delay-spread and the chip duration. Due to the high data rate of new CDMA systems, the channel length in terms of the chip duration will be very large. With classical channel estimation techniques this will result in poor estimates of many of the channel parameters where most of them are zero leading to a reduction in the system performance. Unlike classical techniques which estimate directly the channel response given the number of taps or given an estimate of the channel length, the proposed techniques in this work will firstly identify the significant multipath parameters using model selection techniques, then estimate these identified parameters. Statistical tests are proposed to determine whether or not each individual parameter is significant. A low complexity RAKE receiver is then considered based on estimates of these identified parameters only. The level of significance with which we will make this assertion will be controlled based on statistical tests such as multiple hypothesis tests. Frequency and time domain based approaches and model selection techniques are proposed to achieve the above proposed objectives. / The frequency domain approach for parsimonious channel estimation results in an efficient implementation of RAKE receivers in DS-CDMA systems. In this approach, we consider a training based strategy and estimate the channel delays and attenuation using the averaged periodogram and modified time delay estimation techniques. We then use model selection techniques such as the sphericity test and multiple hypotheses tests based on F-Statistics to identify the model order and select the significant channel paths. Simulations show that for a pre-defined level of significance, the proposed technique correctly identifies the significant channel parameters and the parsimonious RAKE receiver shows improved statistical as well as computational performance over classical methods. The time domain approach is based on the Bootstrap which is appropriate for the case when the distribution of the test statistics required by the multiple hypothesis tests is unknown. In this approach we also use short training data and model the channel response as an FIR filter with unknown length. Model parameters are then estimated using low complexity algorithms in the time domain. Based on these estimates, bootstrap based multiple hypotheses tests are applied to identify the non-zero coefficients of the FIR filter. Simulation results demonstrate the power of this technique for RAKE receivers in unknown noise environments. Finally we propose adaptive blind channel estimation algorithms for CDMA systems. Using only the spreading code of the user of interest and the received data sequence, four different adaptive blind estimation algorithms are proposed to estimate the impulse response of frequency selective and frequency non-selective fading channels. Also the idea is based on minimum variance receiver techniques. Tracking of a frequency selective varying fading channel is also considered. / A blind based hierarchical MDL model selection method is also proposed to select non-zero parameters of the channel response. Simulation results show that the proposed algorithms perform better than previously proposed algorithms. They have lower complexity and have a faster convergence rate. The proposed algorithms can also be applied to the design of adaptive blind channel estimation based RAKE receivers.

Thesis (Ph. D.)--Ohio State University, 2006. / Title from first page of PDF file. Includes bibliographical references (p. 175-177).

This thesis addresses handoff issues in a WCDMA system with space-time block coded transmit antenna diversity. Soft handoff has traditionally been used in CDMA systems because of its ability to provide an improved link performance due to the inherent macro diversity. Next generation systems will incorporate transmit diversity schemes employing several transmit antennas at the base station. These schemes have been shown to improve downlink transmission performance especially capacity and quality. This research investigates the possibility that the diversity obtained through soft handoff can be compensated for by the diversity obtained in a transmit diversity system with hard handoff. We analyze the system for two performance measures, namely, the probability of bit error and the outage probability, in order to determine whether the improvement in link performance, as a result of transmit diversity in a system with hard handoffs obviates the need for soft handoffs.

Joint channel and rate allocation with power minimization in orthogonal frequency-division multiple access (OFDMA) has attracted extensive attention. Most of the research has dealt with the development of suboptimal but low-complexity algorithms. In this paper, the contributions comprise new insights from revisiting tractability aspects of computing the optimum solution. Previous complexity analyses have been limited by assumptions of fixed power on each subcarrier or power-rate functions that locally grow arbitrarily fast. The analysis under the former assumption does not generalize to problem tractability with variable power, whereas the latter assumption prohibits the result from being applicable to well-behaved power-rate functions. As the first contribution, we overcome the previous limitations by rigorously proving the problem's NP-hardness for the representative logarithmic rate function. Next, we extend the proof to reach a much stronger result, namely, that the problem remains NP-hard, even if the channels allocated to each user are restricted to be a consecutive block with given size. We also prove that, under these restrictions, there is a special case with polynomial-time tractability. Then, we treat the problem class where the channels can be partitioned into an arbitrarily large but constant number of groups, each having uniform gain for every individual user. For this problem class, we present a polynomial-time algorithm and provide its optimality guarantee. In addition, we prove that the recognition of this class is polynomial-time solvable. / <p>Funding Agencies|Swedish Research Council||Linkoping-Lund Excellence Center in Information Technology||Center for Industrial Information Technology of Linkoping University||</p>

Recently, the transmission of vector quantization (VQ) over a code-division multiple access (CDMA) channel has received a considerable attention in research community. The complexity of the optimal decoding for VQ in CDMA communications is prohibitive for implementation, especially for systems with a medium or large number of users. A suboptimal approach to VQ decoding over a CDMA channel, disturbed by additive white Gaussian noise (AWGN), was recently developed. Such a suboptimal decoder is built from a soft-output multiuser detector (MUD), a soft bit estimator and the optimal soft VQ decoders of individual users. <p>Due to its lower complexity and good performance, such a decoding scheme is an attractive alternative to the complicated optimal decoder. It is necessary to extend this decoding scheme for a frequency-selective Rayleigh fading CDMA channel, a channel model typically seen in mobile wireless communications. This is precisely the objective of this thesis. <p>Furthermore, the suboptimal decoders are obtained not only for binary phase shift keying (BPSK), but also for M-ary pulse amplitude modulation (M-PAM). This extension offers a flexible trade-off between spectrum efficiency and performance of the systems. In addition, two algorithms based on distance measure and reliability processing are introduced as other alternatives to the suboptimal decoder. <p>Simulation results indicate that the suboptimal decoders studied in this thesis also performs very well over a frequency-selective Rayleigh fading CDMA channel.

Recently, the transmission of vector quantization (VQ) over a code-division multiple access (CDMA) channel has received a considerable attention in research community. The complexity of the optimal decoding for VQ in CDMA communications is prohibitive for implementation, especially for systems with a medium or large number of users. A suboptimal approach to VQ decoding over a CDMA channel, disturbed by additive white Gaussian noise (AWGN), was recently developed. Such a suboptimal decoder is built from a soft-output multiuser detector (MUD), a soft bit estimator and the optimal soft VQ decoders of individual users. <p>Due to its lower complexity and good performance, such a decoding scheme is an attractive alternative to the complicated optimal decoder. It is necessary to extend this decoding scheme for a frequency-selective Rayleigh fading CDMA channel, a channel model typically seen in mobile wireless communications. This is precisely the objective of this thesis. <p>Furthermore, the suboptimal decoders are obtained not only for binary phase shift keying (BPSK), but also for M-ary pulse amplitude modulation (M-PAM). This extension offers a flexible trade-off between spectrum efficiency and performance of the systems. In addition, two algorithms based on distance measure and reliability processing are introduced as other alternatives to the suboptimal decoder. <p>Simulation results indicate that the suboptimal decoders studied in this thesis also performs very well over a frequency-selective Rayleigh fading CDMA channel.

Analytic models for the performance of the forward link of 3G CDMA systems using different maximum ratio combining (MRC) RAKE finger weight assignments are presented. The spreading modulations under investigation are the balanced QPSK and the complex-spreading QPSK. The models are computationally efficient, accurate, and applicable to Root Raised Cosine (RRC) pulse shaping with any roll-off factor, variable processing gain, chip rate, and data rate for orthogonal codes, random codes, quasi-orthogonal codes, Gaussian noise, and realistic channel models. The expressions derived are then used to obtain the so-called orthogonality factor, which is commonly used in system-level simulations. Next, closed-form mathematical expressions for the variance due to infinite chips interfering in systems using arbitrary Nyquist pulses are derived. These expressions are applicable to both the forward link and the reverse link. For the latter, the existing knowledge on the accurate and efficient estimation of the performance of CDMA systems is extended by presenting closed mathematical expressions for bandlimited systems using arbitrary Nyquist pulses for both BPSK and Offset-QPSK (OQPSK) modulation. The impact of adjacent channel interference in bandlimited systems is subsequently considered. Finally, mathematical expressions for the accurate and efficient estimation of a CDMA system using RRC pulse-shaping and a RAKE receiver in the presence of multipath interference are presented.

In this paper, we consider the code division multiple access of the multiuser cooperative network system, all sources transmit signals using assigned spreading waveforms in first phase, and all relays transmit precoded signals using a common spreading waveform to help send signals to all destinations in second phase, in order to improve the performance. In this paper, we proposed the precoding strategy of relay point and the decoding strategy of destination point; at first we use the zero-forcing to eliminate the multi-user interferen- ce at the destination, and then joint design of the precoding vector at relay point and the decoding vector at destination point to achieve different optimization objectives. In this paper, we consider the power constraints to optimal the average SNR for the precoding vector and decoding vector, but the precoding vector favors the source-destination pairs with better channel quality in this condition, we also present the design of fairness, joint design of the precoding vector and the decoding vector to make the worst SNR can have the best signal-to-noise ratio after the design, and also consider the power constrain.