Interference-free broadband single- and multicarrier DS-CDMA

The choice of the direct sequence spreading code in DS-CDMA predetermines the properties of the system. This contribution demonstrates that the family of codes exhibiting an interference-free window (IFW) outperforms classic spreading codes, provided that the interfering multi-user and multipath components arrive within this IFW, which may be ensured with the aid of quasi-synchronous adaptive timing advance control. It is demonstrated that the IFW duration may be extended with the advent of multicarrier DS-CDMA proportionately to the number of subcarriers. Hence, the resultant MC DS-CDMA system is capable of exhibiting near-single-user performance without employing a multi-user detector. A limitation of the system is that the number of spreading codes exhibiting a certain IFW is limited, although this problem may be mitigated with the aid of novel code design principles     

Spectrum Efficiency Enhancement in Dynamic Space Coded Multiple Access (DSCMA) System

In cellular mobile communication systems using coded modulations, the spectrum efficiency of the system is related to the number of available codes. Recently, large area synchronous (LAS) CDMA codes, which exhibit a region called interference free window (IFW) within some delay-spread, have been accepted as one of fourth-generation (4G) wireless communication systems. However, the number of synthesized LAS codes is very low due to the low duty ratio of the sequence. In this paper, a dynamic space coded multiple access (DSCMA) scheme which utilizes the spatial diversity from smart antenna system is proposed to overcome the low spectrum efficiency in LAS CDMA system. In the DSCMA a modified version of LAS codes called LAS even ternary (LAS-ET) codes is proposed. These codes are used together with a novel algorithm called dynamic space code (DSC), which will decrease the code length so that the spectrum efficiency can be increased. By taking advantage of dynamic code reuse assignment in spatial diversity, the spectrum efficiency of the DSCMA can be further increased significantly.     

A generalized QS-CDMA system and the design of new spreading codes

A generalized quasi-synchronous code-division multiple-access (QS-CDMA) system for digital mobile radio communications is proposed. In a QS-CDMA system, the relative time delay between the signals of different users is random and restricted in a certain time range, that is, the signals are quasi-synchronous. The analysis shows that the multiple-access interference (MAI) of the QS-CDMA system is determined by the cross-correlation between spreading codes around the origin. To minimize the MAI of the QS-CDMA system, we design a new set of spreading codes. The performance is evaluated according to the criteria of the bit error rate (BER). Analytic results of the BER are obtained by using two methods: Gaussian approximation and characteristic function approaches, which are checked by modified Monte Carlo computer simulations known as “importance sampling.” The results indicate that the performance of the QS-CDMA system using the spreading codes we construct is much improved     

Design of sequence set with group-wise zero correlation window

Zero correlation window (ZCW) or zero correlation zone (ZCZ) sequence can be used in quasi-synchronous code division multiple access (QS-CDMA) system to eliminate multiple access and multipath interferences. However, as the length of ZCW or ZCZ increases, fewer sequences are available. Recently, a new concept, sequence set with group-wise zero correlation window is introduced, which can increase the number of available sequences for a QS-CDMA system. In this article, a new method for generating sequence set with group-wise zero correlation window is presented. This method is based on a Hadamard matrix of size N×N and a pair of Hadamard matrices of size M×M. Compared with previous methods, the proposed sequence set has a group-wise zero correlation window for both periodic and aperiodic cross-correlation functions.     

A new family of optical code sequences for use in spread-spectrumfiber-optic local area networks

The problem of the algebraic construction of a particular family of optical codes for use in code-division multiple-access (CDMA) fiber-optic local area networks (LANs) is treated. The conditions that the code families have to satisfy when used in such systems are reviewed. The new codes are called quadratic congruence codes, and the construction of the corresponding sequences is based on the number-theoretic concept of quadratic congruences. It is shown that p-1 codes exist for every odd prime p and can serve as many as p-1 different users in the CDMA fiber-optic system. The codes belong to the family of optical orthogonal codes, their auto- and cross-correlation properties are established, and their performance is compared to that of the previous optical codes. Examples of the codes and examples of their auto- and cross-correlation functions are given     

A New Construction of Signature Waveforms for Multi-rate Multi-cell QS-CDMA Systems

