Shuffle Memory System

  • Authors:

  • Kichul Kim

  • Affiliations:

  • -

  • Venue:
  • IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a new memory system called shuffle memory. The shuffle memory is a generalization of transposition memory that has been widely used in 2-D Discrete Cosine Transform and Discrete Fourier Transform. The shuffle memory is the first memory system that receives MxN inputs in row major order while providing MxN outputs in column major order using only MxN memory space. Shuffle memory can provide memory efficient architectures for separable 2-D transforms and separable 2-D filter banks.