.png){kind=icon}
.png){kind=icon}
Return
Adaptive binary signature design for code-division multiplexing
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2008.070174.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
When data symbols modulate a signature waveform to move across a channel in the presence of disturbance, the signature that maximizes the signal-to-interference-plus-noise ratio (SINR) at the output of the maximum-SINR filter is the smallest-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, we present a formal search procedure of cost, upon eigenvector decomposition, log-linear in the signature code length that returns the maximum-SINR binary signature vector near arcs of least SINR decrease from the real maximum SINR solution in the Euclidean vector space. The quality of the proposed adaptive binary designs is measured against the theoretical upper bound of the complex/real eigenvector maximizer.
Keywords:
binary sequences
code-division multiple-access (CDMA)
code-division multiplexing
signal-to-interference-plus-noise ratio (SINR)
signal waveform design
signature sets
spread-spectrum communications
ultra-wideband (UWB) 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