An Inversionless Iterative Algorithm for Multisequence Shift Register Synthsis

Feng Gui-liang

您当前的位置：

首页 >

文章列表页 >

An Inversionless Iterative Algorithm for Multisequence Shift Register Synthsis

更新时间：2025-12-08

- An Inversionless Iterative Algorithm for Multisequence Shift Register Synthsis
- Acta Electronica Sinica Issue 4, Pages: 60-63(1986)
- 作者机构：
  
  1. 上海计算技术研究所
  2. 美国Lhigh大学
  3. 上海计算技术研究所美国Lhigh大学
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1986
- 稿件说明：
移动端阅览
[1]冯贵良,曾开明.多重序列最短线性移位寄存器综合的无逆迭代法[J].电子学报,1986(04):60-63.

Feng Gui-liang. An Inversionless Iterative Algorithm for Multisequence Shift Register Synthsis[J]. Acta Electronica Sinica, 1986, (4): 60-63.
[1]冯贵良,曾开明.多重序列最短线性移位寄存器综合的无逆迭代法[J].电子学报,1986(04):60-63. DOI：

Feng Gui-liang. An Inversionless Iterative Algorithm for Multisequence Shift Register Synthsis[J]. Acta Electronica Sinica, 1986, (4): 60-63. DOI：

摘要

在纠错编码理论和现代控制理论中

我们经常碰到多重序列最短线性移位寄存器的综合问题。文献〔1〕给出这个问题的一个迭代算法。但是那个迭代算法常要进行数域上求逆元的计算。本文给出了多重序列最短线性移位寄存器综合的一个无逆迭代算法。

Abstract

In theory of error-correcting codes and in cybernetics

it is often required to find the shortest-length linear shift-register

which will generate given multiple sequences. An iterative algorithm for this problem has been previously presented by the authors. But that algorithm needs to calculate inverse elements in a field. In this paper

an inversionless iterative algorithm for multisequence shift register synthsis is presented.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