<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for Room 514</title>
	<atom:link href="http://mryantho.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://mryantho.wordpress.com</link>
	<description>Classes, curriculum, education...</description>
	<lastBuildDate>Tue, 05 May 2009 22:36:24 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on JK &amp; T Flip-Flops by James Grover</title>
		<link>http://mryantho.wordpress.com/2008/02/13/jk-t-flip-flops/#comment-146</link>
		<dc:creator>James Grover</dc:creator>
		<pubDate>Tue, 05 May 2009 22:36:24 +0000</pubDate>
		<guid isPermaLink="false">http://mryantho.wordpress.com/?p=42#comment-146</guid>
		<description>Here is the general approach.  Draw truth table with desired inputs, actual flip-flop inputs, followed by actual flip-flop output.  Fill in the middle column(s) last.  As an example, convert D flip-flop to T flip-flop.  The combinational logic between the T and Q(t) produces D.  Note Q(t) is the present output and Q(t+1) is the next output.

T  Q(t)  D  Q(t+1)
 0   0    0       0         No Change
 0   1    1       1         No Change
 1   0    1       1         Toggle
 1   1    0       0         Toggle

To fill in D column decide what D needs to be to get the desired output Q(t+1). 

Therefore D = (NOT T AND Q(t)) OR (T AND NOT Q(t) or D = T 
XOR Q(t).

Or for the T to SR discussed above see the table below.  Note the R=S=1 is teated as a don&#039;t care since this condition should never occure.

 S  R  Q(t)  T  Q(t+1)
 0  0    0    0        0      No Change
 0  0    1    0        1      No Change
 0  1    0    0        0      Reset
 0  1    1    0        0      Reset
 1  0    0    1        1      Set
 1  0    1    0        1      Set
 1  1    x    x        x      Not Allowed

Which simplifies to T = Q(t) AND S by K-maps</description>
		<content:encoded><![CDATA[<p>Here is the general approach.  Draw truth table with desired inputs, actual flip-flop inputs, followed by actual flip-flop output.  Fill in the middle column(s) last.  As an example, convert D flip-flop to T flip-flop.  The combinational logic between the T and Q(t) produces D.  Note Q(t) is the present output and Q(t+1) is the next output.</p>
<p>T  Q(t)  D  Q(t+1)<br />
 0   0    0       0         No Change<br />
 0   1    1       1         No Change<br />
 1   0    1       1         Toggle<br />
 1   1    0       0         Toggle</p>
<p>To fill in D column decide what D needs to be to get the desired output Q(t+1). </p>
<p>Therefore D = (NOT T AND Q(t)) OR (T AND NOT Q(t) or D = T<br />
XOR Q(t).</p>
<p>Or for the T to SR discussed above see the table below.  Note the R=S=1 is teated as a don&#8217;t care since this condition should never occure.</p>
<p> S  R  Q(t)  T  Q(t+1)<br />
 0  0    0    0        0      No Change<br />
 0  0    1    0        1      No Change<br />
 0  1    0    0        0      Reset<br />
 0  1    1    0        0      Reset<br />
 1  0    0    1        1      Set<br />
 1  0    1    0        1      Set<br />
 1  1    x    x        x      Not Allowed</p>
<p>Which simplifies to T = Q(t) AND S by K-maps</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Understanding Layer Modes by chris</title>
		<link>http://mryantho.wordpress.com/2009/02/09/understanding-layer-modes/#comment-142</link>
		<dc:creator>chris</dc:creator>
		<pubDate>Mon, 09 Feb 2009 19:06:01 +0000</pubDate>
		<guid isPermaLink="false">http://mryantho.wordpress.com/?p=116#comment-142</guid>
		<description>magical</description>
		<content:encoded><![CDATA[<p>magical</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Representing Negative Numbers in Binary by mryantho</title>
		<link>http://mryantho.wordpress.com/2008/02/08/representing-negative-numbers-in-binary/#comment-134</link>
		<dc:creator>mryantho</dc:creator>
		<pubDate>Fri, 17 Oct 2008 03:02:04 +0000</pubDate>
		<guid isPermaLink="false">http://mryantho.wordpress.com/?p=29#comment-134</guid>
		<description>Basically we who &quot;program&quot; the computer (using let&#039;s say an assembly language) would agree that we are using say 8 bit negative numbers.  So every 8 bits is a number with the leftmost bit representing its sign (positive or negative.)  Of course this means that we have 0000000-1111111 (7 digits) as a range for positive and negative numbers.

Using 8 bit numbers isn&#039;t much good nowadays.  Now most computers use 64 bit registers (remember when 64 bit Windows XP came out?)</description>
		<content:encoded><![CDATA[<p>Basically we who &#8220;program&#8221; the computer (using let&#8217;s say an assembly language) would agree that we are using say 8 bit negative numbers.  So every 8 bits is a number with the leftmost bit representing its sign (positive or negative.)  Of course this means that we have 0000000-1111111 (7 digits) as a range for positive and negative numbers.</p>
<p>Using 8 bit numbers isn&#8217;t much good nowadays.  Now most computers use 64 bit registers (remember when 64 bit Windows XP came out?)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Representing Negative Numbers in Binary by conan</title>
		<link>http://mryantho.wordpress.com/2008/02/08/representing-negative-numbers-in-binary/#comment-133</link>
		<dc:creator>conan</dc:creator>
		<pubDate>Wed, 15 Oct 2008 01:29:45 +0000</pubDate>
		<guid isPermaLink="false">http://mryantho.wordpress.com/?p=29#comment-133</guid>
		<description>?If we say 1001 is negative 6 then how do we get the computer to agree that it isn&#039;t 8?  ?Or 1110 to represent negative 5 and not 14?

In short, ?how do we get the computer to register negative numbers?</description>
		<content:encoded><![CDATA[<p>?If we say 1001 is negative 6 then how do we get the computer to agree that it isn&#8217;t 8?  ?Or 1110 to represent negative 5 and not 14?</p>
<p>In short, ?how do we get the computer to register negative numbers?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on JK &amp; T Flip-Flops by khatatbeh</title>
		<link>http://mryantho.wordpress.com/2008/02/13/jk-t-flip-flops/#comment-128</link>
		<dc:creator>khatatbeh</dc:creator>
		<pubDate>Wed, 16 Jul 2008 16:15:06 +0000</pubDate>
		<guid isPermaLink="false">http://mryantho.wordpress.com/?p=42#comment-128</guid>
		<description>thnx a lot 
I have a Q that I hope to find the answer of it sooooooon
how I can to design a JK flip flop using SR flip flop
show (truth table , k map,and the final equation)
note:
I wanna the design without convert SR flip flop to D flip flop
I mean I wanna JK flip flop directly from SR flip flop</description>
		<content:encoded><![CDATA[<p>thnx a lot<br />
I have a Q that I hope to find the answer of it sooooooon<br />
how I can to design a JK flip flop using SR flip flop<br />
show (truth table , k map,and the final equation)<br />
note:<br />
I wanna the design without convert SR flip flop to D flip flop<br />
I mean I wanna JK flip flop directly from SR flip flop</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Programming &amp; Ruby Test Tomorrow by mryantho</title>
		<link>http://mryantho.wordpress.com/2008/05/06/programming-ruby-test-tomorrow/#comment-107</link>
		<dc:creator>mryantho</dc:creator>
		<pubDate>Tue, 06 May 2008 15:44:34 +0000</pubDate>
		<guid isPermaLink="false">http://mryantho.wordpress.com/?p=76#comment-107</guid>
		<description>I find the spelling mistake in the graph witty and that it adds something special.</description>
		<content:encoded><![CDATA[<p>I find the spelling mistake in the graph witty and that it adds something special.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Lightweight Introduction to Programming by mryantho</title>
		<link>http://mryantho.wordpress.com/2008/03/28/the-lightweight-introduction-to-programming/#comment-70</link>
		<dc:creator>mryantho</dc:creator>
		<pubDate>Wed, 02 Apr 2008 02:28:40 +0000</pubDate>
		<guid isPermaLink="false">http://mryantho.wordpress.com/?p=65#comment-70</guid>
		<description>The WoW Bard may be an April Fool&#039;s joke. ;-)</description>
		<content:encoded><![CDATA[<p>The WoW Bard may be an April Fool&#8217;s joke. <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Lightweight Introduction to Programming by Rikko</title>
		<link>http://mryantho.wordpress.com/2008/03/28/the-lightweight-introduction-to-programming/#comment-69</link>
		<dc:creator>Rikko</dc:creator>
		<pubDate>Wed, 02 Apr 2008 02:27:26 +0000</pubDate>
		<guid isPermaLink="false">http://mryantho.wordpress.com/?p=65#comment-69</guid>
		<description>See the new WoW Class? Bard? Its pwnage, its like guitar hero on World of Warcraft.

http://www.worldofwarcraft.com/wrath/features/bard/bardclass.xml 

Check how ridiculous this is sir....</description>
		<content:encoded><![CDATA[<p>See the new WoW Class? Bard? Its pwnage, its like guitar hero on World of Warcraft.</p>
<p><a href="http://www.worldofwarcraft.com/wrath/features/bard/bardclass.xml" rel="nofollow">http://www.worldofwarcraft.com/wrath/features/bard/bardclass.xml</a> </p>
<p>Check how ridiculous this is sir&#8230;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Lightweight Introduction to Programming by mryantho</title>
		<link>http://mryantho.wordpress.com/2008/03/28/the-lightweight-introduction-to-programming/#comment-68</link>
		<dc:creator>mryantho</dc:creator>
		<pubDate>Wed, 02 Apr 2008 02:24:18 +0000</pubDate>
		<guid isPermaLink="false">http://mryantho.wordpress.com/?p=65#comment-68</guid>
		<description>Yes Rikko, your teacher has skills.  Like bow hunting skills.</description>
		<content:encoded><![CDATA[<p>Yes Rikko, your teacher has skills.  Like bow hunting skills.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Lightweight Introduction to Programming by Rikko</title>
		<link>http://mryantho.wordpress.com/2008/03/28/the-lightweight-introduction-to-programming/#comment-67</link>
		<dc:creator>Rikko</dc:creator>
		<pubDate>Wed, 02 Apr 2008 02:19:08 +0000</pubDate>
		<guid isPermaLink="false">http://mryantho.wordpress.com/?p=65#comment-67</guid>
		<description>Yeah our teacher is the best!</description>
		<content:encoded><![CDATA[<p>Yeah our teacher is the best!</p>
]]></content:encoded>
	</item>
</channel>
</rss>
