Systolic Array Architecture For The Sequential Stack Decoding Algorithm

C. Y. Chang; K. Yao

doi:10.1117/12.936893

4 April 1986 Systolic Array Architecture For The Sequential Stack Decoding Algorithm

C. Y. Chang, K. Yao

Proceedings Volume 0696, Advanced Algorithms and Architectures for Signal Processing I; (1986) https://doi.org/10.1117/12.936893
Event: 30th Annual Technical Symposium, 1986, San Diego, United States

Abstract

A very time consuming step in the existing sequential stack decoding algorithm, known as the stack reordering, is shown to be not fully necessary. The algorithm is then modified and restated in a more concise version so that it can be efficiently implemented by a special type of systolic array called systolic priority queue. This scheme is shown to have simple and regular structure as well as high speed for decoding any convolutional codes, including long convolutional codes.

Citation Download Citation

C. Y. Chang and K. Yao "Systolic Array Architecture For The Sequential Stack Decoding Algorithm", Proc. SPIE 0696, Advanced Algorithms and Architectures for Signal Processing I, (4 April 1986); https://doi.org/10.1117/12.936893

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available