Multiple-field based code generator and decoder for communications systems

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.

Iterative substructuring Domain Decomposition (DD) methods have been extensively studied, and they are usually associated with nonoverlapping decompositions. It is less known that classical overlapping DD methods can also be formulated in substructured for ...

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

The derivation and numerical implementation of a linearized version of the gyrokinetic (GK) Coulomb collision operator (Jorge et al., J. Plasma Phys., vol. 85, 2019, 905850604) and of the widely used linearized GK Sugama collision operator (Sugama et al., ...

This thesis focuses on the development and validation of a reduced order technique for cardiovascular simulations. The method is based on the combined use of the Reduced Basis method and a Domain Decomposition approach and can be seen as a particular imple ...

Spatial self-attention layers, in the form of Non-Local blocks, introduce long-range dependencies in Convolutional Neural Networks by computing pairwise similarities among all possible positions. Such pairwise functions underpin the effectiveness of non-lo ...

We give a direct construction of a specific central idempotent in the endomorphism algebra of a finite lattice T. This idempotent is associated with all possible sublattices of T which are totally ordered. A generalization is considered in a conjectural fa ...

We present a novel framework for the reconstruction of 1D composite signals assumed to be a mixture of two additive components, one sparse and the other smooth, given a finite number of linear measurements. We formulate the reconstruction problem as a cont ...

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...

Multiple-field based code generator and decoder for communications systems

Chattez avec Graph Search

Linear and nonlinear substructured Restricted Additive Schwarz iterations and preconditioning

TimeEvolver: A program for time evolution with improved error bound

Convex optimization in sums of Banach spaces

Development of advanced linearized gyrokinetic collision operators using a moment approach

Reduction techniques for PDEs built upon Reduced Basis and Domain Decomposition Methods with applications to hemodynamics

Poly-NL: Linear Complexity Non-local Layers With 3rd Order Polynomials

Idempotents in the endomorphism algebra of a finite lattice

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations