并行二进制机的综合
Synthesis of Parallel Binary Machines
摘要:
二进制机器是反馈移位寄存器(FSR)的推广,其中允许反馈和前馈连接,并且不需要寄存器级之间的链式连接。在本文中,我们提出了一个算法的综合二进制机器的最小数目的阶段,对于给定的程度的并行化。我们的实验结果表明,对于具有高线性复杂度的序列,如互补,勒让德,或真正的随机,并行二进制机器是一个数量级小于并行FSR生成相同的序列。所提出的方法对于任何需要具有高频谱效率或高安全性的序列的应用(例如数据传输、无线通信和密码学)都可能具有优势。
英文摘要:
Binary machines are a generalization of Feedback Shift Registers (FSRs) in which both, feedback and feedforward, connections are allowed and no chain connection between the register stages is required. In this paper, we present an algorithm for synthesis of binary machines with the minimum number of stages for a given degree of parallelization. Our experimental results show that for sequences with high linear complexity such as complementary, Legendre, or truly random, parallel binary machines are an order of magnitude smaller than parallel FSRs generating the same sequence. The presented approach can potentially be of advantage for any application which requires sequences with high spectrum efficiency or high security, such as data transmission, wireless communications, and cryptography.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。