Bounds on the Maximum SINR of Binary and Quaternary Code Division

Author

Gao, Kanke ; Batalama, Stella N. ; Pados, Dimitris A.

Author_Institution

Dept. of Electr. Eng., State Univ. of New York at Buffalo, Buffalo, NY, USA

Volume

60

Issue

1

fYear

2012

fDate

1/1/2012 12:00:00 AM

Firstpage

14

Lastpage

18

Abstract

In code-division multiplexing, the real/complex-valued sequence (signature) that maximizes the pre-detection signal-to-interference-plus-noise ratio (SINR) at the output of the maximum-SINR filter is simply the minimum-eigenvalue eigenvector of the disturbance autocorrelation matrix. SINR sequence optimization over a finite alphabet, however, is NP-hard in the sequence length. In this paper, we derive new easy to calculate upper and lower bounds on the SINR of the optimal binary and quaternary sequences that can serve as benchmarking tools for any suggested suboptimal designs.

Keywords

binary codes; binary sequences; code division multiplexing; computational complexity; eigenvalues and eigenfunctions; matrix algebra; optimisation; NP-hard; SINR; SINR sequence optimization; benchmarking tools; binary code division; code-division multiplexing; disturbance autocorrelation matrix; finite alphabet; lower bounds; maximum-SINR filter; minimum-eigenvalue eigenvector; optimal binary sequences; predetection signal-to-interference-plus-noise ratio; quaternary code division; quaternary sequences; real-complex-valued sequence; upper bounds; Algorithm design and analysis; Correlation; Interference; Multiaccess communication; Optimization; Signal to noise ratio; Upper bound; Binary sequences; code-division multiple-access (CDMA); code-division multiplexing; quaternary sequences; signal-to-interference-plus-noise ratio (SINR);

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2011.100411.100242

Filename

6042888