Shuffle memory system

Kichul Kim

Shuffle memory system

Kichul Kim

School of Electrical and Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

5 Scopus citations

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 M×N inputs in row major while providing M×N outputs in column major order using only M×N memory space. Shuffle memory can provide memory efficient architectures for separable 2-D transforms and separable 2-D filter banks.

Original language	English
Pages (from-to)	268-272
Number of pages	5
Journal	Proceedings of the International Parallel Processing Symposium, IPPS
State	Published - 1999
Event	Proceedings of the 1999 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing - San Juan Duration: 12 Apr 1999 → 16 Apr 1999

Cite this

@article{27d49144312d45118747c94a24e69736,

title = "Shuffle memory system",

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 M×N inputs in row major while providing M×N outputs in column major order using only M×N memory space. Shuffle memory can provide memory efficient architectures for separable 2-D transforms and separable 2-D filter banks.",

author = "Kichul Kim",

year = "1999",

language = "English",

pages = "268--272",

journal = "Proceedings of the International Parallel Processing Symposium, IPPS",

issn = "1063-7133",

note = "Proceedings of the 1999 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing ; Conference date: 12-04-1999 Through 16-04-1999",

}

TY - JOUR

T1 - Shuffle memory system

AU - Kim, Kichul

PY - 1999

Y1 - 1999

N2 - 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 M×N inputs in row major while providing M×N outputs in column major order using only M×N memory space. Shuffle memory can provide memory efficient architectures for separable 2-D transforms and separable 2-D filter banks.

AB - 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 M×N inputs in row major while providing M×N outputs in column major order using only M×N memory space. Shuffle memory can provide memory efficient architectures for separable 2-D transforms and separable 2-D filter banks.

UR - http://www.scopus.com/inward/record.url?scp=0032643238&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0032643238

SN - 1063-7133

SP - 268

EP - 272

JO - Proceedings of the International Parallel Processing Symposium, IPPS

JF - Proceedings of the International Parallel Processing Symposium, IPPS

T2 - Proceedings of the 1999 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing

Y2 - 12 April 1999 through 16 April 1999

ER -

Shuffle memory system

Abstract

Other files and links

Fingerprint

Cite this