.png){kind=icon}
.png){kind=icon}
Return
Optimal Binary/Quaternary Adaptive Signature Design for Code-Division Multiplexing
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2012.12.120361.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider signature waveform design for synchronous code division multiplexing in the presence of interference and wireless multipath fading channels. The adaptive real/complex signature that maximizes the signal-to-interference-plus-noise ratio (SINR) at the output of the maximum-SINR filter is the minimum-eigenvalue eigenvector of the disturbance autocovariance matrix. In digital communication systems, the signature alphabet is finite and digital signature optimization is NP-hard. In this paper, first we convert the maximum-SINR objective of adaptive binary signature design into an equivalent minimization problem. Then we present an adaptive binary signature design algorithm based on modified Fincke-Pohst (FP) method that achieves the optimal exhaustive search performance with low complexity. In addition, with the derivation of quaternary-binary equivalence, we extend and propose the optimal adaptive signature design algorithm for quaternary alphabet. Numerical results demonstrate the optimality and complexity reduction of our proposed algorithms.
Keywords:
Binary sequences
code-division multiplexing
signal-to-interference-plus-noise ratio (SINR)
signal waveform design
signature sets
spread-spectrum communications
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W