In this paper, we propose a new construction of signature waveform sets based on Generalized Loosely Synchronization (GLS) sets and different chip waveforms. The new signature sets are applied into the multi-rate multi-cell quasi-synchronous CDMA (QS-CDMA) system where each cell is assigned with a GLS set; different users in the same cell are assigned with different GLS sequences in the same GLS set; user’s different streams are assigned with the same GLS sequence but different chip waveforms. According to the properties of GLS sets, the inter-cell interference (ICI) and the multi-user interference (MUI) in the same cell can be reduced significantly. The interferences among different streams of the same user are handled by an optimal (or suboptimal) multi-stream detector(s), notice that the multi-stream detector mentioned here is also named as multi-user detector in other references. We compare the performance of the multi-rate multi-cell QS-CDMA system employing the proposed sets with that of multi-rate system employing well-known concatenated orthogonal/PN sets and that of single-rate system employing GLS sets. The results show that the multi-rate system employing the proposed sets can achieve significant interference reduction. Meanwhile the performance of multi-rate system is similar to that of single-rate system due to the inclusion of multi-user detection.

New Signature Waveforms for Multi-rate QS-CDMA System with QPSK Modulation

This paper presents a multi-rate quasi-synchronous CDMA (QS-CDMA) system with QPSK modulation based on the new signature waveforms, namely GPZ-chip waveforms which are constructed by the generalized pairwise Z-complementary (GPZ) codes and optimal chip waveforms. According to the properties of GPZ-chip waveforms, the multiple access interference of different users can be reduced or eliminated. The interferences among different streams of the same user are handled by an optimal (or suboptimal) multi-stream detector(s). The performance of the proposed system is simulated and analyzed in a cellular communication environment consisting of multipath fading. The result shows that the proposed system has similar performance as compared to the single-rate QS-CDMA system employing GPZ codes with one chip waveform due to the properties of multi-stream detection. Also, the proposed system can achieve a significant interference reduction as compared to the multi-rate system employing concatenated WH/m sequence sets with one chip waveform due to the zero correlation zone properties of the GPZ-chip waveforms, thus resulting better BER performance.     

Application of Zero Correlation Zone Sequences in Quasi-synchronous CDMA Systems

In a quasi-synchronous code division multiple access （QS-CDMA） system, the correlation functions around the origin influence the system performance and odd functions are as important as the even functions. Three kinds of zero correlation zone（ZCZ） sequences are used to analyze and compare the correlation functions. Binary phase shift keying（BPSK） simulations of QS-CDMA system with the three kinds of QS sequences as spreading codes on additive white Gaussian noise（AWGN） channel show that these sequences are quasi-orthogonal, so they are suitable for QS-CDMA system. The correlation between the system performance and the zero correlation zone of the sequence is also proved.     

多径衰落信道下的扩频码设计与联合检测

在多径衰落信道CDMA系统中，扩频码设计与联合检测为提高系统容量的两个重要手段。在扩频码设计中，通过构造零相关窗码可以消除MAI和ISI，从而提高系统容量。当扩频码相关特性不理想时，通过联合检测也可以消除干扰，提高系统容量。但二者都有一定局限性，对于零相关窗码来说，它的码字资源十分有限，对于联合检测来说，当用户数很大，它的复杂度不能容忍。该文将扩频码设计与联合检测结合起来，提出了一种具有组间零相关窗特性的新型扩频码。在扩频码设计时考虑联合检测，可以增加码字资源，在联合检测中考虑扩频设计，又可以降低联合检测的复杂度。     

Dentist 2:00On codes with low peak-to-average power ratio for multicode CDMA

Codes which reduce the peak-to-average power (PAPR) in multicode code-division multiple-access (MC-CDMA) communications systems are systematically studied. The problem of designing such codes is reformulated as a new coding-theoretic problem: codes with low PAPR are ones in which the codewords are far from the first-order Reed-Muller code. Bounds on the tradeoff between rate, PAPR, and error-correcting capability of codes for MC-CDMA follow. The connections between the code design problem, bent functions, and algebraic coding theory (in particular, the Kerdock codes and Delsarte-Goethals codes) are exploited to construct code families with flexible parameters for the small values of n of practical interest. In view of their algebraic structure, these codes enjoy efficient encoding and decoding algorithms. The correspondence concludes by listing open problems in algebraic coding theory and Boolean functions motivated by the correspondence.     

