Please use this identifier to cite or link to this item: https://doi.org/10.1109/TIT.2004.836670
Title: On the lattice basis reduction multisequence synthesis algorithm
Authors: Wang, L.-P. 
Zhu, Y.-F.
Pei, D.-Y.
Issue Date: Nov-2004
Citation: Wang, L.-P., Zhu, Y.-F., Pei, D.-Y. (2004-11). On the lattice basis reduction multisequence synthesis algorithm. IEEE Transactions on Information Theory 50 (11) : 2905-2910. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2004.836670
Abstract: A lattice basis reduction multisequence synthesis (LBRMS) algorithm was presented with a new, intuitive and vector-form model. In this correspondence, a retined version of the LBRMS algorithm is deduced, from which Massey's conjectured algorithm can be derived. Moreover, if we modify the lattice basis reduction algorithm used in the LBRMS algorithm, a new synthesis algorithm is deduced, which is equivalent to the generalization of the Berlekamp-Massey algorithm proposed by Feng and Tzeng. Therefore, the LBRMS algorithm provides a unified approach to the multisequence shift-register synthesis problem. © 2004 IEEE.
Source Title: IEEE Transactions on Information Theory
URI: http://scholarbank.nus.edu.sg/handle/10635/129957
ISSN: 00189448
DOI: 10.1109/TIT.2004.836670
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

30
checked on Nov 26, 2021

WEB OF SCIENCETM
Citations

26
checked on Nov 26, 2021

Page view(s)

66
checked on Nov 18, 2021

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.