Marc Moeneclaey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Marc Moeneclaey has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Heidi Steendam
Univ Ghent, Dept Telecommun & Informat Proc, B-9000 Ghent, Belgium
8 shared publications - Herwig Bruneel
SMACS Research Group, Department of Telecommunications and Information Processing, Ghent University, Ghent, Belgium
7 shared publications - Nele Noels
DIGCOM Research Group, TELIN Department, Ghent University, St.-Pietersnieuwstraat 41, B-9000 Gent, Belgium
5 shared publications - Frederik Simoens
Department of Telecommunications and Information Processing, Faculty of Engineering, Ghent University, 9000 Gent, Belgium
3 shared publications - Joris Walraevens
Ghent University
3 shared publications - D. Van Welden
TELIN Department, Ghent University, Sint-Pietersnieuwstraat 41, 9000 Gent, Belgium
2 shared publications
Latest Publications
- 1 October 2009
- Published by Elsevier in AEU - International Journal of Electronics and Communications
- Vol. 63 (10) , 853-858
Performance analysis of a discrete-time queueing system with priority jumps
- 1 October 2009
- Published by Elsevier in AEU - International Journal of Electronics and Communications
- Vol. 63 (10) , 853-858
Performance analysis of a discrete-time queueing system with priority jumps
- 1 May 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 79-84
Influence of pilot symbol configuration on data-aided phase noise estimation from a DCT basis expansion
This contribution deals with phase noise estimation from pilot symbols. The phase noise process is approximated by an expansion of DCT basis functions containing only a few terms. We propose an algorithm that estimates the DCT coefficients without requiring detailed knowledge about the phase noise statistics. We demonstrate that the resulting (linearized) mean-square estimation error consists of two contributions: a contribution from the additive noise, that equals the Cramer-Rao lower bound, and a noise-independent contribution that results from the phase noise modeling error. Performance can be optimized by a proper selection of the pilot symbol placement scheme, the number of pilot symbols and the number of estimated DCT coefficients. Choosing the pilot symbol positions such that the DCT basis functions are orthogonal and choosing the pilot symbol ratio such that the phase estimation is accurate while minimizing the overhead energy loss leads to considerable performance improvement as compared to other pilot symbol configurations.
- 1 May 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 79-84
Influence of pilot symbol configuration on data-aided phase noise estimation from a DCT basis expansion
This contribution deals with phase noise estimation from pilot symbols. The phase noise process is approximated by an expansion of DCT basis functions containing only a few terms. We propose an algorithm that estimates the DCT coefficients without requiring detailed knowledge about the phase noise statistics. We demonstrate that the resulting (linearized) mean-square estimation error consists of two contributions: a contribution from the additive noise, that equals the Cramer-Rao lower bound, and a noise-independent contribution that results from the phase noise modeling error. Performance can be optimized by a proper selection of the pilot symbol placement scheme, the number of pilot symbols and the number of estimated DCT coefficients. Choosing the pilot symbol positions such that the DCT basis functions are orthogonal and choosing the pilot symbol ratio such that the phase estimation is accurate while minimizing the overhead energy loss leads to considerable performance improvement as compared to other pilot symbol configurations.
- 1 December 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 29-32
True Cramer-Rao Bound for Estimating Synchronization Parameters from a Linearly Modulated Bandpass Signal with Unknown Data Symbols
This paper considers the Cramer-Rao bound (CRB) for estimating the synchronization parameters from a linearly modulated waveform with unknown data symbols. The key idea is to reduce the computational complexity associated with the CRB by exploiting the specific structure of the observed signal. The current contribution builds on previous work, but in this case, no distributional assumptions are made about the data symbols. A generalized closed-form expression of the CRB is presented, the resulting computational complexity is discussed, and numerical results are provided.
- 1 December 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 29-32
True Cramer-Rao Bound for Estimating Synchronization Parameters from a Linearly Modulated Bandpass Signal with Unknown Data Symbols
This paper considers the Cramer-Rao bound (CRB) for estimating the synchronization parameters from a linearly modulated waveform with unknown data symbols. The key idea is to reduce the computational complexity associated with the CRB by exploiting the specific structure of the observed signal. The current contribution builds on previous work, but in this case, no distributional assumptions are made about the data symbols. A generalized closed-form expression of the CRB is presented, the resulting computational complexity is discussed, and numerical results are provided.
- 1 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
The impact of Rayleigh fading on packet loss in FEC-protected real-time packet-based transmission systems
This contribution deals with the transmission of video packets over a wireless link subject to slow Rayleigh fading. In order to provide protection against transmission errors and video packet erasures, we apply forward error correction (FEC) both on the physical layer and the packet layer, which involves the transmission of parity bits and parity packets that enable to recover a number of bit errors and packet erasures. We present an expression for the diversity gain provided, in terms of the fading coherence time, the allowable latency, and the allowable transmission overhead.
- 1 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
The impact of Rayleigh fading on packet loss in FEC-protected real-time packet-based transmission systems
This contribution deals with the transmission of video packets over a wireless link subject to slow Rayleigh fading. In order to provide protection against transmission errors and video packet erasures, we apply forward error correction (FEC) both on the physical layer and the packet layer, which involves the transmission of parity bits and parity packets that enable to recover a number of bit errors and packet erasures. We present an expression for the diversity gain provided, in terms of the fading coherence time, the allowable latency, and the allowable transmission overhead.
- 1 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Asilomar Conference on Signals, Systems & Computers
- No. 10586393,p. 1913-1917
Iterative Carrier Synchronization Techniques in Transmission Systems Protected by a Powerful Error-Correcting Code
This contribution briefly summarizes the authors' previous work on iterative carrier synchronization in transmission systems protected by a powerful error-correcting code. It is shown how maximum-likelihood estimation theory can be used to derive code-aided synchronization structures that are well suited for application in receivers with iterative maximum-a- posteriori bit detection. Simulation results for a turbo-coded system indicate that the proposed joint carrier synchronization and bit detection algorithms yield a lower mean square estimation error than traditional carrier synchronization techniques, and a small bit error rate degradation as compared to a perfectly synchronized receiver.
- 1 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Asilomar Conference on Signals, Systems & Computers
- No. 10586393,p. 1913-1917
Iterative Carrier Synchronization Techniques in Transmission Systems Protected by a Powerful Error-Correcting Code
This contribution briefly summarizes the authors' previous work on iterative carrier synchronization in transmission systems protected by a powerful error-correcting code. It is shown how maximum-likelihood estimation theory can be used to derive code-aided synchronization structures that are well suited for application in receivers with iterative maximum-a- posteriori bit detection. Simulation results for a turbo-coded system indicate that the proposed joint carrier synchronization and bit detection algorithms yield a lower mean square estimation error than traditional carrier synchronization techniques, and a small bit error rate degradation as compared to a perfectly synchronized receiver.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 28-35
A generic approximate transient analysis applied to a priority queue
In this paper, we develop an efficient method to approximate the transient behavior of queueing systems. More precisely, it is shown how singularity analysis of a known transform function of a transient sequence leads to an approximation of this sequence. To illustrate our approach, the transient system contents of both classes in a two-class discrete-time priority queue are investigated. By means of some numerical examples, we then validate our approximations and demonstrate the usefulness of our approach.
- 1 May 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 28-35
A generic approximate transient analysis applied to a priority queue
In this paper, we develop an efficient method to approximate the transient behavior of queueing systems. More precisely, it is shown how singularity analysis of a known transform function of a transient sequence leads to an approximation of this sequence. To illustrate our approach, the transient system contents of both classes in a two-class discrete-time priority queue are investigated. By means of some numerical examples, we then validate our approximations and demonstrate the usefulness of our approach.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21669570,p. 1-5
An MSE Lower Bound for Parametric and Nonparametric Channel Estimation
This paper compares parametric and nonparametric channel estimation methods in a multipath environment. For both methods, the MSE on the received symbol pulse is shown to consist of a modeling error term and an estimation error term. We lower bound the latter term by computing the associated Cramer-Rao bounds. We point out that the MSE can be minimized by a proper selection of the number of parameters to be estimated. In addition, we present simulation results from practical estimators that confirm our theoretical analysis. Our numerical results indicate that the parametric method outperforms the nonparametric approach.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21669570,p. 1-5
An MSE Lower Bound for Parametric and Nonparametric Channel Estimation
This paper compares parametric and nonparametric channel estimation methods in a multipath environment. For both methods, the MSE on the received symbol pulse is shown to consist of a modeling error term and an estimation error term. We lower bound the latter term by computing the associated Cramer-Rao bounds. We point out that the MSE can be minimized by a proper selection of the number of parameters to be estimated. In addition, we present simulation results from practical estimators that confirm our theoretical analysis. Our numerical results indicate that the parametric method outperforms the nonparametric approach.
- 1 November 2006
- Published by Wiley in European Transactions on Telecommunications
- Vol. 17 (6) , 639-650
Code‐aided Bayesian parameter estimation for multi‐carrier systems
- 1 November 2006
- Published by Wiley in European Transactions on Telecommunications
- Vol. 17 (6) , 639-650
Code‐aided Bayesian parameter estimation for multi‐carrier systems
- 1 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23730854,p. 25-28
Parametric Versus Nonparametric Data-Aided Channel Estimation in a Multipath Fading Environment
This paper compares a parametric and a nonparametric channel estimation method in a multipath fading environment. In the parametric method the gains and delays are estimated and these estimates are used to compute the samples of the received symbol pulse. In the nonparametric method the samples of the received pulse are estimated directly, ignoring the underlying multipath channel structure. We compare these two channel estimation methods in terms of accuracy (characterized by the MSE on the samples of the received pulse) and computational complexity. We also investigate the influence of channel estimation errors on the BER of a decision feedback equalizer
- 1 November 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23730854,p. 25-28
Parametric Versus Nonparametric Data-Aided Channel Estimation in a Multipath Fading Environment
This paper compares a parametric and a nonparametric channel estimation method in a multipath fading environment. In the parametric method the gains and delays are estimated and these estimates are used to compute the samples of the received symbol pulse. In the nonparametric method the samples of the received pulse are estimated directly, ignoring the underlying multipath channel structure. We compare these two channel estimation methods in terms of accuracy (characterized by the MSE on the samples of the received pulse) and computational complexity. We also investigate the influence of channel estimation errors on the BER of a decision feedback equalizer
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 133-137
Design Criteria for Linear Precoders based on a Bitwise Capacity Argument
The use of linear precoding in bit-interleaved coded modulation with iterative decoding leads to a significant performance improvement on AWGN channels. In this contribution, we approach linear precoding from an information theoretical perspective. We compute the bitwise capacity as seen by each of the precoder inputs in order to investigate the impact of precoding for two scenarios: using (i) a non-iterative decoder and (ii) an iterative decoder under a perfect feedback assumption. When restricting to BPSK signaling, the bitwise capacity reveals simple precoding design rules for both scenarios. Simulation results confirm our analytical findings
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 133-137
Design Criteria for Linear Precoders based on a Bitwise Capacity Argument
The use of linear precoding in bit-interleaved coded modulation with iterative decoding leads to a significant performance improvement on AWGN channels. In this contribution, we approach linear precoding from an information theoretical perspective. We compute the bitwise capacity as seen by each of the precoder inputs in order to investigate the impact of precoding for two scenarios: using (i) a non-iterative decoder and (ii) an iterative decoder under a perfect feedback assumption. When restricting to BPSK signaling, the bitwise capacity reveals simple precoding design rules for both scenarios. Simulation results confirm our analytical findings