Théorème fondamental de l'arithmétique

En mathématiques, et en particulier en arithmétique élémentaire, le théorème fondamental de l'arithmétique ou théorème de décomposition en produit de facteurs premiers s'énonce ainsi : tout entier strictement positif peut être écrit comme un produit de nombres premiers d'une unique façon, à l'ordre près des facteurs. Par exemple, nous pouvons écrire que : = 2 × 3 × 17 ou encore = 2 × 3 × 5 et il n'existe aucune autre factorisation de ou sous forme de produits de nombres premiers, excepté par réarrangement des facteurs ci-dessus. Le nombre 1 est le produit de zéro nombre premier (voir produit vide), de sorte que le théorème est aussi vrai pour 1. Ce résultat se généralise à d'autres ensembles : les anneaux factoriels, comme celui des polynômes à coefficients dans les nombres réels ou complexes (cf. « Arithmétique des polynômes »). Histoire Dans le livre VII de ses Éléments, Euclide énonce une proposition plus faible, suffisante pour certaines applications : tout nombr

Hopf algebras and Hopf-Galois extensions in infinity-categories

Aras Ergus

In this thesis, we study interactions between algebraic and coalgebraic structures in infinity-categories (more precisely, in the quasicategorical model of (infinity, 1)-categories). We define a notion of a Hopf algebra H in an E-2-monoidal infinity-category and lift some results about ordinary Hopf algebras, such as the fundamental theorem of Hopf modules, to this setting. We also study Hopf-Galois extensions in this context. Given a candidate Hopf-Galois extension, i.e., a map f : A -> B of H-comodule algebras where H coacts on A trivially, we construct a structured version of the comparison map B (x)_A B -> H (x) B that allows us to compare the category of descent data for f with a category of "B-modules equipped with a semilinear coaction of H". We provide further insights into the case of commutative (i.e., E-infinity) comodule algebras over a commutative Hopf algebra, for instance a description of the aforementioned category of modules equipped with a semilinear coaction as the limit of a "categorified cobar construction". Moreover, we provide a simple description of comodules over a space in slice categories of the infinity-category of spaces, which enables us to realize multiplicative Thom objects as comodule algebras and thus incorporate them into the aforementioned framework.

EPFL2022

Hardware implementation aspects of polar decoders and ultra high-speed LDPC decoders

Alexios Konstantinos Balatsoukas Stimming

The goal of channel coding is to detect and correct errors that appear during the transmission of information. In the past few decades, channel coding has become an integral part of most communications standards as it improves the energy-efficiency of transceivers manyfold while only requiring a modest investment in terms of the required digital signal processing capabilities. The most commonly used channel codes in modern standards are low-density parity-check (LDPC) codes and Turbo codes, which were the first two types of codes to approach the capacity of several channels while still being practically implementable in hardware. The decoding algorithms for LDPC codes, in particular, are highly parallelizable and suitable for high-throughput applications. A new class of channel codes, called polar codes, was introduced recently. Polar codes have an explicit construction and low-complexity encoding and successive cancellation (SC) decoding algorithms. Moreover, polar codes are provably capacity achieving over a wide range of channels, making them very attractive from a theoretical perspective. Unfortunately, polar codes under standard SC decoding cannot compete with the LDPC and Turbo codes that are used in current standards in terms of their error-correcting performance. For this reason, several improved SC-based decoding algorithms have been introduced. The most prominent SC-based decoding algorithm is the successive cancellation list (SCL) decoding algorithm, which is powerful enough to approach the error-correcting performance of LDPC codes. The original SCL decoding algorithm was described in an arithmetic domain that is not well-suited for hardware implementations and is not clear how an efficient SCL decoder architecture can be implemented. To this end, in this thesis, we re-formulate the SCL decoding algorithm in two distinct arithmetic domains, we describe efficient hardware architectures to implement the resulting SCL decoders, and we compare the decoders with existing LDPC and Turbo decoders in terms of their error-correcting performance and their implementation efficiency. Due to the ongoing technology scaling, the feature sizes of integrated circuits keep shrinking at a remarkable pace. As transistors and memory cells keep shrinking, it becomes increasingly difficult and costly (in terms of both area and power) to ensure that the implemented digital circuits always operate correctly. Thus, manufactured digital signal processing circuits, including channel decoder circuits, may not always operate correctly. Instead of discarding these faulty dies or using costly circuit-level fault mitigation mechanisms, an alternative approach is to try to live with certain malfunctions, provided that the algorithm implemented by the circuit is sufficiently fault-tolerant. In this spirit, in this thesis we examine decoding of polar codes and LDPC codes under the assumption that the memories that are used within the decoders are not fully reliable. We show that, in both cases, there is inherent fault-tolerance and we also propose some methods to reduce the effect of memory faults on the error-correcting performance of the considered decoders.

EPFL2016

Hardware implementation aspects of polar decoders and ultra high-speed LDPC decoders

Alexios Konstantinos Balatsoukas Stimming

EPFL2016

Théorème fondamental de l'arithmétique

Hopf algebras and Hopf-Galois extensions in infinity-categories

Hardware implementation aspects of polar decoders and ultra high-speed LDPC decoders

A uniqueness theorem for fixed points

Hardware implementation aspects of polar decoders and ultra high-speed LDPC decoders

A uniqueness theorem for fixed points

Hopf algebras and Hopf-Galois extensions in infinity-categories