Generalized pairwise complementary codes with set-wise uniform interference-free windows

This paper introduces an approach to generate generalized pairwise complementary (GPC) codes, which offer a uniform interference free windows (IFWs) across the entire code set. The GPC codes work in pairs and can fit extremely power efficient quadrature carrier modems. The characteristic features of the GPC codes include: the set size is 2K, the processing gain is 4NK, and the IFW's width is 8N identically for all codes in a set, where K is the times to perform Walsh-Hadamard expansions and N is element code length of seed complementary codes. Therefore, by using different N, the IFW width of a GPC code set can be adjusted with its set size unchanged. Each GPC code set consists of two code groups, with each having K codes, and they have sparsely and uniformly distributed autocorrelation side lobes and cross-correlation levels outside the IFWs.     

Joint detection and channel estimation algorithms for QS-CDMAsignals over time-varying channels

We consider a quasi-synchronous code-division multiple access (QS-CDMA) cellular system, where the code delay uncertainty at the base station is limited to a small number of chips. For such QS-CDMA systems, the need for code acquisition is eliminated, however, the residual code tracking and channel estimation problems still have to be solved. An extended Kalman filter (EKF) is employed to track the user delays and channel coefficients. By separating data detection, based on the QR decomposition combined with the M-algorithm (QRD-M) from the delay/channel estimation process, the computational complexity can be significantly reduced as the number of users increases. Simulations show that the EKF channel estimator performance is improved when the QRD-M algorithm is used instead of the MMSE detector or decorrelator for data decisions     

一种新的低/零碰撞区跳频序列集构造方法

低/零碰撞区跳频序列能够应用于准同步跳频通信系统中以缓解多址干扰的影响。提出了一种新的基于交织方法的低/零碰撞区跳频序列集构造方法。针对序列集的不同参数设计合理的移位序列,通过交织变换构造具有最优或次优性的低/零碰撞区跳频序列集。对不同参数进行了数值仿真,得到和所提方法一致的结论,且该方法构造的序列集具有更低的周期碰撞次数,实用性更强。新的低/零碰撞区跳频序列集可以应用于准同步跳频通信系统中,从而获得更优的性能。     

Nonrandom binary superimposed codes

A binary superimposed code consists of a set of code words whose digit-by-digit Boolean sums(1 + 1 = 1)enjoy a prescribed level of distinguishability. These codes find their main application in the representation of document attributes within an information retrieval system, but might also be used as a basis for channel assignments to relieve congestion in crowded communications bands. In this paper some basic properties of nonrandom codes of this family are presented, and formulas and bounds relating the principal code parameters are derived. Finally, there are described several such code families based upon (1)q-nary conventional error-correcting codes, (2) combinatorial arrangements, such as block designs and Latin squares, (3) a graphical construction, and (4) the parity-check matrices of standard binary error-correcting codes.     

Construction of two-dimensional wavelength/time optical orthogonal codes using difference family

A new family of two-dimensional (2-D) wavelength/time optical orthogonal codes (OOCs) for asynchronous optical code division multiple access (OCDMA) systems is proposed. The construction scheme uses the difference family (DF), which is an assemblage of difference sets in the combinatorial theory. It is proven that the proposed codewords satisfy the correlation properties required for the asynchronous OCDMA systems. The code dimension of the proposed codes is more flexible than that of the conventional 2-D codewords. The performance of the system with the proposed codes is analyzed by using the Markov-chain method. Numerical results show that the bit error rate (BER) has a minimal value given the number of simultaneous users. It is also observed that the maximum number of simultaneous users of the system can be achieved by properly choosing both the code weight and cross correlation of the 2-D OOCs.     

Enhancing spectral efficiency and capacity in synchronous OCDMA by transposed-MPC

