120 search results - page 4 / 24 » Low Complexity Algorithms for Linear Recurrences |
PAIRING
2007
Springer
14 years 3 days ago
2007
Springer
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
ICC
2009
IEEE
14 years 22 days ago
2009
IEEE
— In this paper, we propose a novel low complexity soft-in soft-out (SISO) equalizer using the Markov chain Monte Carlo (MCMC) technique. Direct application of MCMC to SISO equal...
ICC
2009
IEEE
14 years 22 days ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
TCOM
2008
13 years 5 months ago
2008
Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum frontend detecti...
SBCCI
2009
ACM
13 years 10 months ago
2009
ACM
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applicat...