Name
Abstract | ||
|---|---|---|
This paper proposes a flexible architecture for the FFT and Viterbi algorithms based on the Common Operator (CO) technique. The FFT and Viterbi structural similarities are investigated to build a common architecture for both algorithms where area is traded against throughput. FPGA implementation and experimental results are discussed in this paper. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISCIT.2012.6381037 | ISCIT |
Keywords | Field | DocType |
fast fourier transforms,field programmable gate arrays,flexible electronics,maximum likelihood estimation,co technique,fft algorithm,fpga implementation,viterbi algorithm,common operator technique,flexible processor architecture,common operator,fft,parallel vector processor,parametrization,software radio,viterbi | Prime-factor FFT algorithm,Computer science,Software-defined radio,Soft output Viterbi algorithm,Parallel computing,Algorithm,Field-programmable gate array,Fast Fourier transform,Throughput,Iterative Viterbi decoding,Viterbi algorithm | Conference |
ISBN | Citations | PageRank |
978-1-4673-1155-7 | 0 | 0.34 |
References | Authors | |
8 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Malek Naoues | 1 | 9 | 2.98 |
| Dominique Noguet | 2 | 156 | 16.97 |
| Yves Louët | 3 | 112 | 23.96 |
| Khaled Grati | 4 | 8 | 3.95 |
| Adel Ghazel | 5 | 63 | 24.44 |