Publications associées à Polar Codes: Characterization of Exponent, Bounds, and Constructions

Publications associées (31)

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

Siam Publications2024

First-principles thermodynamics of precipitation in aluminum-containing refractory alloys

Anirudh Raju Natarajan

Materials for high -temperature environments are actively being investigated for deployment in aerospace and nuclear applications. This study uses computational approaches to unravel the crystallography and thermodynamics of a promising class of refractory ...

Pergamon-Elsevier Science Ltd2024

Accelerator-driven Data Arrangement to Minimize Transformers Run-time on Multi-core Architectures

David Atienza Alonso, Giovanni Ansaloni, Alireza Amirshahi

The increasing complexity of transformer models in artificial intelligence expands their computational costs, memory usage, and energy consumption. Hardware acceleration tackles the ensuing challenges by designing processors and accelerators tailored for t ...

2024

Experiments and gyrokinetic simulations of TCV plasmas with negative triangularity in view of DTT operations

Olivier Sauter, Stefano Coda, Alberto Mariani, Justin Richard Ball, Matteo Vallar, Filippo Bagnato

Negative triangularity (NT) scenarios in TCV have been compared to positive triangularity (PT) scenarios using the same plasma shapes foreseen for divertor tokamak test tokamak operations. The experiments provided a NT/PT L-mode pair and a PT H-mode with d ...

Iop Publishing Ltd2024

Randomized low-rank approximation and its applications

Ulf David Persson

In this thesis we will present and analyze randomized algorithms for numerical linear algebra problems. An important theme in this thesis is randomized low-rank approximation. In particular, we will study randomized low-rank approximation of matrix functio ...

EPFL2024

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

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Yifei Shen, Yuqing Ren, Hassan Harb

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

Ieee-Inst Electrical Electronics Engineers Inc2024

Physical insights from the aspect ratio dependence of turbulence in negative triangularity plasmas

Stefano Coda, Justin Richard Ball

In this work, we study the impact of aspect ratio A = R 0 / r (the ratio of major radius R 0 to minor radius r) on the confinement benefits of negative triangularity (NT) plasma shaping. We use high-fidelity flux tube gyrokinetic GENE simulations and consi ...

Iop Publishing Ltd2024

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Colin Peter Sandon

Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...

Ieee-Inst Electrical Electronics Engineers Inc2024

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

Daniel Kressner, Haoze He

Given a family of nearly commuting symmetric matrices, we consider the task of computing an orthogonal matrix that nearly diagonalizes every matrix in the family. In this paper, we propose and analyze randomized joint diagonalization (RJD) for performing t ...

Siam Publications2024

Spectral Estimators for High-Dimensional Matrix Inference

Farzad Pourkamali

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

EPFL2024

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

Reka Inovan

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

EPFL2024

Exploring High-Performance and Energy-Efficient Architectures for Edge AI-Enabled Applications

Joshua Alexander Harrison Klein

The desire and ability to place AI-enabled applications on the edge has grown significantly in recent years. However, the compute-, area-, and power-constrained nature of edge devices are stressed by the needs of the AI-enabled applications, due to a gener ...

EPFL2024

Study of impurity C transport and plasma rotation in negative triangularity on the TCV tokamak

Olivier Sauter, Basil Duval, Stefano Coda, Benoît Labit, Laurie Porte, Alexander Karpushov, Antoine Pierre Emmanuel Alexis Merle, Alessandro Pau, Justin Richard Ball, Filippo Bagnato, Dmytry Mykytchuk

Carbon impurity transport is studied in the TCV tokamak using a charge exchange recombination diagnostic. TCVs flexible shaping capabilities were exploited to extend previous impurity transport studies to negative triangularity (delta < 0). A practical way ...

Iop Publishing Ltd2024

First-principle based predictions of the effects of negative triangularity on DTT scenarios

Olivier Sauter, Gabriele Merlo, Alberto Mariani

Plasmas with negative triangularity (NT) shape have been recently shown to be able to achieve H-mode levels of confinement in L-mode, avoiding detrimental edge localised modes. Therefore, this plasma geometry is now studied as a possible viable option for ...

IOP Publishing Ltd2024

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

David Atienza Alonso, Giovanni Ansaloni, Marco Antonio Rios, Grégoire Axel Eggermann

State-of-the-art Artificial Intelligence (AI) algorithms, such as graph neural networks and recommendation systems, require floating-point computation of very large matrix multiplications over sparse data. Their execution in resource-constrained scenarios, ...

New York2023

Preconditioning techniques for generalized Sylvester matrix equations

Yannis Dirk Voet

Sylvester matrix equations are ubiquitous in scientific computing. However, few solution techniques exist for their generalized multiterm version, as they now arise in an increasingly large number of applications. In this work, we consider algebraic parame ...

2023

A model for the consolidation of hybrid textiles considering air entrapment, dissolution and diffusion

Véronique Michaud, Vincent Werlen

A new model is proposed for the consolidation of hybrid textiles, in which air entrapment and dissolution are considered. One of the key parameters is tow permeability, which is described by the analytical model of Gebart and validated at very high fibre v ...

ELSEVIER SCI LTD2023

T-5 configurations and hyperbolic systems

Riccardo Tione, Carl Johan Peter Johansson

In this paper, we study the rank-one convex hull of a differential inclusion associated to entropy solutions of a hyperbolic system of conservation laws. This was introduced in [B. Kirchheim, S. Muller and V. S(sic)ver & aacute;k, Studying Nonlinear PDE by ...

WORLD SCIENTIFIC PUBL CO PTE LTD2023

Post-Moore's Law Fusion: High-Bandwidth Memory, Accelerators, and Native Half-Precision Processing for CPU-Local Analytics

Anastasia Ailamaki, Viktor Sanca

Modern data management systems aim to provide both cutting-edge functionality and hardware efficiency. With the advent of AI-driven data processing and the post-Moore Law era, traditional memory-bound scale-up data management operations face scalability ch ...

2023

Noncollinear DFT plus U and Hubbard parameters with fully relativistic ultrasoft pseudopotentials

Nicola Marzari, Luca Binci

The magnetic, noncollinear parametrization of Dudarev's DFT + U method is generalized to fully relativistic ultrasoft pseudopotentials. We present the definition of the DFT + U total energy functional and the calculation of forces and stresses in the case ...

Amer Physical Soc2023