Interference Avoidance In MC-DS-CDMA

Recent trends in wireless communication have led to the shift in attention towards multicarrier modulation. In this thesis, the multicarrier communication used is hybrid MC-DS-CDMA in which the information data is spread in both time and frequency domain. These types of spreading code are termed as two dimensional orthogonal variable spreading factor (2D-OVSF) codes. This hybrid CDMA is having the advantages of both MC-CDMA and MC-DS-CDMA. In this thesis, we are going to characterize another metric-MAI Coefficient which will anticipate the effect of MAI with the time and frequency domain spreading in a particular channel. With the assistance of this MAI coefficient, a novel interference avoidance code assignment strategy is proposed. By mutually considering the acquired MAI impact and the blocking probability in the code tree structure, the proposed strategy can successfully decreasing the MAI for the multi-rate MC-DSCDMA framework, while keeping up great call blocking rate execution

Multicodes for improved range resolution in radar

Third generation (3G) wireless systems are required to support a variety of communication services like voice, image, motion picture transmission, etc, each of which requires different transmission rates. Multi-code modulation has been introduced therefore as a means of supporting multi-rate services and operating in multi-cell environments [8, 9, 10]. This multi-rate multi-function capability may be used in Radar related applications, too. For example, a single transmitted waveform consisting of two orthogonal codes can be used to simultaneously track a target and obtain high range resolution. Tracking requires low bandwidth and high resolution needs a high bandwidth signal. Orthogonal codes like Walsh codes can be used to provide multiple rates if the codes are chosen from the same matrix, because certain Walsh codes of the same length have very different bandwidths. Therefore, as an extension to its use in communication, multi-codes can be used to enable multi-function operations in a Radar system. The first criterion for choosing a Radar waveform, whether single or multi-code, is its resolving capability in range and Doppler. A measure of range resolution or sensitivity to delay commonly used in Radar literature is the Peak to Sidelobe Level Ratio (PSLR) of the code\u27s autocorrelation function. The multi-codes proposed in this work are found to have better (lower) PSLRs than existing radar codes when the number of simultaneously transmitted codes is large. In the special case of using an entire set of orthogonal codes of any length, the resulting multi-code consists of just a single pulse of thickness equal to the chip width of the code used. This pulse will have a \u27perfect\u27 autocorrelation function with only a single peak at the main lobe and zero sidelobes. This gives the ideal PSLR for radar purposes. An important aspect of using multi-codes in Radar is the need for multiple transmitters to avoid the high peak factor that would result if only a single antenna 15 used. This requires the Radar system to have multiple transmitters as in phased array radar. The best example is a multi-function digital array radar that transmits a unique orthogonal code from each of its antenna elements as described by Rabideau and Parker in [13]. The system described in this publication makes use of the array mode of operation of the Radar to transmit orthogonal codes from each antenna element which are then phased and combined at the receiver. The phase (or angle) of the signal at each receive antenna element can be used to better resolve targets that are spatially separated. This thesis introduces the concept of multicodes in Radar. Further, the advantages of using multiple coded waveforms over the known Radar polyphase codes are demonstrated by simulations

Code placement and replacement strategies for wideband CDMA OVSF code tree management

[[abstract]]The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two important issues in such an environment are the code placement problem and code replacement problem. The former may have significant impact on code utilization and, thus, code blocking probability, while the latter may affect the code reassignment cost if dynamic code assignment is to be conducted. The general objective is to make the OVSF code tree as compact as possible so as to support more new calls by incurring less blocking probability and less reassignment costs. Earlier studies about these two problems either do not consider the structure of the OVSF code tree or cannot utilize the OVSF codes efficiently. To reduce the call blocking probability and the code reassignment cost, we propose two simple yet efficient strategies that can be adopted by both code placement and code replacement: leftmost and crowded-first. Numerical analyses on call blocking probability and bandwidth utilization of OVSF code trees when code reassignment is supported are provided. Our simulation results show that the crowded-first strategy can significantly reduce, for example, the code blocking probability by 77 percent and the number of reassignments by 81 percent, as opposed to the random strategy when the system is 80 percent fully loaded and the max SF = 256.[[notice]]補正完

Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management

The use of OVSF codes in WCDMA systems has oered opportunities to provide variable data rates to exibly support applications with dierent bandwidth requirements. Two important issues on such an environment are the code placement problem and code replacement problem. The former may have significant impact on code utilization and thus code blocking probability, while the latter may aect the code reassignment cost if dynamic code assignment is to be conducted. The general objective is to make the OVSF code tree as compact as possible so as to support more new calls by incurring less blocking probability and less reassignment costs. Earlier studies about these two problems either do not consider the structure of the OVSF code tree or cannot utilize the OVSF codes eciently. To reduce the call blocking probability and the code reassignment cost, we propose two simple yet ecient strategies that can be adopted by both code placement and code replacement: leftmost and crowded- rst. Numerical analyses on call blocking probability and bandwidth utilization of OVSF code trees when code reassignment is supported are provided. Our simulation results show that the crowded- rst strategy can signi cantly reduce, for example, the code blocking probability by 77% and the number of reassignments by 81% as opposed the random strategy when the system is 80% fully loaded and the max SF=256