FPGA实现的导引置乱线编码技术

C. D. Murphy, L.C. Dickinson, I. Fair
{"title":"FPGA实现的导引置乱线编码技术","authors":"C. D. Murphy, L.C. Dickinson, I. Fair","doi":"10.1109/CCECE.1998.685604","DOIUrl":null,"url":null,"abstract":"The guided scrambling (GS) line coding technique was introduced by Fair, Grover, Krzymien, and MacDonald (1991) as a novel mechanism to ensure that binary transmitted sequences exhibit desirable line code characteristics. We describe a field programmable gate array (FPGA) implementation of GS. The system accommodates code words of up to 32 bits in length, with one or two augmenting bits per word. It permits specification of any scrambling polynomial with degree less than or equal to 32, and through the choice of two code word selection mechanisms, can be optimized for either high transition density or minimization of low frequency content. The system is used to verify theoretical expectations for the power spectral density of the encoded stream for various scrambling parameters, and to confirm expected trends in the statistics of encoded sequences for code configurations whose theoretical analysis is impractical.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"FPGA implementation of the guided scrambling line coding technique\",\"authors\":\"C. D. Murphy, L.C. Dickinson, I. Fair\",\"doi\":\"10.1109/CCECE.1998.685604\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The guided scrambling (GS) line coding technique was introduced by Fair, Grover, Krzymien, and MacDonald (1991) as a novel mechanism to ensure that binary transmitted sequences exhibit desirable line code characteristics. We describe a field programmable gate array (FPGA) implementation of GS. The system accommodates code words of up to 32 bits in length, with one or two augmenting bits per word. It permits specification of any scrambling polynomial with degree less than or equal to 32, and through the choice of two code word selection mechanisms, can be optimized for either high transition density or minimization of low frequency content. The system is used to verify theoretical expectations for the power spectral density of the encoded stream for various scrambling parameters, and to confirm expected trends in the statistics of encoded sequences for code configurations whose theoretical analysis is impractical.\",\"PeriodicalId\":177613,\"journal\":{\"name\":\"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCECE.1998.685604\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE.1998.685604","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

引导加扰(GS)行编码技术是由Fair, Grover, Krzymien和MacDonald(1991)提出的,作为一种确保二进制传输序列具有理想的行编码特性的新机制。我们描述了一种现场可编程门阵列(FPGA)实现的GS。该系统最多可容纳32位长度的码字,每个字有一个或两个增加位。它允许指定任何小于或等于32度的置乱多项式,并且通过选择两种码字选择机制,可以优化为高跃迁密度或最小化低频内容。该系统用于验证不同置乱参数下编码流功率谱密度的理论期望,并用于理论分析无法实现的码组编码序列统计的预期趋势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
FPGA implementation of the guided scrambling line coding technique
The guided scrambling (GS) line coding technique was introduced by Fair, Grover, Krzymien, and MacDonald (1991) as a novel mechanism to ensure that binary transmitted sequences exhibit desirable line code characteristics. We describe a field programmable gate array (FPGA) implementation of GS. The system accommodates code words of up to 32 bits in length, with one or two augmenting bits per word. It permits specification of any scrambling polynomial with degree less than or equal to 32, and through the choice of two code word selection mechanisms, can be optimized for either high transition density or minimization of low frequency content. The system is used to verify theoretical expectations for the power spectral density of the encoded stream for various scrambling parameters, and to confirm expected trends in the statistics of encoded sequences for code configurations whose theoretical analysis is impractical.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The use of ISDN signaling for real-time applications at homes and small businesses Multifractal analysis of DNA Multimedia courseware delivery over the Internet The VideoWriter: towards active paper for a natural user interface A performance based analysis of a robust flux controller for an induction motor drive
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1