Publications associées à Convolutional code

Fast Low-Complexity Decoders for Low-Rate Polar Codes

Alexios Konstantinos Balatsoukas Stimming, Pascal Giard

Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to better accommoda ...

2018

Design rules for optimizing unipolar coded Brillouin optical time-domain analyzers

Luc Thévenaz, Marcelo Alfonso Soto Hernandez, Zhisheng Yang, Simon Adrien Zaslawski, Zonglei Li

The performance of unipolar unicolor coded Brillouin optical time-domain analysis (BOTDA) is evaluated based on both Simplex and Golay codes. Four major detrimental factors that limit the system performance, including decoded-gain trace distortion, coding ...

2018

Design of LDPC Codes for the Unequal Power Two-User Gaussian Multiple Access Channel

Alexios Konstantinos Balatsoukas Stimming

In this letter, we describe an LDPC code design framework for the unequal power two-user Gaussian multiple access channel using EXIT charts. We show that the sumrate of the LDPC codes designed using our approach can get close to the maximal sum-rate of the ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

Design Techniques for High-Speed Multi-Level Viterbi Detectors and Trellis-Coded-Modulation Decoders

Andreas Peter Burg, Lukas Kull, Thomas Toifl, Giovanni Cherubini

The implementation of a 25.6-Gb/s four-level pulse-amplitude-modulation (4-PAM) reduced-state sliding-block Viterbi detector (VD) is presented. The power consumption of the VD is 105 orilV at a supply voltage of 0.7 V, corresponding to an energy efficiency ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

A Formally Verified NAT Stack

George Candea, Solal Vincenzo Pirelli, Arseniy Zaostrovnykh

Prior work proved a stateful NAT network function to be semantically correct, crash-free, and memory safe. Their toolchain verifies the network function code while assuming the underlying kernel-bypass framework, drivers, operating system, and hardware to ...

2018

A Formally Verified NAT Stack

George Candea, Solal Vincenzo Pirelli, Arseniy Zaostrovnykh

Prior work proved a stateful NAT network function to be, crash-free, memory safe and semantically correct [29]. Their toolchain verifies the network function code while assuming the underlying kernel-bypass framework, drivers, operating system, and hardwar ...

ASSOC COMPUTING MACHINERY2018

Deep Neural Networks for Multiple Speaker Detection and Localization

Jean-Marc Odobez, Petr Motlicek, Weipeng He

We propose to use neural networks for simultaneous detection and localization of multiple sound sources in human-robot interaction. In contrast to conventional signal processing techniques, neural network-based sound source localization methods require few ...

2018

Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Pascal Giard

Polar codes are a recently proposed family of provably capacity-achieving error-correction codes that received a lot of attention. While their theoretical properties render them interesting, their practicality compared to other types of codes has not been ...

Ieee2017

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.

Convolutional code

Fast Low-Complexity Decoders for Low-Rate Polar Codes

Design rules for optimizing unipolar coded Brillouin optical time-domain analyzers

Design of LDPC Codes for the Unequal Power Two-User Gaussian Multiple Access Channel

Design Techniques for High-Speed Multi-Level Viterbi Detectors and Trellis-Coded-Modulation Decoders

A Formally Verified NAT Stack

A Formally Verified NAT Stack

The Stability Condition of LDPC Codes Under MAP Decoding

Deep Neural Networks for Multiple Speaker Detection and Localization

Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders

High-Speed Wireline Link Design

Graph Chatbot

Chattez avec Graph Search

Fast Low-Complexity Decoders for Low-Rate Polar Codes

Design of LDPC Codes for the Unequal Power Two-User Gaussian Multiple Access Channel

High-Speed Wireline Link Design

A Formally Verified NAT Stack

A Formally Verified NAT Stack

The Stability Condition of LDPC Codes Under MAP Decoding

Deep Neural Networks for Multiple Speaker Detection and Localization

Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders

Design Techniques for High-Speed Multi-Level Viterbi Detectors and Trellis-Coded-Modulation Decoders

Design rules for optimizing unipolar coded Brillouin optical time-domain analyzers