Concept

Cyclic prefix

Publications associées (35)

A 4.8pJ/b 6Gb/s ADC-Based PAM-4 Wireline Receiver Data -Path with Cyclic Prefix in 14nm FinFET

Andreas Peter Burg, Cosimo Aprile, Yusuf Leblebici, Alessandro Cevrero, Lukas Kull, Gain Kim, Ilter Ozkaya, Thomas Toifl

This work presents an ADC-bascd receiver (RX) data-path for frame-based PAM-4 modulation with a cyclic prefix (CP). Similar to discrete multi-tone (DMT) modulation, a frame of PAM-4 symbols arc protected from the channel delay spread by the CP taps. A PAM- ...

IEEE2019

Modulation, Coding, and Receiver Design for Gigabit mmWave Communication

Nicholas Alexander Preyss

While wireless communication has become an ubiquitous part of our daily life and the world around us, it has not been able yet to deliver the multi-gigabit throughput required for applications like high-definition video transmission or cellular backhaul co ...

EPFL2016

Energy-Proportional Single-Carrier Frequency Domain Equalization for mmWave Wireless Communication

Andreas Peter Burg, Nicholas Alexander Preyss, Sara Rodriguez Egea

mmWave wireless communication is proposed for high-throughput and high-density applications. Due to the large channel bandwidth, mmWave systems face a large variation in the observed delay spread. Many proposed single-carrier (SC) mmWave systems rely on cy ...

2015

A closed-form expression for the total degradation in OFDM systems

Stefano Rosati

In this paper, building upon Bussgang's theorem, we present a new expression for the total degradation (TD) in OFDM systems. This novel expression is applicable to any high power amplifier (HPA) model. In case of ideal clipping HPA model and for particular ...

Wiley-Blackwell2015

Rotation Invariant Subcarrier Mapping over DVB-T2 Reserved Tones

Stefano Rosati

This paper presents a new approach, named Rotation Invariant Subcarrier Mapping (RISM), to Peak-to-Average-Power-Ratio (PAPR) reduction in OFDM systems. This technique enables data transmission over those subcarrier which are dedicated to the PAPR reductio ...

Ieee2013

Fast and Robust Parametric Estimation of Jointly Sparse Channels

Martin Vetterli, Yann Barbotin

We consider the joint estimation of multipath channels obtained with a set of receiving antennas and uniformly probed in the frequency domain. This scenario fits most of the modern outdoor communication protocols for mobile access (ETSI Std. 125 913) or di ...

2012

Channel Coding Optimization Based on Slice Visibility for Transmission of Compressed Video over OFDM Channels

Laura Toni

Optimization of multimedia transmissions over wireless channels should be aimed at maximizing the video quality perceived by the final user. For transmission of video sequences over an orthogonal frequency division multiplexing (OFDM) system in a slowly va ...

2012

Estimating Sparse MIMO Channels Having Common Support

Martin Vetterli, Ali Hormati, Yann Barbotin

We propose an algorithm (SCS-FRI) to estimate multipath channels with Sparse Common Support (SCS) based on Finite Rate of Inno- vation (FRI) sampling. In this setup, theoretical lower-bounds are derived, and simulation in a Rayleigh fading environment show ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Compressive Sampling of Multiple Sparse Signals Having Common Support Using Finite Rate of Innovation Principles

Martin Vetterli, Ali Hormati

In sensor networks and communication systems, one is often confronted with sampling multiple sparse signals having a common support set. Multipath channels in a multiple-input multiple-output (MIMO) wireless communication setting is an interesting example ...

Institute of Electrical and Electronics Engineers2011

Comparison of time and frequency domain interpolation implementations for MB-OFDM UWB transmitters

This paper investigates the effect of time-domain (TD) and frequency-domain (FD) interpolation on the performance of a Multi-Band (MB) Orthogonal Frequency Division Multiplexing (OFDM) Ultra-Wideband (UWB) system. We introduce a FD interpolator implemented ...

2010

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search