In the massive machine-type communication scenario, aiming at the problems of active user detection and channel estimation in the grant-free non-orthogonal multiple access (NOMA) system, new sets of non-orthogonal spreading sequences are proposed by using the zero/low correlation zone sequence set with low correlation among multiple sets. The simulation results show that the resulting sequence set has low coherence, which presents reliable performance for channel estimation and active user detection based on compressed sensing. Compared with the traditional Zadoff-Chu (ZC) sequences, the new non-orthogonal spreading sequences have more flexible lengths, and lower peak-to-average power ratio (PAPR) and smaller alphabet size. Consequently, these sequences will effectively solve the problem of high PAPR of time domain signals and are more suitable for low-cost devices in massive machine-type communication.

The present paper proposes two new methods for constructing polyphase asymmetric zero-correlation zone (A-ZCZ) sequence sets. In previous studies, the authors proposed methods for constructing quasi-optimal polyphase A-ZCZ sequence sets using perfect sequences and for constructing optimal polyphase A-ZCZ sequence sets using discrete Fourier transform (DFT) matrices. However, in these methods, the total number of sequences in an A-ZCZ sequence set cannot exceed the period of the perfect sequence or the dimension of the DFT matrix used for constructing the A-ZCZ sequence set. We now propose two extended versions of these methods. The proposed methods can generate a quasi-optimal or optimal polyphase A-ZCZ sequence set where the total number of sequences exceeds the period of the perfect sequence or the dimension of the DFT matrix. In other words, the proposed methods can generate new A-ZCZ sequence sets that cannot be obtained from the known methods.

Recently, asymmetric zero-correlation zone (A-ZCZ) sequence sets that are composed of several sequence subsets have been proposed. In A-ZCZ sequence sets, the zero-cross-correlation zone (ZCCZ) length between different sequence subsets is larger than the zero-correlation zone (ZCZ) length in each sequence subset. However, the ZCCZ length between different sequence subsets was not precisely shown in previous studies. The present letter shows precisely the ZCCZ length between different sequence subsets. This information is useful for estimating the magnitude of inter-cell interference when designing approximately synchronized code-division multiple-access (AS-CDMA) systems.

The present paper proposes a new method for constructing polyphase asymmetric zero-correlation zone (A-ZCZ) sequence sets. The proposed method can generate A-ZCZ sequence sets that cannot be obtained from methods proposed by other researchers and is a generalized version of our previously proposed method. An A-ZCZ sequence set can be regarded as a ZCZ sequence set. The newly obtained A-ZCZ sequence sets include quasi-optimal ZCZ sequence sets of which the zero-cross-correlation zone (ZCCZ) length between different sequence subsets is larger than the mathematical upper bound of conventional ZCZ sequence sets. A new method for extending the A-ZCZ sequence sets is also presented in the present paper.

This paper extends previous analytical approaches for the study of CDMA systems to the relevant case of multipath environments where users can operate at different bit rates. This scenario is of interest for the Wideband CDMA strategy employed in UMTS, and the model permits the performance comparison of classic and more innovative spreading signals. The method is based on the characteristic function approach, that allows to model accurately the various kinds of interferences. Some numerical examples are given with reference to the ITU-R M.1225 Recommendations, but the analysis could be extended to different channel descriptions.

We design M(≥3)-phase spreading sequences of Markov chains optimal in terms of bit error probabilities in asynchronous SSMA (spread spectrum multiple access) communication systems. To this end, we obtain the distributions of the normalized MAI (multiple access interference) for such systems and find a necessary and sufficient condition that the distributions become independent of the phase shifts.

We study asynchronous SSMA communication systems using binary spreading sequences of Markov chains and prove the CLT (central limit theorem) for the empirical distribution of the normalized MAI (multiple-access interference). We also prove that the distribution of the normalized MAI for asynchronous systems can never be Gaussian if chains are irreducible and aperiodic. Based on these results, we propose novel theoretical evaluations of bit error probabilities in such systems based on the CLT and compare these and conventional theoretical estimations based on the SGA (standard Gaussian approximation) with experimental results. Consequently we confirm that the proposed theoretical evaluations based on the CLT agree with the experimental results better than the theoretical evaluations based on the SGA. Accordingly, using the theoretical evaluations based on the CLT, we give the optimum spreading sequences of Markov chains in terms of bit error probabilities.

This paper proposes a new class of polyphase ZCZ (zero-correlation zone) sequence sets which satisfy a mathematical upper bound. The proposed ZCZ sequence sets are obtained from DFT matrices and unitary matrices. In addition, this paper discusses the cross-correlation property between different ZCZ sequence sets which belong to the proposed class.

In this paper, a quasi-synchronous code-division multiple-access (QS-CDMA) is investigated for application in the reverse link of a microcellular or indoor mobile communication environment. In a QS-CDMA system, the relative time delay between the signals of different users is normally restricted within a few chips. Generalized orthogonal (GO) codes added with guard chips are employed as the spreading sequences in this paper and the strict timing error restrictions for BPSK and M-QAM modulation schemes are derived based on the correlation properties of GO code set which determines the multiple access interference (MAI). The results reveal that the system employing GO code set with bigger GO zone can tolerate more serious timing error, and higher order modulation schemes require stricter synchronization. Based on the system model presented, the BER performance for BPSK and M-QAM is evaluated by Gaussian Approximation (GA) and Monte Carlo simulation. The system capacity in terms of acquirable total bit rates are also evaluated, revealing that if system synchronization error is limited within the GO zone, M-QAM scheme can be utilized to improve the system capacity.

Complete complementary codes have the property that the sum of correlation functions of several sequences satisfies both ideal autocorrelation and cross-correlation values. Modulatable complete complementary codes (MCC codes), which is a type of periodic complete complementary codes, are suitable for spreading sequences of M-ary CDMA systems. In the present paper, we propose a new method for constructing MCC codes. Using this method, we can easily generate various MCC codes.