A Highly Concurrent Parallel Version of the Berlekmap-Massey Algorithm and its Pipelined Architecture
Shojiro Sakata · International Symposium on Information Theory and its Applications · 1994
We present a highly concurrent parallel version of the Berlekmap-Massey algorithm and its implementation of systolic array architecture which attains time complexity O(t) with O(t) processing elements so that we can have the optimal total complexity satisfying both requirements of maximum throughput rate and local communication.