To effectively combat MAI and MI in wireless networks, we exploit complementary code technique in this thesis. Terminals in cooperative communication system are not only doing the transmission or relaying, but also involve a novel strategy "network coding" which has been investigated widely. In our work, we aim to combine network coding into the conventional cooperative communication system, but we face certain problems in it. Cooperative system has diversity at the destination, but when network coding operation involved, theoretically, it violate the rules of diversity, since the new signals transmitted by relay are no longer as same as the signals from sources. However, we discover a method to solve this problem, which is using the multiplier in relay nodes to replace the conventional network coding operation- XOR. After creating the network coding-based system, our goal is to achieve diversity in cooperative communication system. In this work, we use MRC (maximum ratio combining) for the performance analysis, which is the optimal strategy. Many math works will be shown in the following chapters.

No description available.

International Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, California / This paper describes a system of Total Border Surveillance, which is cost effective, closes existing gaps and is less manpower intensive than the current techniques. The system utilizes a fleet of commercially available aircraft converted to unmanned capability, existing GPS and surveillance systems and autonomous ground stations to provide the desired coverage.

The presented work considers a CDMA-based Wireless Body Area Network (WBAN) where multiple biosensors communicate simultaneously to a central node in an asynchronous fashion. The asynchronous nature of the WBAN introduces Multiple Access Interference (MAI). To combat this problem, presented is a methodology that uses a set of cyclically orthogonal spreading codes extracted from the Walsh-Hadamard matrix. When using the Cyclic Orthogonal Walsh-Hadamard Codes (COWHC) as spreading codes in the CDMA-based WBAN, the cyclic orthogonality property helps mitigate MAI amongst the on-body sensors. Presented is an ideal communication system that is most effective at mitigating MAI in proactive WBANs. The work illustrates the system optimality and effectiveness at mitigating MAI by studying the sensitivity to packet-loss through simulating the link Bit Error Rate (BER) performance. It is shown that the proposed design with COWHC, a Rayleigh flat-fading channel, BPSK modulation and a conventional receiver produce optimum MAI mitigation.

The presented work considers a CDMA-based Wireless Body Area Network (WBAN) where multiple biosensors communicate simultaneously to a central node in an asynchronous fashion. The asynchronous nature of the WBAN introduces Multiple Access Interference (MAI). To combat this problem, presented is a methodology that uses a set of cyclically orthogonal spreading codes extracted from the Walsh-Hadamard matrix. When using the Cyclic Orthogonal Walsh-Hadamard Codes (COWHC) as spreading codes in the CDMA-based WBAN, the cyclic orthogonality property helps mitigate MAI amongst the on-body sensors. Presented is an ideal communication system that is most effective at mitigating MAI in proactive WBANs. The work illustrates the system optimality and effectiveness at mitigating MAI by studying the sensitivity to packet-loss through simulating the link Bit Error Rate (BER) performance. It is shown that the proposed design with COWHC, a Rayleigh flat-fading channel, BPSK modulation and a conventional receiver produce optimum MAI mitigation.

Recently, a novel technique for multi-user spread-spectrum mobile systems, the called interleave-division multiple-access (IDMA) scheme, was proposed by L. Ping etc. The advantage of IDMA is that it inherits many special features from code-division multiple-access (CDMA) such as diversity against fading and mitigation of the other-cell user interference. Moreover, it¡¦s capable of employing a very simple chip-by-chip iterative multi-user detection strategy. In this thesis, we investigate the performance of combining IDMA and orthogonal frequency-division multiplexing (OFDM) scheme. In order to improve the bit error rate performance, we applied low-density parity-check (LDPC) coding to the proposed scheme, named by LDPC Coded OFDM-IDMA Systems. Based on the aid of iterative multi-user detection algorithm, the multiple-access interference (MAI) and inter-symbol interference (ISI) could be canceling efficiently. In short, the proposed scheme provides an efficient solution to high-rate multiuser communications over multipath fading channels.

No description available.

