#### Filter Results:

- Full text PDF available (110)

#### Publication Year

1993

2017

- This year (7)
- Last 5 years (64)
- Last 10 years (99)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Dimitris A. Pados, George N. Karystinos
- IEEE Trans. Signal Processing
- 2001

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-distortionless-response (MVDR) solution for any positive definite input autocorrelation matrix. Computationally, the algorithm is… (More)

- Dimitris A. Pados, Stella N. Batalama
- IEEE Trans. Communications
- 1999

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 that… (More)

- George N. Karystinos, Dimitris A. Pados
- IEEE Trans. Communications
- 2003

The Welch lower bound on the total-squaredcorrelation (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 K and any signature length L: For almost all K; L in f1; 2; : :… (More)

- Swades De, Chunming Qiao, Dimitris A. Pados, Mainak Chatterjee, Sumesh J. Philip
- IEEE Journal on Selected Areas in Communications
- 2004

In this paper, we characterize analytically the multiaccess 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 the… (More)

- Zhenyu Liu, Dimitris A. Pados
- IEEE Trans. Communications
- 2005

- Ying Liu, Ming Li, Dimitris A. Pados
- IEEE Trans. Circuits Syst. Video Techn.
- 2013

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 form… (More)

- George N. Karystinos, Dimitris A. Pados
- IEEE Transactions on Information Theory
- 2005

The total squared correlation (TSC), maximum squared correlation (MSC), sum capacity (C/sub sum/), and total asymptotic efficiency (TAE) of underloaded signature sets, as well as the TSC and C/sub sum/ of overloaded signature sets are metrics that are optimized simultaneously over the real/complex field. In this present work, closed-form expressions are… (More)

- Zhenyu Liu, Dimitris A. Pados
- IEEE Transactions on Information Theory
- 2005

We use the theory of finite classical generalized polygons to derive and study low-density parity-check (LDPC) codes. The Tanner graph of a generalized polygon LDPC code is highly symmetric, inherits the diameter size of the parent generalized polygon, and has minimum (one half) diameter-to-girth ratio. We show formally that when the diameter is four or six… (More)

- George N. Karystinos, Dimitris A. Pados
- GLOBECOM
- 2001

Abstract— The Welch lower bound on the total-squaredcorrelation (TSC) of signature sets is known to be tight for realvalued 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 , we… (More)

- Ioannis N. Psaromiligkos, Stella N. Batalama, Dimitris A. Pados
- IEEE Trans. Communications
- 1999

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 driven… (More)