Displacement Convexity in Spatially Coupled Scalar Recursions

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.

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

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 ...

The present invention relates to systems and methods for predicting a prognosis of the neuropsychological and/or neuropsychiatric status in a subject based on reports of Minor Hallucination (MH) events in combination with electrophysiological data of the s ...

The Gm/ID approach has proven to be an efficient technique for the design of low-power analog circuits even in advanced technology nodes. It has already been shown that the normalized Gm/ID is actually a universal figure-of-merit (FoM) that is independent ...

Low-Density Parity-Check (LDPC) decoder is among the power hungry building blocks of wireless communication systems. Voltage scaling down to Near-Threshold (NT) voltages substantially improves energy efficiency, in theory up 10x. However, tuning the voltag ...

Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes; however, their imprecise statistical characterization can severely impair such ...

In the last decade, DNA has been increasingly investigated as an alternative medium for cold data storage, presenting several advantages over standard hard drives such as a higher density, longer lifespan and lower energy consumption. However, such coding ...

Locally correctable codes (LCCs) are error correcting codes C : \Sigmak \rightarrow \Sigman which admit local algorithms that correct any individual symbol of a corrupted codeword via a minuscule number of queries. For systematic codes, this notion is stro ...

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

The local physical properties - such as shape and flexibility - of the DNA double-helix is today widely believed to be influenced by nucleic acid sequence in a non-trivial way. Furthermore, there is strong evidence that these properties play a role in many ...

Neutral Beam Injectors (NBI) for post-DEMO-like reactors must achieve a neutralization efficiency (fraction neutrals/ions) above 70%. To reach this, NBIs based on negative ions are necessary and an innovative concept of this type of injector is based on ph ...

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short blocklength regime. Short blocklengths are commonly employed in massively connected IoT sensor networks in 5G and beyond wireless systems. P ...

E. E. Floyd showed in 1973 that there exist only two nontrivial cobor-dism classes that contain manifolds with three cells, and that they lie in dimen-sions 10 and 5. We prove that there is an action of the cyclic group C2 on the 10-dimensional Floyd manif ...

We revise the proof of low-rate upper bounds on the reliability function of discrete memoryless channels for ordinary and list-decoding schemes, in particular Berlekamp and Blinovsky's zero-rate bound, as well as Blahut's bound for low rates. The available ...

We use numerical bootstrap techniques to study correlation functions of traceless sym-metric tensors of O(N) with two indices ti j. We obtain upper bounds on operator dimen-sions for all the relevant representations and several values of N. We discover sev ...

While systems designers are increasingly turning to hardware accelerators for performance gains, realizing these gains is painstaking and error-prone. It can take several person-months to determine if a given accelerator is a good fit for a given piece of ...

This paper presents an ultra-high-throughput decoder architecture for NB-LDPC codes based on the Hybrid Extended Min-Sum algorithm. We introduce a new processing block that updates a check node and its associated variable nodes in a fully pipelined way, th ...

Since polar were ratified as part of the 5G standard, low-complexity polar decoders with close-to-optimum error-rate performance have received significant attention. Compared to successive cancellation (SC) decoding, both SC list and SC flip decoding can i ...

Signal recovery under generative neural network priors has emerged as a promising direction in statistical inference and computational imaging. Theoretical analysis of reconstruction algorithms under generative priors is, however, challenging. For generati ...

We study the stability of low-density parity-check codes under blockwise or bitwise maximum a posteriori decoding, where transmission takes place over a binary-input memoryless output-symmetric channel. Our study stems from the consideration of constructin ...

Displacement Convexity in Spatially Coupled Scalar Recursions

Chattez avec Graph Search

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

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

System for predicting a prognosis of the neuropsychological and/or neuropsychiatric status in a subject

Design of Cryo-CMOS Analog Circuits using the Gm/ID Approach

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Analysis of the influence of errors in DNA-based image coding

Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity

A Functional Perspective on Information Measures

Landscapes of DNA Mechanics and Genomes

A double-ended helicon source to symmetrize RAID plasma

Secret Key Generation Using Short Blocklength Polar Coding Over Wireless Channels

Floyd's manifold is a conjugation space

A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding

Bootstrapping traceless symmetric O(N) scalars

The Case for Performance Interfaces for Hardware Accelerators

Ultra-High-Throughput EMS NB-LDPC Decoder with Full-Parallel Node Processing

Dynamic SCL Decoder With Path-Flipping for 5G Polar Codes

Multi-layer State Evolution Under Random Convolutional Design

The Stability of Low-Density Parity-Check Codes and Some of its Consequences