This paper investigates a newly proposed spreading code-set based on the prime code (PC) families referred to as ‘transposed modified prime codes (T-MPC)’ for the enhancement of spectral efficiency of synchronous incoherent optical code-division multiple-access (OCDMA) networks. This code family increased the code-set cardinality up to twice of existing PC families’ size. This also implies that a greater number of users can be accommodated by the network. Since there is no longer a time-shift feature in T-MPC like in conventional modified prime codes (MPC), the code is not predictable and thus even more secure. Since the code structure is similar to MPC, its deployment in a system/network already running MPC will not require hardware modification. Due to the higher code utilization factor of T-MPC, a greater number of users are accommodated under certain bit-error rate (BER) resulting in remarkable improvement in the spectral efficiency (SE) and capacity. The T-MPC compatibility with low-weight energy-efficient MPC construction is also investigated. The BER and SE performances are analyzed and compared with existing code families. The results indicated that the T-MPC employment can improve up to 50% higher spectral efficiency.     

Large families of quaternary sequences with low correlation

A family of quaternary (Z₄-alphabet) sequences of length L=2^r-1, size M⩾L²+3L+2, and maximum nontrivial correlation parameter C_max⩽2√(L+1)+1 is presented. The sequence family always contains the four-phase family 𝒜. When r is odd, it includes the family of binary Gold sequences. The sequence family is easily generated using two shift registers, one binary, the other quaternary. The distribution of correlation values is provided. The construction can be extended to produce a chain of sequence families, with each family in the chain containing the preceding family. This gives the design flexibility with respect to the number of intermittent users that can be supported, in a code-division multiple-access cellular radio system. When r is odd, the sequence families in the chain correspond to shortened Z₄-linear versions of the Delsarte-Goethals codes     

A Decomposition Theory for Binary Linear Codes

The decomposition theory of matroids initiated by Paul Seymour in the 1980s has had an enormous impact on research in matroid theory. This theory, when applied to matrices over the binary field, yields a powerful decomposition theory for binary linear codes. In this paper, we give an overview of this code decomposition theory, and discuss some of its implications in the context of the recently discovered formulation of maximum-likelihood (ML) decoding of a binary linear code over a binary-input discrete memoryless channel as a linear programming problem. We translate matroid-theoretic results of Grotschel and Truemper from the combinatorial optimization literature to give examples of nontrivial families of codes for which the ML decoding problem can be solved in time polynomial in the length of the code. One such family is that consisting of codes for which the codeword polytope is identical to the Koetter-Vontobel fundamental polytope derived from the entire dual code C^perp. However, we also show that such families of codes are not good in a coding-theoretic sense-either their dimension or their minimum distance must grow sublinearly with code length. As a consequence, we have that decoding by linear programming, when applied to good codes, cannot avoid failing occasionally due to the presence of pseudocode words.     

Design and analysis of E2RC codes

We consider the design and analysis of the efficiently-encodable rate-compatible (E²RC) irregular LDPC codes proposed in previous work. In this work we introduce semi-structured E²RC-like codes and protograph E²RC codes. EXIT chart based methods are developed for the design of semi-structured E²RC-like codes that allow us to determine near-optimal degree distributions for the systematic part of the code while taking into account the structure of the deterministic parity part, thus resolving one of the open issues in the original construction. We develop a fast EXIT function computation method that does not rely on Monte-Carlo simulations and can be used in other scenarios as well. Our approach allows us to jointly optimize code performance across the range of rates under puncturing.We then consider protograph E²RC codes (that have a protograph representation) and propose rules for designing a family of rate-compatible punctured protographs with low thresholds. For both the semi-structured and protograph E²RC families we obtain codes whose gap to capacity is at most 0.3 dB across the range of rates when the maximum variable node degree is twenty.     

New binary codes

In this paper constructions are given for combining two, three, or four codes to obtain new codes. The Andryanov-Saskovets construction is generalized. It is shown that the Preparata double-error-correcting codes may be extended by about (block length)^{1/2}symbols, of which only one is a check symbol, and thate-error-correcting BCH codes may sometimes be extended by (block !ength)^{1/e}symbols, of which only one is a check symbol. Several new families of linear and nonlinear double-error-correcting codes are obtained. Finally, an infinite family of linear codes is given withd/n = frac{1}{3}, the first three being the(24,2^12, 8)Golay code, a(48,2^15, 16)code, and a(96,2^18, 32)code. Most of the codes given have more codewords than any comparable code previously known to us.