2 1 2 1 2 1 2 1 2 1 problem no 4 the state

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2. 1 Problem No. 4: The state diagram is as follows: 2. 1. 2. 1. 2 ⊕ y1 ⊕ x 1 Let us use state variables y1 and y2 to express each state as a 2-bit number y2y1. We use the following state assignment: S0 = 00, S1 = 01, S2=10, and S3=11. The resultant state-assigned state table is as follows: Present State Next State Output z y2 y1 Y2Y1 00 11 1 01 10 0 10 00 1 11 01 0 Logic expressions to implement this state machine are as follows: 2 1 2. 1 2. 1 2. 1 2. 1 2. 1 2. 1 2 2 ⊕ y1 1 Based on the above expressions, the logic circuit implementation of the counter is shown below: Problem No. 5 (a) 16-bit 2’s-complement representation can specify signed integers ranging from -216-1 to +216-1-1 or between -32768 and +32767. (b) Problem No. 6...
View Full Document

This document was uploaded on 02/01/2014.

Ask a homework question - tutors are online