Interconnected loop digital transmission system
阅读：955发布：2022-03-02
专利汇可以提供Interconnected loop digital transmission system专利检索，专利查询，专利分析的服务。并且A digital communication loop system wherein transfers of signal message blocks between interconnecting loops are only made when a Hamming distance criterion is satisfied. Appended to each message block is a loop destination address code comprised of a first ordered concatenation of two binary sequences. Stored at each interconnecting loop transfer point is an address code identifying one of said interconnecting loops, comprised of a second ordered concatenation of two binary sequences. The product of the first and second ordered codes is formed to determine the Hamming distance between the loop destination address code and the address code identifying the interconnecting loop.，下面是Interconnected loop digital transmission system专利的具体信息内容。
1. In an interconnecting loop digital transmission system, including means for transferring a message block to an interconnecting loop when the Hamming distance between an identifying three-level encoded destination loop address code of said message block and an identifying three-level encoded address code of the loop in which said message block is present will be reduced, the improvement comprising: first means for detecting in each message block a loop destination address code comprised of a first ordered concatenation of two binary sequences; second means for storing at each interconnecting loop transfer means an address code comprised of a second ordered concantenation of two binary sequences identifying one of said interconnecting loops; and third means for forming the scalar product of said first and second ordered codes to determine the Hamming distance between said loop destination address code and said identifying interconnecting loop address code.
2. In an interconnecting loop digitAl transmission system, including means for transferring a message block to an interconnecting loop when the Hamming distance between an identifying three-level encoded destination loop address code of said message block and an identifying three-level encoded address code of the interconnecting loop in which said message block is present will be reduced, the improvement comprising: first means for detecting in each message block a loop destination address code comprised of a first concatenation of a first and a second binary sequence; second means for storing an address code identifying one of said interconnecting loops comprised of a second concatenation of a third and a fourth binary sequence; and third means for forming the scalar product of said first and second ordered concatenated codes to determine the Hamming distance between said loop destination address code and said interconnecting loop address code.
3. In an interconnecting loop digital transmission system, including means for transferring a message block to an interconnecting loop, identified by a three-level encoded address code hk, when the Hamming distance between an identifying three-level destination loop address code hi of said message block and an identifying three-level encoded address code hj of the interconnecting loop in which said message block is present will be reduced, the improvement comprising: first means for detecting in each message block a loop destination address code comprised of a first ordered concatenation of a first and a second binary sequence, said first sequence having binary ones where hi has ones and binary zeros elsewhere and said second sequence having binary ones where hi has zeros and binary zeros elsewhere; second means for storing at each interconnecting loop transfer station an address code identifying said interconnecting loop in which said message block is present comprised of a second ordered concatenation of a third and a fourth binary sequence, said third sequence having binary ones where hj has zeros and binary zeros elsewhere and said fourth sequence having binary ones where hj has ones and binary zeros elsewhere; and third means for forming the scalar product of said first and second ordered codes to determine the Hamming distance between said loop destination address code hi and said interconnecting loop address code hj.
4. The improvement defined by claim 3 further comprising: fourth means for storing at each interconnecting loop transfer station an address code identifying said other interconnecting loop comprised of a third ordered concatenation of a fifth and a sixth binary sequence, said fifth sequence having binary ones where hk has zeros and binary zeros elsewhere and said sixth sequence having binary ones where hk has ones and binary zeros elsewhere; and fifth means for forming the scalar product of said first and third ordered codes to determine the Hamming distance between said loop destination address code hi and said interconnecting loop address code hk.
5. The improvement defined by claim 4 further comprising: sixth means responsive to said third and fifth means for developing a transfer control signal when said scalar product of said fifth means is less than said scalar product of said third means.
6. In an interconnecting loop digital transmission system wherein the destination loop of a message block is identified by a three-level encoded address code hi, the loop in which said message block is present is identified by a three-level encoded address code hj, and a loop interconnecting with said loop hj is identified by a three-level encoded address code hk, said codes hi, hj and hk, assigned in accordance with a Hamming distance criterion, the improvement comprising: means for appendiNg to each message block a first ordered concatenation of a first and second binary sequence, said first sequence having binary ones where hi has ones and binary zeros elsewhere, said second sequence having binary ones where hi has zeros and binary zeros elsewhere; means for storing at each loop interconnection second and third ordered concatenations of binary sequences representing, respectively, said interconnecting loop addresses hj and hk, said second ordered concatenation comprising third and fourth binary sequences, said third sequence having binary ones where hj has zeros and binary zeros elsewhere, said fourth sequence having binary ones where hj has ones and binary zeros elsewhere, said third ordered concatenation comprising fifth and sixth binary sequences, said fifth sequence having binary ones where hk has zeros and binary zeros elsewhere, said sixth sequence having binary ones where hk has ones and binary zeros elsewhere; means forming first and second scalar products, respectively, of said first and second ordered concatenations and said first and third ordered concatenations; and means for transferring said message block to said interconnecting loop when said second scalar product is less than said first scalar product.
7. In an interconnecting loop digital transmission system wherein the destination loop of a message block is identified by a three-level encoded address code hi, and two interconnecting loops are identified by three-level encoded address codes hj and hk, said codes hi, hj and hk assigned in accordance with a Hamming distance criterion, the improved method comprising the steps of: associating with each message block a first loop destination address code comprised of a first ordered concatenation (ai, bi) of two binary sequences derived from hi; storing at each loop interconnection a second address code comprised of a second ordered concatenation (bj, aj) of two binary sequences derived from hj; and forming the product of said first and second address codes to determine the Hamming distance between said codes hi and hj.
8. The method of claim 7 further comprising the steps of: storing at each loop interconnection a third address code comprised of a third ordered concatenation (bk, ak) of two binary sequences derived from hk; and forming the product of said first and third address codes to determine the Hamming distance between said codes hi and hk.
9. The method of claim 8 wherein ai has ones where hi has ones and zeros elsewhere, bi has ones where hi has zeros and zeros elsewhere, bj has ones where hj has zeros and zeros elsewhere and aj has ones where hj has ones and zeros elsewhere, bk has ones where hk has zeros and zeros elsewhere and ak has ones where hk has ones and zeros elsewhere.
10. In an interconnecting loop digital transmission system wherein the destination loop of a message block is identified by a three-level encoded address code hi, the loop in which said message block is present is identified by a three-level encoded address code hj, and a loop interconnecting with said loop j is identified by a three-level encoded address code hk, said codes hi, hj, and hk, assigned in accordance with a Hamming distance criterion and said three-level code comprising the characters 0, 1, and a third arbitrary character, the improved method comprising the steps of: appending to said message block a first ordered concatenation of a first and second binary sequence, said first sequence having binary ones where hi has ones and binary zerOs elsewhere, said second sequence having binary ones where hi has zeros and binary zeros elsewhere; storing at said loop interconnection second and third ordered concatenations of binary sequences representing, respectively, said interconnecting loop addresses hj and hk, said second ordered concatenation comprising third and fourth binary sequences, said third sequence having binary ones where hj has zeros and binary zeros elsewhere, said fourth sequence having binary ones where hj has ones and binary zeros elsewhere, said third ordered concatenation comprising fifth and sixth binary sequences, said fifth sequence having binary ones where hk has zeros and binary zeros elsewhere, said sixth sequence having binary ones where hk has ones and binary zeros elsewhere; forming first and second scalar products, respectively, of said first and second ordered concatenations and said first and third ordered concatenations; and transferring said message block to said interconnecting loop when said second scalar product is less than said first scalar product.
| 标题 | 发布/更新时间 | 阅读量 |
|---|---|---|
| 一种烟道止回阀的自适应编码方法 | 2020-05-08 | 154 |
| 一种配电网络无功补偿控制方法 | 2020-05-11 | 333 |
| 一种基于电力载波通讯的土壤PH值传感器 | 2020-05-12 | 728 |
| 一种基于I2C总线的灯光高频控制系统及其控制方法 | 2020-05-08 | 700 |
| 多点触摸与遥控共用检测控制方法 | 2020-05-11 | 533 |
| 一种烟道止回阀的自适应编码方法 | 2020-05-08 | 139 |
| 一种烟道止回阀的自适应编码方法 | 2020-05-08 | 665 |
| 一种LED灯珠地址码的烧录方法及装置 | 2020-05-11 | 691 |
| 一种基于谐波调制技术的码分多址通信方法 | 2020-05-08 | 98 |
| 一种DP工业智能网关 | 2020-05-11 | 142 |
高效检索全球专利专利汇是专利免费检索,专利查询,专利分析-国家发明专利查询检索分析平台，是提供专利分析，专利查询，专利检索等数据服务功能的知识产权数据服务商。
我们的产品包含105个国家的1.26亿组数据，免费查、免费专利分析。
分析报告
专利汇分析报告产品可以对行业情报数据进行梳理分析，涉及维度包括行业专利基本状况分析、地域分析、技术分析、发明人分析、申请人分析、专利权人分析、失效分析、核心专利分析、法律分析、研发重点分析、企业专利处境分析、技术处境分析、专利寿命分析、企业定位分析、引证分析等超过60个分析角度，系统通过AI智能系统对图表进行解读，只需1分钟，一键生成行业专利分析报告。
QQ群二维码
意见反馈
意见反馈