FPGA上の組合せ回路および順序回路のための新しい論理関数表現法  [in Japanese] New Algebraic Expressions for Combinational and Sequential Circuits on FPGAs  [in Japanese]

Access this Article

Search this Article

Author(s)

Abstract

LUT型FPGA上での組合せ回路の各結線の論理関数を記述するための表現法として、SPD (Sums of Products to be Distinguished)を提案する。また、LUT型FPGA上での順序回路の状態割当を記述し、さらに各結線の論理関数を記述するための表現法として、SPSD (Sums of Products and States to be Distinguished)を提案する。In this paper, SPD (Sums of Products to be Distinguished) is proposed for a new algebraic expression of combinational circuits on LUT-based FPGA. Also SPSD (Sums of Products and States to be Distinguished) is proposed for a new algebraic expression of state assignments and logic functions on LUT-based FPGA realizing sequential circuits.

In this paper, SPD(Sums of Products to be Distinguished)is proposed for a new algebraic expression of combinational circuits on LUT-based FPGA.Also SPSD(Sums of Products and States to be Distinguished)is proposed for a new algebraic expression of state assignments and logic functions on LUT-based FPGA realizing sequential circuits.

Journal

  • IPSJ SIG Notes

    IPSJ SIG Notes 1998(113(1998-SLDM-090)), 99-106, 1998-12-10

    Information Processing Society of Japan (IPSJ)

Codes

  • NII Article ID (NAID)
    110002930453
  • NII NACSIS-CAT ID (NCID)
    AA11451459
  • Text Lang
    JPN
  • Article Type
    Technical Report
  • Data Source
    NII-ELS  IPSJ 
Page Top