Sciweavers

1400 search results - page 52 / 280
» On multiplication in finite fields
Sort
View
MASCOTS
2008
13 years 10 months ago
Optimizing Galois Field Arithmetic for Diverse Processor Architectures and Applications
Galois field implementations are central to the design of many reliable and secure systems, with many systems implementing them in software. The two most common Galois field opera...
Kevin M. Greenan, Ethan L. Miller, Thomas J. E. Sc...
DATE
2009
IEEE
125views Hardware» more  DATE 2009»
14 years 3 months ago
Finite precision processing in wireless applications
—Complex signal processing algorithms are often specified in floating point precision. Thus, a type conversion is needed when the targeted platform requires fixed-point precis...
David Novo, Min Li, Bruno Bougard, Liesbet Van der...
VTC
2006
IEEE
101views Communications» more  VTC 2006»
14 years 2 months ago
A Novel Power Allocation Strategy for Finite Alphabet in MIMO Systems
Abstract— One of the significant benefits of MultipleInput-Multiple-Output (MIMO) for wireless applications is the high spectral efficiency it can achieve. Water filling (WF)...
Jinliang Huang, Svante Signell
EUSFLAT
2001
13 years 10 months ago
Refining aggregation operations in finite ordinal scales
We discuss how to aggregate multiple criteria evaluations belonging to qualitative, linearly ordered scales. Qualitative aggregation operations such as min or max can be refined b...
Didier Dubois, Henri Prade
COMBINATORICS
2006
153views more  COMBINATORICS 2006»
13 years 8 months ago
The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
T. R. Riley, William P. Thurston