Sciweavers

113 search results - page 16 / 23
» Fast algorithms for discrete polynomial transforms
Sort
View
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 8 months ago
Compressed Modular Matrix Multiplication
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
INFORMATICALT
2010
145views more  INFORMATICALT 2010»
13 years 5 months ago
GSM Speech Coder Indirect Identification Algorithm
This paper presents GSM speech coder indirect identification algorithm based on sending novel identification pilot signals through the GSM speech channel. Each GSM subsystem distur...
Rajko Svecko, Bojan Kotnik, Amor Chowdhury, Zdenko...
TIP
2011
195views more  TIP 2011»
13 years 3 months ago
Accelerating X-Ray Data Collection Using Pyramid Beam Ray Casting Geometries
Abstract—Image reconstruction from its projections is a necessity in many applications such as medical (CT), security, inspection, and others. This paper extends the 2-D Fan-beam...
Amir Averbuch, Guy Lifschitz, Yoel Shkolnisky
IROS
2007
IEEE
109views Robotics» more  IROS 2007»
14 years 2 months ago
A new approach to segmentation of 2D range scans into linear regions
— Toward obtaining a compact and multiresolution representation of 2D range scans, a wavelet framework is proposed for encoding an orientation measure called Running Angle (RA). ...
Ahad Harati, Roland Siegwart
ICASSP
2010
IEEE
13 years 6 months ago
Bandwidth-intensive FPGA architecture for multi-dimensional DFT
Multi-dimensional (MD) Discrete Fourier Transform (DFT) is a key kernel algorithm in many signal processing algorithms, including radar data processing and medical imaging. Althou...
Chi-Li Yu, Chaitali Chakrabarti, Sungho Park, Vija...