Valerio Bioglio

Valerio Bioglio

Auto-generated profile, based on publicly available information

Valerio Bioglio

Mathematical and Algorithmic Sciences Lab Paris Research Center Huawei Technologies Co. Ltd

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 January 2020 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
VBValerio Bioglio
Valerio Bioglio
CCCarlo Condo
Carlo Condo
ILIngmar Land
Ingmar Land
Polar codes have attracted the attention of academia and industry alike in the past decade, such that the 5th generation wireless systems (5G) standardization process of the 3rd generation partnership project (3GPP) chose polar codes as a channel coding scheme. In this tutorial, we provide a description of the encoding process of polar codes adopted by the 5G standard. We illustrate the struggles of designing a family of polar codes able to satisfy the demands of 5G systems, with particular attention to rate flexibility and low decoding latency. The result of these efforts is an elaborate framework that applies novel coding techniques to provide a solid channel code for NR requirements.

1 July 2020 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
VBValerio Bioglio
Valerio Bioglio
FGFrederic Gabry
Frederic Gabry
ILIngmar Land
Ingmar Land
JBJean-Claude Belfiore
Jean-Claude Belfiore
In this paper, we propose a new polar code construction by employing kernels of different sizes in the Kronecker product of the transformation matrix, thus generalizing the original construction by Arikan. These multi-kernel polar codes allow for more flexibility in terms of the code length and for various new design principles. Next to the common reliability design, we provide a design to maximize the minimal distance and a hybrid design combining reliability and distance properties. Numerical results demonstrate the advantage of multi-kernel polar codes under the new design principles compared to punctured and shortened Arikan polar codes.

16 May 2022
Verified
Conference Paper
Open access
CPCharles Pillet
Charles Pillet
VBValerio Bioglio
Valerio Bioglio
ILIngmar Land
Ingmar Land
This paper proposes new polar code design principles for the low-latency automorphism ensemble (AE) decoding. Our proposal permits to design a polar code with the desired automorphism group (if possible) while assuring the decreasing monomial property. Moreover, we prove that some automorphisms are redundant under AE decoding, and we propose a new automorphisms classification based on equivalence classes. Finally, we propose an automorphism selection heuristic based on drawing only one element of each class; we show that this method enhances the block error rate (BLER) performance of short polar codes even with a limited number of automorphisms.

25 January 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
VBValerio Bioglio
Valerio Bioglio
ILIngmar Land
Ingmar Land
CPCharles Pillet
Charles Pillet
In this paper, we propose an analysis of the automorphism group of polar codes, with the aim of designing codes tailored for automorphism ensemble (AE) decoding. Using a novel description of polar codes as monomial codes through negative monomials, we prove the equivalence between the notion of decreasing monomial codes and the universal partial order (UPO) framework for polar codes; this property is widely believed to hold true but a formal proof was missing. We further provide a rigorous mathematical connection between code word permutations and affine transformations, an important link to understand the considered automorphisms. Based on this mathematical formalisms, we analyze the algebraic properties of the affine automorphisms group of polar codes, providing a novel description of its structure. We classify automorphisms such that all automorphisms in the same class lead to the same result under permutation decoding, which gives rise to the concept of redundant automorphisms. Mathematically this is achieved by introducing equivalence classes of affine automorphisms under AE-based decoding. For practical application, we provide an algorithm to compute representatives for the equivalence classes, such that one automorphism from each equivalence class can be selected for use in AE decoding. A numerical analysis of the error correction performance of AE decoding of polar codes, based on equivalence classes, concludes the paper.

1 December 2018
Verified
Conference Paper
Closed access
VBValerio Bioglio
Valerio Bioglio
ILIngmar Land
Ingmar Land
In this paper, we analyze the decoding complexity of polarizing kernels of size larger than p = 2, proposing a general procedure which can be used to marginalize kernels of any size. We use this method to evaluate the decoding equations for optimal binary kernels up to size p = 8. Finally, we experimentally show that, even if T 2 and T 8 share the same polarization exponent, their performance may vary under list decoding, making large kernels of interest for long polar codes.

11 December 2018 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
PFPaul Ferrand
Paul Ferrand
MMMarco Maso
Marco Maso
VBValerio Bioglio
Valerio Bioglio