Weyl Spreading Sequence Optimizing CDMA

This paper shows an optimal spreading sequence in the Weyl sequence class, which is similar to the set of the Oppermann sequences for asynchronous CDMA systems. Sequences in Weyl sequence class have the desired property that the order of cross-correlation is low. Therefore, sequences in the Weyl sequence class are expected to minimize the inter-symbol interference. We evaluate the upper bound of cross-correlation and odd cross-correlation of spreading sequences in the Weyl sequence class and construct the optimization problem: minimize the upper bound of the absolute values of cross-correlation and odd cross-correlation. Since our optimization problem is convex, we can derive the optimal spreading sequences as the global solution of the problem. We show their signal to interference plus noise ratio (SINR) in a special case. From this result, we propose how the initial elements are assigned, that is, how spreading sequences are assigned to each users. In an asynchronous CDMA system, we also numerically compare our spreading sequences with other ones, the Gold codes, the Oppermann sequences, the optimal Chebyshev spreading sequences and the SP sequences in Bit Error Rate. Our spreading sequence, which yields the global solution, has the highest performance among the other spreading sequences tested

Techniques in secure chaos communication

In today's climate of increased criminal attacks on the privacy of personal or confidential data over digital communication systems, a more secure physical communication link is required. Chaotic signals which have bifurcation behavior (depending on some initial condition) can readily be exploited to enhance the security of communication systems. A chaotic generator produces disordered sequences that provide very good auto- and cross- correlation properties similar to those of random white noise. This would be an important feature in multiple access environments. These sequences are used to scramble data in spread spectrum systems as they can produce low co-channel interference, hence improve the system capacity and performance. The chaotic signal can be created from only a single mathematical relationship and is neither restricted in length nor is repetitive/ cyclic. On the other hand, with the progress in digital signal processing and digital hardware, there has been an increased interest in using adaptive algorithms to improve the performance of digital systems. Adaptive algorithms provide the system with the ability to self-adjust its coefficients according to the signal condition, and can be used with linear or non-linear systems; hence, they might find application in chaos communication. There has been a lot of literature that proposed the use of LMS adaptive algorithm in the communication arena for a variety of applications such as (but not limited to): channel estimation, channel equalization, demodulation, de-noising, and beamforming. In this thesis, we conducted a study on the application of chaos theory in communication systems as well as the application of adaptive algorithms in chaos communication. The First Part of the thesis tackled the application of chaos theory in com- munication. We examined different types of communication techniques utilizing chaos theory. In particular, we considered chaos shift keying (CSK) and mod- ified kind of logistic map. Then, we applied space-time processing and eigen- beamforming technique to enhance the performance of chaos communication. Following on, we conducted a study on CSK and Chaos-CDMA in conjunction with multi-carrier modulation (MCM) techniques such as OFDM (FFT/ IFFT) and wavelet-OFDM. In the Second Part of the thesis, we tried to apply adaptivity to chaos com- munication. Initially, we presented a study of multi-user detection utilizing an adaptive algorithm in a chaotic CDMA multi-user environment, followed by a study of adaptive beamforming and modified weight-vector adaptive beam- forming over CSK communication. At last, a study of modified time-varying adaptive filtering is presented and a conventional adaptive filtering technique is applied in chaotic signal environment. Twelve papers have been published during the PhD candidature, include two journal papers and ten refereed conference papers

Coexistence of multiuser entanglement distribution and classical light in optical fiber network with a semiconductor chip

Building communication links among multiple users in a scalable and robust way is a key objective in achieving large-scale quantum networks. In realistic scenario, noise from the coexisting classical light is inevitable and can ultimately disrupt the entanglement. The previous significant fully connected multiuser entanglement distribution experiments are conducted using dark fiber links and there is no explicit relation between the entanglement degradations induced by classical noise and its error rate. Here we fabricate a semiconductor chip with a high figure-of-merit modal overlap to directly generate broadband polarization entanglement. Our monolithic source maintains polarization entanglement fidelity above 96% for 42 nm bandwidth with a brightness of 1.2*10^7 Hz/mW. We perform a continuously working quantum entanglement distribution among three users coexisting with classical light. Under finite-key analysis, we establish secure keys and enable images encryption as well as quantum secret sharing between users. Our work paves the way for practical multiparty quantum communication with integrated photonic architecture compatible with real-world fiber optical communication network

