Sciweavers

156 search results - page 15 / 32
» Fast Interpolating BMC
Sort
View
81
Voted
VTC
2006
IEEE
148views Communications» more  VTC 2006»
15 years 3 months ago
Exploiting Channel Time Selectivity in Pilot-Aided Alamouti STBC Systems
Abstract-In fast time varying systems, the problem of acquiring the channel coefficients required for symbol decoding commonly arises. A method of resolving this problem is the use...
Woon Hau Chin
DGCI
2009
Springer
15 years 2 months ago
Pixel Approximation Errors in Common Watershed Algorithms
Abstract. The exact, subpixel watershed algorithm delivers very accurate watershed boundaries based on a spline interpolation, but is slow and only works in 2D. On the other hand, ...
Hans Meine, Peer Stelldinger, Ullrich Köthe
NIPS
2003
14 years 11 months ago
Generalised Propagation for Fast Fourier Transforms with Partial or Missing Data
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where ...
Amos J. Storkey
65
Voted
DAC
2004
ACM
15 years 3 months ago
Fast and accurate parasitic capacitance models for layout-aware
Considering layout effects early in the analog design process is becoming increasingly important. We propose techniques for estimating parasitic capacitances based on look-up tabl...
Anuradha Agarwal, Hemanth Sampath, Veena Yelamanch...
MOC
2002
135views more  MOC 2002»
14 years 9 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami