一个基于图的线性模拟函数的合成程序

M. Bhanja, B. Ray
{"title":"一个基于图的线性模拟函数的合成程序","authors":"M. Bhanja, B. Ray","doi":"10.1109/SOCC.2017.8226071","DOIUrl":null,"url":null,"abstract":"This paper presents a graph based synthesis procedure for reconfigurable linear analog function. A n-level weighted binary tree structure has been used to represent nth order linear network. Root of the binary tree has two children nodes with weights of first order lowpass filter (LPF) and first order highpass filter (HPF). Traversing through each possible path in the tree implements one filter type. The level 2 binary tree has been transformed to a hexagonal closed graph. This conversion has been done to map the proposed synthesis procedure into field programmable analog array (FPAA), which demonstrates the reusuability and programmability. First order LPF and HPF has been used as basic building blocks, whereas a hexagonal structure is denoted as a configurable analog block (CAB) of the FPAA. The hexagonal topology of the FPAA gives the versatile connectivity between two adjacent CABS of the FPAA. Performance has been verified through SPICE simulations.","PeriodicalId":366264,"journal":{"name":"2017 30th IEEE International System-on-Chip Conference (SOCC)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A graph based synthesis procedure for linear analog function\",\"authors\":\"M. Bhanja, B. Ray\",\"doi\":\"10.1109/SOCC.2017.8226071\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a graph based synthesis procedure for reconfigurable linear analog function. A n-level weighted binary tree structure has been used to represent nth order linear network. Root of the binary tree has two children nodes with weights of first order lowpass filter (LPF) and first order highpass filter (HPF). Traversing through each possible path in the tree implements one filter type. The level 2 binary tree has been transformed to a hexagonal closed graph. This conversion has been done to map the proposed synthesis procedure into field programmable analog array (FPAA), which demonstrates the reusuability and programmability. First order LPF and HPF has been used as basic building blocks, whereas a hexagonal structure is denoted as a configurable analog block (CAB) of the FPAA. The hexagonal topology of the FPAA gives the versatile connectivity between two adjacent CABS of the FPAA. Performance has been verified through SPICE simulations.\",\"PeriodicalId\":366264,\"journal\":{\"name\":\"2017 30th IEEE International System-on-Chip Conference (SOCC)\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 30th IEEE International System-on-Chip Conference (SOCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOCC.2017.8226071\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 30th IEEE International System-on-Chip Conference (SOCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCC.2017.8226071","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

提出了一种基于图的可重构线性模拟函数的合成方法。采用n级加权二叉树结构表示n阶线性网络。二叉树的根有两个子节点,权值分别为一阶低通滤波器(LPF)和一阶高通滤波器(HPF)。遍历树中的每个可能路径实现一种过滤器类型。将二级二叉树转化为六边形闭图。这种转换已经完成了将所提出的合成过程映射到现场可编程模拟阵列(FPAA),证明了可重用性和可编程性。一阶LPF和HPF被用作FPAA的基本构件,而六边形结构被表示为FPAA的可配置模拟块(CAB)。FPAA的六边形拓扑结构提供了FPAA两个相邻cab之间的通用连接。通过SPICE仿真验证了其性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A graph based synthesis procedure for linear analog function
This paper presents a graph based synthesis procedure for reconfigurable linear analog function. A n-level weighted binary tree structure has been used to represent nth order linear network. Root of the binary tree has two children nodes with weights of first order lowpass filter (LPF) and first order highpass filter (HPF). Traversing through each possible path in the tree implements one filter type. The level 2 binary tree has been transformed to a hexagonal closed graph. This conversion has been done to map the proposed synthesis procedure into field programmable analog array (FPAA), which demonstrates the reusuability and programmability. First order LPF and HPF has been used as basic building blocks, whereas a hexagonal structure is denoted as a configurable analog block (CAB) of the FPAA. The hexagonal topology of the FPAA gives the versatile connectivity between two adjacent CABS of the FPAA. Performance has been verified through SPICE simulations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信