Scribd Logo
Upload

Welcome to Scribd!

  • Memory Based Approach

    Uploaded by

    adnan
    6 views7 pages
    The document discusses using a memory-based approach to improve resource utilization by dividing a state machine's transition table into multiple tables based on bits or sets of bits. This bit-splitting reduces the number of next state pointers needed and allows for reconfiguration by updating memory contents, providing advantages over a monolithic transition table that would require many pointers and be inefficient. The author is currently developing a bit-split C++ implementation and FPGA hardware implementation to test and demonstrate the approach.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses using a memory-based approach to improve resource utilization by dividing a state machine's transition table into multiple tables based on bits or sets of bits. This bit-splitting reduces the number of next state pointers needed and allows for reconfiguration by updating memory contents, providing advantages over a monolithic transition table that would require many pointers and be inefficient. The author is currently developing a bit-split C++ implementation and FPGA hardware implementation to test and demonstrate the approach.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    6 views7 pages

    Memory Based Approach

    Uploaded by

    adnan
    The document discusses using a memory-based approach to improve resource utilization by dividing a state machine's transition table into multiple tables based on bits or sets of bits. This bit-splitting reduces the number of next state pointers needed and allows for reconfiguration by updating memory contents, providing advantages over a monolithic transition table that would require many pointers and be inefficient. The author is currently developing a bit-split C++ implementation and FPGA hardware implementation to test and demonstrate the approach.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pptx, pdf, or txt
    of 7

    Memory Based Approach

    Mashood Ul Hassan
    Main Idea

    • Why we need it?

    • To improve utilization of resources at our disposal

    • How we do it

    • With the help of Transition tables


    Some Issues

    • Possible out edges…

    • Total 256 pointers needed of several bit wide.

    • Most of them are not Forward transitions.

    • Resulting in wasteful use of memory


    Solution

    • Bit-Splitting of state machine

    • Division of transition table.

    • How to divide?

    • On the basis of bit/set of bits.


    Architecture
    Advantages

    • Lesser next state pointers

    • Down to 16 if divided into 4 tables.

    • Always online system

    • Reconfiguration is only a matter of updating memory


    contents.
    Currently Developing

    1. Bit-Split implementation

    • Written in C++
    • To be tested against example rule-set.

    2. Hardware implementation using FPGA

    You might also like