Publications de Yuqing Ren | EPFL Graph Search

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.

The CRC-aided successive cancellation list (CA-SCL) decoding algorithm for polar codes has gained widespread adoption thanks to its outstanding performance. However, with the evolution of 6G technologies, the high complexity of CA-SCL decoding poses a chal ...

Channel coding has become an indispensable component of modern communication systems. By introducing redundancy into the transmitted data, it enables the receiver to detect and correct errors without feedback, thereby significantly improving the efficiency ...

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

Node-based successive cancellation list (SCL) decoding has received considerable attention in wireless communications for its significant reduction in decoding latency, particularly with 5G New Radio (NR) polar codes. However, the existing node-based SCL d ...

We present an error correction code (ECC) decoder based on the Guessing Random Additive Noise Decoding (GRAND) with ABandonment (GRANDAB) algorithm for applications that require constant throughput and fixed decoding latency in the Gbps range. This high co ...

Belief propagation (BP) decoding has been recognized for its capacity-approaching performance and high throughput when decoding long low-density parity-check (LDPC) codes. However, the application of BP decoding for short codes is hindered by dense parity- ...

This paper presents the application of genetic algorithms (GenAlg) to optimize polar codes for reducing the decoding latency of fast cyclic redundancy check aided successive cancellation list decoders. The theoretical decoding time steps (TS) in code const ...

The recently proposed recursive projection-aggregation (RPA) decoding algorithm for Reed-Muller codes has received significant attention as it provides near-ML decoding performance at reasonable complexity for short codes. However, its complicated structur ...

Due to its high parallelism, belief propagation (BP)decoding is amenable to high-throughput applications and thusrepresents a promising solution for the ultra-high peak datarate required by future communication systems. To bridge theperformance gap compare ...

Spatially-coupled low-density parity-check (SC-LDPC) codes are considered an important candidate for the upcoming 6G standardization, owing to their superior error-correction capability and practical decoding complexity. However, current high-throughput SC ...

Due to the low-latency and high-reliability require-ments of 5G, low-complexity node-based successive cancellation list (SCL) decoding has received considerable attention for use in 5G communications systems. By identifying special constituent codes in the ...

Turbo codes have been successfully adopted in 4G LTE, which can approach the channel capacity with Bahl-Cocke-Jelinek-Raviv (BCJR) decoding. With the evolution from 4G LTE to 5G NR, there is a demand to design a unified channel decoder that supports both L ...

Compared with the bit-wise successive cancellation list (SCL) decoding of polar codes, the node-based Fast SCL decoding significantly reduces the decoding latency by identifying special constituent codes and decoding these in parallel. To further reduce th ...

We propose an iterative logistic weight based decoder for open forward error correction (oFEC) codes. Compared to Chase-Pyndiah decoding with 93 error patterns, our decoder achieves similar performance with lower complexity. ...

In this paper, we describe a frame-interleaving hardware architecture for a generalized node-based successive cancellation list (SCL) decoder. By efficiently reusing otherwise idle computational units, two independent frames can be decoded simultaneously, ...

Yuqing Ren

Chattez avec Graph Search

GenPolar: Generative AI-Aided Complexity Reduction for Polar SCL Decoding

Efficient Algorithms and VLSI Implementations of FEC Decoders for B5G/6G

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

A Node-Based Polar List Decoder With Frame Interleaving and Ensemble Decoding Support

A GRANDAB Decoder with 8.48 Gbps Worst-Case Throughput in 65nm CMOS

Toward Universal Belief Propagation Decoding for Short Binary Block Codes

Optimizing Polar Codes for Reduced Latency Successive Cancellation List Decoder

Pipelined Architecture for Soft-Decision Iterative Projection Aggregation Decoding for RM Codes

High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes

Towards 6G: Configurable High-Throughput Decoder Implementation for SC-LDPC Codes

A Sequence Repetition Node-Based Successive Cancellation List Decoder for 5G Polar Codes: Algorithm and Implementation

Improved Belief Propagation Decoding of Turbo Codes

Edge-Spreading Raptor-Like LDPC Codes for 6G Wireless Systems

Fast Sequence Repetition Node-Based Successive Cancellation List Decoding for Polar Codes

Iterative Logistic Weight Based Chase Decoder for Open Forward Error Correction

A Low-Latency and High-Performance SCL Decoder with Frame-Interleaving