<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3.1" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: Little, Big endianess explained</title>
	<link>http://www.openasthra.com/embedded-systems-programming/little-big-endianess-explained/</link>
	<description>C/C++ Programming Blog</description>
	<pubDate>Wed, 20 Aug 2008 03:44:43 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.1</generator>
		<item>
		<title>By: ponnada</title>
		<link>http://www.openasthra.com/embedded-systems-programming/little-big-endianess-explained/#comment-16</link>
		<dc:creator>ponnada</dc:creator>
		<pubDate>Thu, 28 Dec 2006 08:36:11 +0000</pubDate>
		<guid>http://www.openasthra.com/embedded-systems-programming/little-big-endianess-explained/#comment-16</guid>
		<description>
  &lt;p&gt;[snippet]&lt;br /&gt;Big endian and little endian&lt;br /&gt;&#34;Little Endian&#34; means that the low-order byte of the number is stored in memory at the lowest address, and the high-order byte at the highest address. (The little end comes first.) For example, a 4 byte LongInt&lt;/p&gt;
  &lt;p&gt;Byte3 Byte2 Byte1 Byte0&lt;br /&gt;[/snippet]&lt;/p&gt;
  &lt;p&gt;in the above theory I'd mentioned that lower order byte is stored at lowest address for little endian and gave pictorail representation of memory arrangement, so it should not cause any confusion, I guess.&lt;br /&gt;anyways&lt;/p&gt;
  &lt;p&gt;1024 represented as below in little endian machine&lt;/p&gt;
  &lt;p&gt;lowest address&lt;br /&gt;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160; &#160;&#124;&lt;br /&gt;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160; V&lt;br /&gt;00 00 04 00 &lt;/p&gt;
  &lt;p&gt;in big endian it will be represented this way&lt;br /&gt;highest address&lt;br /&gt;&#124;&lt;br /&gt;V&lt;br /&gt;00 04 00 00&lt;/p&gt;
  &lt;p&gt;thanks siddhuu :-) &lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>[snippet]<br />Big endian and little endian<br />&quot;Little Endian&quot; means that the low-order byte of the number is stored in memory at the lowest address, and the high-order byte at the highest address. (The little end comes first.) For example, a 4 byte LongInt</p>
<p>Byte3 Byte2 Byte1 Byte0<br />[/snippet]</p>
<p>in the above theory I&#8217;d mentioned that lower order byte is stored at lowest address for little endian and gave pictorail representation of memory arrangement, so it should not cause any confusion, I guess.<br />anyways</p>
<p>1024 represented as below in little endian machine</p>
<p>lowest address<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;|<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; V<br />00 00 04 00 </p>
<p>in big endian it will be represented this way<br />highest address<br />|<br />V<br />00 04 00 00</p>
<p>thanks siddhuu :-) </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sridhar</title>
		<link>http://www.openasthra.com/embedded-systems-programming/little-big-endianess-explained/#comment-15</link>
		<dc:creator>Sridhar</dc:creator>
		<pubDate>Thu, 28 Dec 2006 07:41:10 +0000</pubDate>
		<guid>http://www.openasthra.com/embedded-systems-programming/little-big-endianess-explained/#comment-15</guid>
		<description>Please correct this !!
Indicate which address is lower and which is Higher address.
By writing simply its giving impression that example shown is wrong for big and little indian cases.

Ex :

1024 (0×00000400) stored in little endian machine

as

00 00 04 00

in big endian machine stored as

00 04 00 00

-----Siddhuu Siddhartha Roy (Bengal Tiger)</description>
		<content:encoded><![CDATA[<p>Please correct this !!<br />
Indicate which address is lower and which is Higher address.<br />
By writing simply its giving impression that example shown is wrong for big and little indian cases.</p>
<p>Ex :</p>
<p>1024 (0×00000400) stored in little endian machine</p>
<p>as</p>
<p>00 00 04 00</p>
<p>in big endian machine stored as</p>
<p>00 04 00 00</p>
<p>&#8212;&#8211;Siddhuu Siddhartha Roy (Bengal Tiger)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: OpenAsthra &#187; Blog Archive &#187; Little, big endianess explained &#8212; part2</title>
		<link>http://www.openasthra.com/embedded-systems-programming/little-big-endianess-explained/#comment-14</link>
		<dc:creator>OpenAsthra &#187; Blog Archive &#187; Little, big endianess explained &#8212; part2</dc:creator>
		<pubDate>Wed, 27 Dec 2006 07:35:38 +0000</pubDate>
		<guid>http://www.openasthra.com/embedded-systems-programming/little-big-endianess-explained/#comment-14</guid>
		<description>[...] Byte order utililities: Previous post little, big endianness explained deals with theoretical part of endianness, now let us write some utility functions for endainness. [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] Byte order utililities: Previous post little, big endianness explained deals with theoretical part of endianness, now let us write some utility functions for endainness. [&#8230;]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