On rate capacity and signature sequence adaptation in downlink of MC-CDMA system

This dissertation addresses two topics in the MC-CDMA system: rate capacity and adaptation of users\u27 signature sequences. Both of them are studied for the downlink communication scenario with multi-code scheme. The purpose of studying rate capacity is to understand the potential of applying MC-CDMA technique for high speed wireless data communications. It is shown that, to maintain high speed data transmission with multi-code scheme, each mobile should cooperatively decode its desired user\u27s encoded data symbols which are spread with different signature sequences simultaneously. Higher data rate can be achieved by implementing dirty paper coding (DPC) to cooperatively encode all users\u27 data symbols at the base station. However, the complexity of realizing DPC is prohibitively high. Moreover, it is found that the resource allocation policy has profound impact on the rate capacity that can be maintained in the system. Nevertheless, the widely adopted proportional resource allocation policy is only suitable for the communication scenario in which the disparity of users\u27 channel qualities is small. When the difference between users\u27 channel qualities is large, one must resort to non-proportional assignment of power and signature sequences. Both centralized and distributed schemes are proposed to adapt users\u27 signature sequences in the downlink of MC-CDMA system. With the former, the base station collects complete channel state information and iteratively adapts all users\u27 signature sequences to optimize an overall system performance objective function, e.g. the weighted total mean square error (WTMSE). Since the proposed centralized scheme is designed such that each iteration of signature sequence adaptation decreases the WTMSE which is lower bounded, the convergence of the proposed centralized scheme is guaranteed. With the distributed signature sequence adaptation, each user\u27s signature sequences are independently adapted to optimize the associated user\u27s individual performance objective function with no regard to the performance of other users in the system. Two distributed adaptation schemes are developed. In one scheme, each user adapts its signature sequences under a pre-assigned power constraint which remains unchanged during the process of adaptation. In the other scheme, pricing methodology is applied so that the transmission power at the base station is properly distributed among users when users\u27 signature sequences are adapted. The stability issue of these distributed adaptation schemes is analyzed using game theory frame work. It is proven that there always exists a set of signature sequences at which no user can unilaterally adapt its signature sequences to further improve its individual performance, given the signature sequences chosen by other users in the system

Parallel interference cancellation schemes based on adaptive MMSE detection for DS-CDMA systems

Master'sMASTER OF ENGINEERIN

Joint signal detection and channel estimation in rank-deficient MIMO systems

L'évolution de la prospère famille des standards 802.11 a encouragé le développement des technologies appliquées aux réseaux locaux sans fil (WLANs). Pour faire face à la toujours croissante nécessité de rendre possible les communications à très haut débit, les systèmes à antennes multiples (MIMO) sont une solution viable. Ils ont l'avantage d'accroître le débit de transmission sans avoir recours à plus de puissance ou de largeur de bande. Cependant, l'industrie hésite encore à augmenter le nombre d'antennes des portables et des accésoires sans fil. De plus, à l'intérieur des bâtiments, la déficience de rang de la matrice de canal peut se produire dû à la nature de la dispersion des parcours de propagation, ce phénomène est aussi occasionné à l'extérieur par de longues distances de transmission. Ce projet est motivé par les raisons décrites antérieurement, il se veut un étude sur la viabilité des transcepteurs sans fil à large bande capables de régulariser la déficience de rang du canal sans fil. On vise le développement des techniques capables de séparer M signaux co-canal, même avec une seule antenne et à faire une estimation précise du canal. Les solutions décrites dans ce document cherchent à surmonter les difficultés posées par le medium aux transcepteurs sans fil à large bande. Le résultat de cette étude est un algorithme transcepteur approprié aux systèmes MIMO à rang déficient