Linear Shift-Register Synthesis for Multiple Sequences of Varying Length
Georg Schmidt, Vladimir R. Sidorenko
Abstract
The problem of finding the shortest linear shift-register capable of generating t finite length sequences over some field F is considered. A similar problem was already addressed by Feng and Tzeng. They presented an iterative algorithm for solving this multi-sequence shift-register synthesis problem, which can be considered as generalization of the well known Berlekamp-Massey algorithm. The Feng-Tzeng algorithm works indeed, if all t sequences have the same length. This paper focuses on multi-sequence shift-register synthesis for generating sequences of varying length. It is exposed, that the Feng-Tzeng algorithm does not always give the correct solution in this case. A modified algorithm is proposed and formally proved, which overcomes this problem.
Create a lesson
Related papers
Deterministic Identification over Additive Gaussian Channels
Jonathan E. W. Huffmann, Holger Boche
Knowledge Distillation Driven Semantic NOMA with GAN Refinement for 6G Robotic Vehicle Networks
Qifei Wang, Zhen Gao, Li Qiao et al.
Real-Time Reconstruction of Markov Sources over MPR Channels
Pansee S. Elessawy, Nikolaos Pappas
Minimum Rate For Partially Observable Linear System with Side Information: LQG Plant and Gaussian-Markov Source
Sijie Li, Hyeji Kim
Spectral Approximation and Ergodic-Capacity Convergence of HMIMO Channels under Spatial-Wavenumber Domain Mismatch
Hangsong Yan, Hong Yang, Shu Sun
Sharp Minimax Regret for Infinite-Memory Logistic Prediction
Vaneet Aggarwal