Scribd
Upload
41 views2 pages

Fibonacci Sequence Identifier Circuit

The document describes a circuit that takes a 3-bit input (0-7) and outputs the corresponding Fibonacci number in binary. It details the input-output mapping, where each input value corresponds to a specific Fibonacci number. The circuit is designed without error conditions, as the input range is fully defined by the 3-bit input format.

Uploaded by

aaronavakin23
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views2 pages

Fibonacci Sequence Identifier Circuit

The document describes a circuit that takes a 3-bit input (0-7) and outputs the corresponding Fibonacci number in binary. It details the input-output mapping, where each input value corresponds to a specific Fibonacci number. The circuit is designed without error conditions, as the input range is fully defined by the 3-bit input format.

Uploaded by

aaronavakin23
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Fibonacci Sequence Identifier Circuit

PC/CP220 PROJECT PHASE I


FALL 2024

Manjari Narasinga Raju


ID-169045744

Description
This circuit takes a 3-bit input (values from 0 to 7) and outputs the
corresponding Fibonacci number. The Fibonacci sequence starts at 0
and 1, with each subsequent number being the sum of the two
preceding ones.

Inputs
 a0, a1, a2: These 3 binary inputs represent numbers from 0 to 7
in decimal.
Input (Binary) Decimal

000 0

001 1

010 2

011 3

100 4

101 5

110 6

111 7
Outputs
 F0, F1, F2, F3: These 4 binary outputs represent the Fibonacci
number corresponding to the input.
Input Fibonacci (Decimal) Output (Binary)
(Binary)
000 0 0000
001 1 0001
010 1 0001
011 2 0010
100 3 0011
101 5 0101
110 8 1000
111 13 1101

Notes
 The circuit processes inputs from 0 to 7.
 Outputs are exact Fibonacci numbers in binary.
 The Fibonacci sequence starts at 0 and is defined by each
number being the sum of the two preceding ones, i.e., F(n) =
F(n-1) + F(n-2).

Error Conditions and Responses


 No error conditions exist. The input range (0-7) is fully defined,
and invalid inputs are impossible with 3-bit inputs.

FALL 2024

You might also like