Third generation mobile communication systems promise a greater data rate and new services to the mobile subscribers. 3G systems support up to 2 Mbps of data rate to a fixed subscriber and 144 Kbps of data rate to a fully mobile subscriber. Code Division Multiple Access (CDMA) is the air interface access scheme widely used in all the 3G communication systems. This access scheme has many inherent advantages m terms of noise immunity, security, coherent combining of multi path signals etc. But all these advantages come at the expense of higher complexity of the receivers. The receivers form the major portion of the processing involved in a base station. The heart of any CDMA receiver is the RAKE. The RAKE receiver separates the different multi-paths received by the antenna by using the properties of the Pseudo Random sequences. The phase and strength of each of these path signals is measured and are used by the coherent combiner, which de-rotates all the signals to a single reference and coherently combines them In general the Base station receivers make use of the top three multi-path signals ranked in terms of their signal energy Hence four RAKE fingers, each catering to single multi-path are needed for receiving a single code channel (3 for coherent combining and one for scanning). One such channel receiver requires a processing power of 860 MIPS (Mega Instructions Per Second). Some of the CDMA standards support up to 90 code channels at the same time. This means that the total processing power required at the base station is about 80 GIPS. This much of processing power will require large number of high end DSPs, which will be a very costly solution. In the current base station architectures these blocks are implemented using ASICs, which are specific to a particular standard and also the algorithms used for the different operations are fixed at the design time itself. This solution is not flexible and is not amenable for SDR (Software defined Radio) architectures for the Base stations. This thesis proposes a Co-Processor solution, which can be attached to a generic DSP or any other processor. The processor can control the Co-Processor by programming its parameter registers using memory mapped register accesses. This co-processor implements only those blocks, which are compute intensive. This co-processor performs all chip-rate processing functions involved m a RAKE receiver. All the symbol-rate functions are implemented through software in the processor. This provides more choices m selecting the algorithms for timing recovery and scanning. The algorithms can be changed through software even after the base station is installed in the field. All the inputs and outputs of the Co-Processor are passed through dual port RAMs with independent read and write clocks. This allows the Co-Processor and the processor to be running on two independent clocks. This memory scheme also increases the throughput as the reads and writes to these memories can happen simultaneously. This thesis introduces a concept of incorporating programmable PN/Gold code generators as part of the Co-Processor, which significantly reduces the amount of memory required to store the Scrambling and Spreading codes. The polynomial lengths as well as the polynomials of the code generator are programmable. The input signal memory has a bus width equal to 4 times the bus width of the IQ signal bus width (4 * 24 = 96 bits) towards the Co-Processor to meet the huge data bandwidth requirement. This memory is arranged as word interleaved memory banks. This can supply one word per memory bank on each clock cycle as long as the accessed words fall in different memory banks. The number of banks is chosen as more than twice that of the number of Correlators/ Rake fingers. This gives more flexibility in choosing the address offsets to different Correlator inputs. This flexibility allows one to use different timing recovery schemes since the number of allowable address offsets for different Correlators is more. The overall complexity of the solution is comparatively less with respect to the generic DSP based solution and much easier to modify for a different standard, when compared to the rigid ASIC based solution. The proposed solution is significantly different from the conventional way of designing the Base station with fixed ASICs and it clearly outweighs the solutions based on conventional approach in terms of flexibility, design complexity, design time and cost.

Direct-Sequence Code Division Multiple Access (DS-CDMA), over the last few years, has become a popular technique and finds a place in many modern communication systems. The performance of this technique is closely linked to the signature (or spreading) sequences employed in the system. In the past, there have been many successful attempts by research groups to construct families of signature sequences that offer the potential gains promised by theoretical bounds. In this thesis, we present constructions of families of signature sequences over the AM-PSK and QAM alphabet with low correlation. In this thesis, we construct a family of sequences over the 8-ary AM-PSK constella- tion, Family AOpt(16) that is asymptotically optimal with respect to the Welch bound on maximum magnitude of correlation for complex sequences. The maximum magnitude of correlation for this family, θmax, is upper bounded by √N , where N is the period of the sequences. The 8-ary AM-PSK constellation is a subset of the 16-QAM constellation. We also construct two families of sequences over 16-QAM, Family A16A, and Family A16,B , with the maximum magnitude of correlation upper bounded by √2√N . We construct a family, A(M 2), of sequences over the 2m+1-ary AM-PSK constellation of period N = 2r- 1 and family size (N + 1)/2m-1 . The 2m+1-ary AM-PSK constellation is a subset of the M 2-QAM constellation with M =2m . The maximum nontrivial normalized correlation parameter is bounded above by θmax < a √N where a ranges from 1.34 in the case of M 2 = 16 to √5 for large m. Apart from low correlation values, the family possesses several interesting and useful features. In Family A(M 2), users have the ability to transmit 2m bits of data per period of the spreading sequence. The sequences in Family A(M 2) are balanced; all points from the 2m+1-ary AM-PSK constellation occur approximately equally often in sequences of long period. The Euclidean distance between the signals assigned to a particular user in A(M 2), corresponding to different data symbols, is larger than the corresponding value for the case when 2m+1-PSK modulation and spreading is used. Perhaps most interestingly, Family A(M 2) permits users on the reverse link of a CDMA system to communicate asynchronously at varying data rates by switching between different QAM constellations. Family A(M 2) is compatible with QPSK sequence families S(p) in the sense that the maximum correlation magnitude is increased only slightly if one adds sequences from (p) S(p)\ S(0) to Family A(M 2). We also construct families of sequences over AM-PSK that tradeoff data rate per sequence period and θmax for a given family size. We have extended the construction of sequences over AM-PSK constellation to construct sequences over the M 2-QAM constellation for M =2m . The QAM sequence families, Families (AM 2), have size, data rate and minimum squared Euclidean distance same as the corresponding AM-PSK construction but have higher values of θmax. Also included in the thesis are constructions for large families of sequences over the M 2-QAM alphabet.

No description available.