Fibonacci circuit help

Discussion in 'Homework Help' started by Uyet123, Mar 27, 2015.

  1. Uyet123

    Thread Starter New Member

    Jan 25, 2015
    29
    0
    HI, I am doing an ASM for a fibonacci sequence, but I am getting this error from logisim. Can someone help me fix this, I have been trying to for hours already but no success. New_Picture_2_.jpg
     
  2. WBahn

    Moderator

    Mar 31, 2012
    17,757
    4,800
    Could you describe your design and how you are attempting to solve the problem?
     
  3. Uyet123

    Thread Starter New Member

    Jan 25, 2015
    29
    0
    Nevermind, I got it working. I have to display the digits on a 7 segment display, I am thinking of using binary to bcd, but how do I start on it? Do I make a state table first?
     
  4. WBahn

    Moderator

    Mar 31, 2012
    17,757
    4,800
    Binary to BCD can be done combinatorially.
     
  5. crutschow

    Expert

    Mar 14, 2008
    13,028
    3,237
    But that can require a lot of logic.
    Here's a discussion on other approaches for binary to BCD.
     
  6. LimOn Khan

    New Member

    Apr 6, 2016
    3
    0
    Can You please describe where the start, reset, stop point going? Which circuit is it?
     
  7. Michael Grenader

    New Member

    Dec 27, 2015
    3
    0
    hey, can you explain me how you did the circuit? or send me what you did? that will help alot
     
  8. MrAl

    Well-Known Member

    Jun 17, 2014
    2,439
    492
    Hi,

    How many digits do you have to show?
    If it is a small amount then logic works ok, but if you need like 6 digits probably do it in code. There's an algorithm on the web called something like "double dabble" which i have used several times and it doesnt take up a huge amount of memory space.
    Example:
    0000 0000 1111 start with 0,0,15
    0000 0111 1000 shift left 3 times
    0000 0011 1000 add 3 to center group
    0000 1010 1000 result
    0001 0101 0000 shift left 1 time, result is 1,5,0 which is read "15" in bcd.
    There is a little more to it so you'll have to read up on it.
     
    Last edited: Jul 17, 2016
Loading...