Athanasios A. Rontogiannis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Athanasios A. Rontogiannis has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Kostas Berberidis
Department of Computer Engineering and Informatics, University of Patras, Rio-Patras, Greece
3 shared publications - Vassilis Kekatos
Purdue University, West Lafayette
3 shared publications Dimitris Katselis
1 shared publication- Eleftherios Kofidis
Department of Statistics and Insurance Science, University of Piraeus
1 shared publication - Frederic Schmidt
ESAC PO Box 78 E-28691 VILLANUEVA DE
1 shared publication - George A. Ropokis
Computer Technology Institute and Press “Diophantus”, 26500, Rio-Patras, Greece
1 shared publication
Latest Publications
- Open Access
On the unmixing of MEx/OMEGA hyperspectral data
This article presents a comparative study of three different types of estimators used for supervised linear unmixing of two MEx/OMEGA hyperspectral cubes. The algorithms take into account the constraints of the abundance fractions, in order to get physically interpretable results. Abundance maps show that the Bayesian maximum a posteriori probability (MAP) estimator proposed in Themelis and Rontogiannis (2008) outperforms the other two schemes, offering a compromise between complexity and estimation performance. Thus, the MAP estimator is a candidate algorithm to perform ice and minerals detection on large hyperspectral datasets.
Open AccessOn the unmixing of MEx/OMEGA hyperspectral data
This article presents a comparative study of three different types of estimators used for supervised linear unmixing of two MEx/OMEGA hyperspectral cubes. The algorithms take into account the constraints of the abundance fractions, in order to get physically interpretable results. Abundance maps show that the Bayesian maximum a posteriori probability (MAP) estimator proposed in Themelis and Rontogiannis (2008) outperforms the other two schemes, offering a compromise between complexity and estimation performance. Thus, the MAP estimator is a candidate algorithm to perform ice and minerals detection on large hyperspectral datasets.
- Open Access
Preamble-Based Channel Estimation for CP-OFDM and OFDM/OQAM Systems: A Comparative Study
In this paper, preamble-based least squares (LS) channel estimation in OFDM systems of the QAM and offset QAM (OQAM) types is considered, in both the frequency and the time domains. The construction of optimal (in the mean squared error (MSE) sense) preambles is investigated, for both the cases of full (all tones carrying pilot symbols) and sparse (a subset of pilot tones, surrounded by nulls or data) preambles. The two OFDM systems are compared for the same transmit power, which, for cyclic prefix (CP) based OFDM/QAM, also includes the power spent for CP transmission. OFDM/OQAM, with a sparse preamble consisting of equipowered and equispaced pilots embedded in zeros, turns out to perform at least as well as CP-OFDM. Simulations results are presented that verify the analysis.
Open AccessPreamble-Based Channel Estimation for CP-OFDM and OFDM/OQAM Systems: A Comparative Study
In this paper, preamble-based least squares (LS) channel estimation in OFDM systems of the QAM and offset QAM (OQAM) types is considered, in both the frequency and the time domains. The construction of optimal (in the mean squared error (MSE) sense) preambles is investigated, for both the cases of full (all tones carrying pilot symbols) and sparse (a subset of pilot tones, surrounded by nulls or data) preambles. The two OFDM systems are compared for the same transmit power, which, for cyclic prefix (CP) based OFDM/QAM, also includes the power spent for CP transmission. OFDM/OQAM, with a sparse preamble consisting of equipowered and equispaced pilots embedded in zeros, turns out to perform at least as well as CP-OFDM. Simulations results are presented that verify the analysis.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15206149) , III-197-197
A Block Adaptive Frequency Domain MIMO DFE for Wideband Channels
The equalization of MIMO frequency selective channels is a challenging task due to the increased filter lengths required and the presence of interstream interference. In wideband systems where high delay spread channels arise and long transmission bursts are employed, adaptive equalization is necessary. In this work, we develop an adaptive MIMO DFE for wideband time varying systems. To reduce computational complexity and accelerate convergence rate, the equalizer is fully implemented in the frequency domain, while an inherent causality problem is efficiently solved through an iterative scheme. As verified by simulations, the proposed method offers a good trade off in terms of complexity and convergence, compared to other related adaptive algorithms.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15206149) , III-197-197
A Block Adaptive Frequency Domain MIMO DFE for Wideband Channels
The equalization of MIMO frequency selective channels is a challenging task due to the increased filter lengths required and the presence of interstream interference. In wideband systems where high delay spread channels arise and long transmission bursts are employed, adaptive equalization is necessary. In this work, we develop an adaptive MIMO DFE for wideband time varying systems. To reduce computational complexity and accelerate convergence rate, the equalizer is fully implemented in the frequency domain, while an inherent causality problem is efficiently solved through an iterative scheme. As verified by simulations, the proposed method offers a good trade off in terms of complexity and convergence, compared to other related adaptive algorithms.
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 135-139
Information Outage Probability of Orthogonal Space-Time Block Codes over Hoyt Distributed Fading Channels
In this paper the information outage probability (IOP) of orthogonal space-time block coded multiple-input multiple-output (MIMO) systems operating over Hoyt distributed fading channels is investigated. In our analysis, we consider two separate fading cases. For independent identically distributed (i.i.d.) fading channels, exact closed-form expressions of the IOP are derived. For non-identically Hoyt distributed fading, we express the problem in a different equivalent form, and propose the use of the saddlepoint method to approximate the IOP. As verified by extensive computer simulations, the saddlepoint approximation method provides very accurate results, making it an approach that could potentially be applied in performance evaluation of wireless communication systems
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 135-139
Information Outage Probability of Orthogonal Space-Time Block Codes over Hoyt Distributed Fading Channels
In this paper the information outage probability (IOP) of orthogonal space-time block coded multiple-input multiple-output (MIMO) systems operating over Hoyt distributed fading channels is investigated. In our analysis, we consider two separate fading cases. For independent identically distributed (i.i.d.) fading channels, exact closed-form expressions of the IOP are derived. For non-identically Hoyt distributed fading, we express the problem in a different equivalent form, and propose the use of the saddlepoint method to approximate the IOP. As verified by extensive computer simulations, the saddlepoint approximation method provides very accurate results, making it an approach that could potentially be applied in performance evaluation of wireless communication systems
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19483244,p. 1-5
An Adaptive Decision Feedback Equalizer for Time-Varying Frequency Selective MIMO Channels
A new adaptive equalizer for wireless systems operating over time-varying and frequency selective multiple-input multiple-output (MIMO) channels is proposed. The equalizer consists of a number of decision feedback equalizer (DFE) stages, each one detecting a single stream. The equalizer filters, as well as the ordering by which the streams are extracted, are updated according to a LS cost function in a VBLAST-like fashion. By taking advantage of the underlying order recursive problem structure, a computationally efficient and numerically robust algorithm is developed based on the Cholesky factorization of the input data autocorrelation matrix. The convergence and tracking capabilities of the equalizer are studied through extensive computer simulations, and its BER performance is evaluated for hostile, time and frequency selective channels
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19483244,p. 1-5
An Adaptive Decision Feedback Equalizer for Time-Varying Frequency Selective MIMO Channels
A new adaptive equalizer for wireless systems operating over time-varying and frequency selective multiple-input multiple-output (MIMO) channels is proposed. The equalizer consists of a number of decision feedback equalizer (DFE) stages, each one detecting a single stream. The equalizer filters, as well as the ordering by which the streams are extracted, are updated according to a LS cost function in a VBLAST-like fashion. By taking advantage of the underlying order recursive problem structure, a computationally efficient and numerically robust algorithm is developed based on the Cholesky factorization of the input data autocorrelation matrix. The convergence and tracking capabilities of the equalizer are studied through extensive computer simulations, and its BER performance is evaluated for hostile, time and frequency selective channels
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7, 3135-3139
A Square-Root Adaptive V-BLAST Algorithm for Fast Time-Varying MIMO Channels
Among the methods that have been proposed for a Multiple-Input Multiple-Output (MIMO) receiver, the V-BLAST algorithm provides a good compromise between transmission rate, achievable diversity, and decoding complexity. In this paper, we derive a new adaptive V-BLAST type equalization scheme for fast time varying, flat fading MIMO channels. The proposed equalizer stems from the Cholesky factorization of MIMO system's output data autocorrelation matrix and the equalizer's filters are updated in time using numerically robust unitary Givens rotations. The new square-root algorithm exhibits identical performance to a recently proposed V-BLAST adaptive algorithm, offering at the same time substantially reduced computational complexity. Moreover, as expected due to its square-root form and verified by simulations, the algorithm exhibits particularly favourable numerical behaviour.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7, 3135-3139
A Square-Root Adaptive V-BLAST Algorithm for Fast Time-Varying MIMO Channels
Among the methods that have been proposed for a Multiple-Input Multiple-Output (MIMO) receiver, the V-BLAST algorithm provides a good compromise between transmission rate, achievable diversity, and decoding complexity. In this paper, we derive a new adaptive V-BLAST type equalization scheme for fast time varying, flat fading MIMO channels. The proposed equalizer stems from the Cholesky factorization of MIMO system's output data autocorrelation matrix and the equalizer's filters are updated in time using numerically robust unitary Givens rotations. The new square-root algorithm exhibits identical performance to a recently proposed V-BLAST adaptive algorithm, offering at the same time substantially reduced computational complexity. Moreover, as expected due to its square-root form and verified by simulations, the algorithm exhibits particularly favourable numerical behaviour.