Construct a synchronous moore state machine with two inputs, A and B, and two outputs, X and Y. The machine accepts data on two input lines synchronously with the clock. The output X is 1 if and only if the data on the two input lines have been identical (i.e. A and B are both 1, or A and B are both 0) for the last three or more consecutive clock cycles. Output Y is 1 if and only if the data on the two input lines have been complements of each other (i.e. A = 1 and B = 0, or A = 0 and B = 1) for the last three or more consecutive clock cycles.
Hello Everyone, This is My first blog ever. I have created this blog to discuss about various topics in the field of ASIC. You'll find lot of useful information about verification. Keep visiting this site for more updates.
Search This Blog
About Me
Categories
- Digital (18)
- Specman Tutorial (12)
- Verification (10)
- Verilog (8)
- Learn C (6)
- Timing (6)
- Synthesis (5)
- General (4)
- SOC (4)
- Specman (4)
- State Machine (4)
- DFT (3)
- RTL (3)
- FPGA (2)
- Gate level simulation (2)
- Low power (2)
- VHDL (2)
- VLSI (2)
- AMS (1)
- CMOS (1)
- Clock divider (1)
- FIFO (1)
- Reset (1)
Archives
-
▼
2008
(86)
-
▼
Apr
(15)
- Guidelines for improving the performance of synthesis
- SOC Verification 3
- Will we ever get a handle on SoC verification cost?
- SOC Verification 2
- SOC Verification 1
- Sequence Detector - Solution
- Sequence Detector
- Mod - 10 counter
- DAG
- Counter design using FSM
- FSM Problem
- Clock Tree Synthesis
- State Diagram
- Depth of the Asynchronous FIFO
- Functional Coverage vs Code Coverage
-
▼
Apr
(15)
BlogRoll
2 comments:
could you please post the solution or any pointers if possible.
thanks.
Simple, Just XOR the inputs ie. A and B and then obtain a value say x.
So this x can be used as an input to the state machine and rest all is plain. :)
Post a Comment