scholarly journals Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Gang Wang ◽  
Deng-Ming Xu ◽  
Fang-Wei Fu

<p style='text-indent:20px;'>Codebooks with small maximum cross-correlation amplitudes are used to distinguish the signals from different users in code division multiple access communication systems. In this paper, several classes of codebooks are introduced, whose maximum cross-correlation amplitudes asymptotically achieve the corresponding Welch bound and Levenshtein bound. Specially, a class of optimal codebooks with respect to the Levenshtein bound is obtained. These classes of codebooks are constructed by selecting certain rows deterministically from circulant matrices, Fourier matrices and Hadamard matrices, respectively. The construction methods and parameters of some codebooks provided in this paper are new.</p>

2015 ◽  
Vol 713-715 ◽  
pp. 2012-2015
Author(s):  
Fan Xin Zeng ◽  
Zhen Yu Zhang

This paper investigates the construction methods of sequences with optimal autocorrelation functions. The approaches proposed by us are to convert the known optimal sequences into the required sequences. In order to arrive at our goal, we establish two conversion formulas, and summarize their performance. The proposed methods can provide lots of candidates of spread sequences for the applications of code-division multiple-access (CDMA) spread spectrum communication systems.


2020 ◽  
Vol 31 (07) ◽  
pp. 875-889
Author(s):  
Zexia Shi ◽  
Lei Sun ◽  
Fang-Wei Fu

Optimal codebooks meeting the Welch bound with equality are desirable in many areas, such as direct spread code division multiple access communications, compressed sensing and so on. However, it is difficult to construct such optimal codebooks. There have been a number of attempts to construct codebooks nearly meeting the Welch bound. In this paper, we introduce a generic construction of codebooks using generalized bent functions from [Formula: see text] to [Formula: see text], where [Formula: see text] is a prime and [Formula: see text] is a positive integer with [Formula: see text]. With this construction, we obtain two new families of codebooks nearly meeting the Welch bound. These codebooks have new parameters and could have a small alphabet size. In particular, a class of regular generalized bent functions from [Formula: see text] to [Formula: see text] is presented.


2018 ◽  
Vol 56 (1) ◽  
pp. 102 ◽  
Author(s):  
Nguyen Huu Trung ◽  
Doan Thanh Binh

This paper proposes a novel Large-scale (massive) Multi-input Multi-output Multi-carrier Code division multiple access (LS MIMO MC-CDMA) model and application to Fifth-Generation Mobile Communication Systems (5G). This system uses combined cylindrical array antenna multiple beamforming architecture with spatial multiplexing. The model is optimized by Min-Max criteria in order to minimize side lobes and maximize compression of propagation loss. The Monte Carlo simulation results unify with the analytical solution for system performance.


Sign in / Sign up

Export Citation Format

Share Document