Learn More
—Statistical conditional optimization criteria lead to the development of an iterative algorithm that starts from the matched filter (or constraint vector) and generates a sequence of filters that converges to the minimum-variance-distortion-less-response (MVDR) solution for any positive definite input autocorrelation matrix. Computationally, the algorithm(More)
— Direct-sequence/code-division multiple-access (DS/CDMA) communication systems equipped with adaptive antenna arrays offer the opportunity for jointly effective spatial and temporal (code) multiple-access interference (MAI) and channel noise suppression. This work focuses on the development of fast joint space–time (S–T) adaptive optimization procedures(More)
—In this paper, we characterize analytically the multi-access interference in wireless code-division multiple-access sensor networks with uniformly random distributed nodes and study the tradeoff between interference and connectivity. To provide a guideline for improving system behavior, three competitive deterministic topologies are evaluated along with(More)
The Welch lower bound on the total-squared-correlation (TSC) of signature sets is known to be tight for real-valued signatures and loose for binary signatures whose number is not a multiple of 4. In this paper, we derive new bounds on the TSC of binary signature sets for any number of signatures à and any signature length ÄÄ For almost all ÃÃ Ä in ½ ¾ ¾¼¼,(More)
—Compressed sensing is the theory and practice of sub-Nyquist sampling of sparse signals of interest. Perfect reconstruction may then be possible with much fewer than the Nyquist required number of data. In this paper, in particular, we consider a video system where acquisition is carried out in the form of direct compressive sampling (CS) with no other(More)
In contrast to conventional feedback bidirectional associative Memory (BAM) network models, a feedforward BAM network is developed based on a one-shot design algorithm of O(p(2)(n+m)) computational complexity, where p is the number of prototype pairs and n, m are the dimensions of the input/output bipolar vectors. The feedforward BAM is an n-p-m three-layer(More)
We develop a new subspace direction-of-arrival (DOA) estimation procedure that utilizes a noneigenvector basis. Computation of the basis is carried out by a modified version of the orthogonal auxiliary-vector (AV) filtering algorithm. The procedure starts with the linear transformation of the array response scanning vector by the input autocorrelation(More)
— The Welch lower bound on the total-squared-correlation (TSC) of signature sets is known to be tight for real-valued signatures and loose for binary signatures whose number is not a multiple of 4. In this paper, we derive new bounds on the TSC of binary signature sets for any number of signatures ¡ and any signature length ,we develop simple algorithms for(More)
—Receiver architectures in the form of a linear filter front-end followed by a hard-limiting decision maker are considered for DS-CDMA communication systems. Based on stochastic approximation concepts a recursive algorithm is developed for the adaptive optimization of the linear filter front-end in the minimum BER sense. The recursive form is decision(More)