article · International Journal of High Speed Computing · 1989
SYSTOLIC ARRAY PROCESSING OF THE SEQUENTIAL DECODING ALGORITHM
Cited by 2Abstract and details only
Abstract
A systolic array processing technique is applied to implementing the stack algorithm form of the sequential decoding algorithm. It is shown that sorting, a key function in the stack algorithm, can be efficiently realized by a special type of systolic arrays known as systolic priority queues. Compared to the stack-bucket algorithm, this approach is shown to have the advantages that the decoding always moves along the optimal path, that it has a fast and constant decoding speed and that its simple and regular hardware architecture is suitable for VLSI implementation. Three types of systolic priority queues are discussed: random access scheme, shift register scheme and ripple register scheme. The property of the entries stored in the systolic priority queue is also investigated. The results are applicable to many other basic sorting type problems.
Cite this paper
Chang, C., & Yao, K. (1989). SYSTOLIC ARRAY PROCESSING OF THE SEQUENTIAL DECODING ALGORITHM. International Journal of High Speed Computing, 01(03), 465–480. https://doi.org/10.1142/s0129053389000251
Chang, C.Y., and K. Yao. “SYSTOLIC ARRAY PROCESSING OF THE SEQUENTIAL DECODING ALGORITHM.” International Journal of High Speed Computing, vol. 01, no. 03, 1989, pp. 465–80, https://doi.org/10.1142/s0129053389000251.
Chang, C.Y., and K. Yao. 1989. “SYSTOLIC ARRAY PROCESSING OF THE SEQUENTIAL DECODING ALGORITHM.” International Journal of High Speed Computing 01 (03): 465–80. https://doi.org/10.1142/s0129053389000251.
Chang, C. and Yao, K. (1989) ‘SYSTOLIC ARRAY PROCESSING OF THE SEQUENTIAL DECODING ALGORITHM’, International Journal of High Speed Computing, 01(03), pp. 465–480. Available at: https://doi.org/10.1142/s0129053389000251.
@article{chang1989systolic,
title = {{SYSTOLIC ARRAY PROCESSING OF THE SEQUENTIAL DECODING ALGORITHM}},
author = {Chang, C.Y. and Yao, K.},
journal = {International Journal of High Speed Computing},
volume = {01},
number = {03},
pages = {465--480},
year = {1989},
doi = {10.1142/s0129053389000251}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Transitive closure on an instruction systolic array
Hans-Werner Lang · International Conference on Systolic Arrays · 2003
Cited by 13
STL’s Stack and Queue
Bruce Sutherland · Apress eBooks · 2014
Cited by 0
Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems
Sun‐Yuan Kung, S. C. Lo, Jonathan C. Lewis · IEEE Transactions on Computers · 1987
Cited by 109
A VLSI algorithm for a systolic array implementation of type IV DST based on a pseudo-band correlation structure
Doru Florin Chiper · International Symposium on Signals, Circuits and Systems · 2011
Cited by 3
A unified VLSI algorithm for a high performance systolic array implementation of type IV DCT/DST
Doru Florin Chiper, M. Omair Ahmad, M.N.S. Swamy · International Symposium on Signals, Circuits and Systems · 2013
Cited by 6
A new systolic array algorithm for memory-based VLSI array implementation of DCT
Doru Florin Chiper · IEEE Symposium on Computers and Communications (ISCC) · 2002
Cited by 15
Systematic approach and software tool for systolic design
Stanislav G. Sedukhin, Igor S. Sedukhin · Lecture notes in computer science · 1994
Cited by 9