Concept

Débit binaire

Publications associées (490)

A 0.14-nJ/b 200-Mb/s 2.7-3.5-GHz Quasi-Balanced FSK Transceiver With PLL-Based Modulation and Sideband Energy Detection

This paper describes a balanced frequency shift keying (FSK) modulation, namely quasi-balanced FSK (QB-FSK), for energy-efficient high-data-rate communication. Not suffering from data-pattern dependency, the proposed modulation method enables frequency mod ...

Piscataway2024

Precoding for High-Throughput Satellite Communication Systems: A Survey

Malek Khammassi

With the expanding demand for high data rates and extensive coverage, high throughput satellite (HTS) communication systems are emerging as a key technology for future communication generations. However, current frequency bands are increasingly congested. ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Planetary-Scale Byzantine Fault Tolerance

Matteo Monti

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

EPFL2024

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Yifei Shen, Yuqing Ren, Hassan Harb

5G New Radio (NR) has stringent demands on both performance and complexity for the design of low-density parity-check (LDPC) decoding algorithms and corresponding VLSI implementations. Furthermore, decoders must fully support the wide range of all 5G NR bl ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Data-driven LPV Disturbance Rejection Control with IQC-based Stability Guarantees for Rate-bounded Scheduling Parameter Variations

Alireza Karimi, Elias Sebastian Klauser

In this paper, the challenge of asymptotically rejecting sinusoidal disturbances with unknown time-varying frequency and bounded rate is explored. A novel data-driven approach for designing linear parameter-varying (LPV) con- troller is introduced, leverag ...

2024

Error estimates for SUPG-stabilised Dynamical Low Rank Approximations

Fabio Nobile, Thomas Simon Spencer Trigo Trindade

We perform an error analysis of a fully discretised Streamline Upwind Petrov Galerkin Dynamical Low Rank (SUPG-DLR) method for random time-dependent advection-dominated problems. The time integration scheme has a splitting-like nature, allowing for potenti ...

2024

Quality-Constrained Encoding Optimization for Omnidirectional Video Streaming

Pascal Frossard, Roberto Gerson De Albuquerque Azevedo, Chaofan He

Omnidirectional video streaming is usually implemented based on the representations of tiles, where the tiles are obtained by splitting the video frame into several rectangular areas and each tile is converted into multiple representations with different r ...

Piscataway2023

Quantization for Decentralized Learning Under Subspace Constraints

Ali H. Sayed, Stefan Vlaski, Roula Nassif, Marco Carpentiero

In this article, we consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints that require the minimizers across the network to lie in low-dimensional subspaces. This constrained fo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Improved Network-Calculus Nodal Delay-Bounds in Time-Sensitive Networks

Jean-Yves Le Boudec, Eleni Stai, Ehsan Mohammadpour

In time-sensitive networks, bounds on worst-case delays are typically obtained by using network calculus and assuming that flows are constrained by bit-level arrival curves. However, in IEEE TSN or IETF DetNet, source flows are constrained on the number of ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

, , , ,

We demonstrate the first EDWA-enabled Terabit-class coherent optical communication with 1.6-Tb/s net bit rate per channel and 16 -channel WDM transmission over 81 -km fiber, proving the potential of such on-chip amplification for future coherent applicatio ...

IEEE2023

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