Neural networks for multiuser detection in code-division multiple-access communications

1992 ◽  
Vol 40 (7) ◽  
pp. 1212-1222 ◽  
Author(s):  
B. Aazhang ◽  
B.-P. Paris ◽  
G.C. Orsak
Keyword(s):  
Neural Networks ◽  
Multiuser Detection ◽  
Code Division Multiple Access ◽  
Multiple Access ◽  
Multiple Access Communications ◽  
Code Division Multiple

Photonic code-division multiple-access communications

1997 ◽  
Vol 16 (2) ◽  
pp. 129-157 ◽  
Author(s):  
David D. Sampson ◽  
Graeme J. Pendock ◽  
Robert A. Griffin
Keyword(s):  
Code Division Multiple Access ◽  
Multiple Access ◽  
Multiple Access Communications ◽  
Code Division Multiple

New Constructions of Codebooks Nearly Meeting the Welch Bound

2020 ◽  
Vol 31 (07) ◽  
pp. 875-889
Author(s):  
Zexia Shi ◽  
Lei Sun ◽  
Fang-Wei Fu
Keyword(s):  
Positive Integer ◽  
Code Division Multiple Access ◽  
Multiple Access ◽  
Bent Functions ◽  
Welch Bound ◽  
Generalized Bent Functions ◽  
Multiple Access Communications ◽  
Generic Construction ◽  
Direct Spread ◽  
Code Division Multiple

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.

Sign in / Sign up

Export Citation Format

Share Document