Stride permutation networks for array processors

Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors

Volumn , Issue , 2004, Pages 376-386

  Järvinen, Tuomas ^a   Salmela, Perttu ^a   Sorokin, Harri ^a   Takala, Jarmo ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED DESIGN PROCEDURES; COMPUTATIONAL NODES; SCALABILITY; STRIDE PERMUTATION NETWORKS;

AUTOMATION; COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; DIGITAL SIGNAL PROCESSING; FAST FOURIER TRANSFORMS; HEURISTIC METHODS; RANDOM PROCESSES;

PARALLEL PROCESSING SYSTEMS;

EID: 11244329466     PISSN: 10636862     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASAP.2004.1342486     Document Type: Conference Paper

References (19)

1. J- H. Takala, T. S. Järvinen, and H. T. Sorokin, "Conflict-free parallel memory access scheme for FFT processors," in Proc. IEEE ISCAS, Bangkok, Thailand, May. 25-28 2003.
2. J. A. Hidalgo, J. Lopez, F. Argüello, and E. L. Zapata, "Area-efficient architecture for fast Fourier transform," IEEE Trans. Circuits Syst. II, vol. 46, no. 2, pp. 187-193, Feb. 1999.
3. S. Y. Kim, H. Kim, and I. C. Park, "Path metric memory management for minimising interconnections in Viterbi decoders," IEE Elect. Lett., vol. 37, no. 14, pp. 925-926, July 2001.
4. H. S. Stone, "Parallel processing with the perfect shuffle," IEEE Trans. Comput., vol. C-20, no. 2, pp. 153-161, Feb. 1971.
5. J. Granata, M. Conner, and R. Tolimieri, "Recursive fast algorithms and the role of the tensor product," IEEE Trans. Signal Processing, vol. 40, no. 12, pp. 2921-2930, Dec. 1992.
6. J. Astola and D. Akopian, "Architecture-oriented regular algorithms for discrete sine and cosine transforms," IEEE Trans. Signal Processing, vol. 47, no. 4, pp. 1109-1124, Apr. 1999.
7. J. Kwak and J. You, "One- and two-dimensional constant geometry fast cosine transform algorithms and architectures," IEEE Trans. Signal Processing, vol. 47, no. 7, pp. 2023-2034, July 1999.
8. D. Akopian, J. Takala, J. Astola, and J. Saarinen, "Multistage interconnection networks for parallel Viterbi decoders," IEEE Trans. Commun., vol. 51, no. 9, pp. 1536-1545, Sept. 2003.
9. E. Bidet, D. Castelain, C. Joanblang, and P. Senn, "A fast single-chip implementation of 8192 complex point FFT," IEEE J. Solid-State Circuits, vol. 30, no. 3, pp. 300-305, Mar. 1995.
10. M. Bóo, F. Argüello, J. Bruguera, R. Doallo, and E. Zapata, "High-performance VLSI architecture for the Viterbi algorithm," IEEE Trans. Commun., vol. 45, no. 2, pp. 168-176, Feb. 1997.
11. C. B. Shung, H. D. Lin, R. Cypher, P. H. Siegel, and H. K. Thapar, "Area-efficient architectures for the Viterbi algorithm. Part I:Theory," IEEE Trans. Commun., vol. 41, no. 4, pp. 636-644, Apr. 1993.
12. K. K. Parhi, "Systematic synthesis of DSP data format converters using life-time analysis and forward-backward register allocation," IEEE Trans. Circuits Syst. II, vol. 39, no. 7, pp. 423-440, Jul. 1992.
13. M. Majumdar and K. K. Parhi, "Design of data format converters using two-dimensional register allocation," IEEE Trans. Circuits Syst. II, vol. 45, no. 4, pp. 504-508, Apr. 1998.
14. J. Bae and V. K. Prasanna, "Synthesis of area-efficient and high-throughput rate data format converters," IEEE Trans. VLSI Syst., vol. 6, no. 4, pp. 697-706, Dec. 1998.
15. K. Srivatsan, C. Chakrabarti, and L. Lucke, "A new register allocation scheme for low-power data format converters," IEEE Trans. Circuits Syst. II, vol. 46, no. 9, pp. 1250-1253, Sep. 1999.
16. J. Takala, T. Järvinen, P. Salmela, and D. Akopian, "Multi-port interconnection networks for radix-r-algorithms," in Proc. IEEE ICASSP, Salt Lake City, UT, U.S.A., May 7-11 2001, pp. 1177-1180.
17. J. Takala and T. Järvinen, "Multi-port interconnection networks for matrix transpose," in Proc. IEEE ICASSP, Phoenix, AZ, U.S.A., May 26-29 2002, pp. 874-877.
18. J. C. Carlach, P. Penard, and J. L. Sicre, "TCAD: a 27 MHz 8×8 discrete cosine transform chip," in Proc. IEEE ICASSP, Glasgow, UK, May 23-26 1989, pp. 2429-2432.
19. T. Järvinen and J. Takala, "Stride permutations with switching and register-based networks," Tampere University of Technology, Tampere, Finland, Tech. Rep. 2-04, ISBN 952-15-1217-2, 2004.