期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

TABULAR TECHNIQUES FOR OR-COINCIDENCE LOGIC 被引量：12

TABULAR TECHNIQUES FOR OR-COINCIDENCE LOGIC
下载PDF
导出
摘要 The map folding method for the conversion between Boolean expression and COC expansions is analyzed. Based on it, the tabular techniques are proposed for the conversion between Boolean expression and COC expansion and for the derivation of GOC expansions with fixed polarities. The Fast Tabular Technique (FTT) for the conversion from the Boolean expression to the GOC expansion with the required polarity is also proposed. The simulative result shows this FTT is faster than others in references because of its inherent parallelism. The map folding method for the conversion between Boolean expression and COC expansions is analyzed. Based on it, the tabular techniques are proposed for the conversion between Boolean expression and COC expansion and for the derivation of GOC expansions with fixed polarities. The Fast Tabular Technique （FTT） for the conversion from the Boolean expression to the GOC expansion with the required polarity is also proposed. The simulative result shows this FTT is faster than others in references because of its inherent parallelism.
作者 Wang Pengjun Chen Xiexiong
机构地区 Institute of Circuits and Systems Department of Information Science and Electronic Engineering
出处 《Journal of Electronics(China)》 2006年第2期269-273,共5页 电子科学学刊（英文版）
基金 Supported by the National Natural Science Foundation of China (No.60273093) the Natural Science Foundation of Zheiinag Province (No.Y104135)
关键词 Tabular technique OR-coincidence logic Fixed polarity OR-coincidence expansion 快速列表技术 FTT 一致性 逻辑函数 固定极性 COC扩展
分类号 TN7 [电子电信—电路与系统]
  • 相关文献

同被引文献30

  • 1葛培明,陈虬.一种基于子域搜索的高效遗传算法[J].计算机工程与应用,2006,42(1):47-49. 被引量：1
  • 2姚茂群,方平,陈偕雄.基于表格法的RM展开系数与或-符合展开系数的转换[J].浙江大学学报（理学版）,2006,33(4):417-419. 被引量：3
  • 3Najm Farid N. A survey of power estimation techniques in VLSI circuits [ J ]. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1994, 2(4): 446-455
  • 4Panda Rajendran, Najm Farid N. Technology decomposition for low-power synthesis [ C] //Proceedings of the IEEE 1995 Custom Integrated Circuits Conference, Santa Clara, California, 1995 : 627-630
  • 5Tan E C, Yang H. Optimization of fixed-polarlty Reed-Muller circuits using dual-polarlty property [J]. Circuits Systems Signal Process, 2000, 19(6): 535-548
  • 6Cheng J, Chen X, Faraj K M. Expansion of logical function in the OR-coincidence system and the transform between it and maxterm expansion [J]. IEE Proceedings Computers and Digital Techniques, 2003, 150(6): 397-402
  • 7Wang L, Almaini A E A. Optimisation of Reed-Muller PLA implementations [J]. IEE Proceedings Circuits, Devices & Systems, 2002, 149(2):119-128
  • 8Wang L, Almaini A E A. Exact minimization of large multiple output FPRM functions [J]. IEE Proceedings Computers and Digital Techniques, 2002, 149(5): 203-212
  • 9Roy Kaushik, Prasad Sharat C. Low-power CMOS VLSI circuit design [M]. New York: John Wiley & Sons, 2000
  • 10H Rahaman, D K Das, B B Bhattacharya. Testable design of AND-EXOR logic networks with universal test sets [J]. Computers and Electrical Engineering, 2009, 35(5): 644-658.

引证文献12

二级引证文献54

Journal of Electronics(China)
2006年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部