<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Embedded on AI VOID</title><link>https://ai-blog.noorshomelab.dev/tags/embedded/</link><description>Recent content in Embedded on AI VOID</description><generator>Hugo</generator><language>en</language><lastBuildDate>Thu, 19 Mar 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://ai-blog.noorshomelab.dev/tags/embedded/index.xml" rel="self" type="application/rss+xml"/><item><title>Chapter 11: Bitwise Operations: Working at the Bit Level</title><link>https://ai-blog.noorshomelab.dev/c-programming-guide/bitwise-operations/</link><pubDate>Mon, 03 Nov 2025 01:00:00 +0000</pubDate><guid>https://ai-blog.noorshomelab.dev/c-programming-guide/bitwise-operations/</guid><description>&lt;h1 id="chapter-11-bitwise-operations-working-at-the-bit-level"&gt;Chapter 11: Bitwise Operations: Working at the Bit Level&lt;/h1&gt;
&lt;p&gt;Up until now, we&amp;rsquo;ve mostly treated data as whole numbers, characters, or floating-point values. However, at the lowest level, computers store and process all information as sequences of &lt;strong&gt;bits&lt;/strong&gt; (binary digits, 0s and 1s).&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Bitwise operations&lt;/strong&gt; allow you to manipulate these individual bits within integer types. This is a fundamental skill for:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;Low-level programming:&lt;/strong&gt; Interacting directly with hardware registers.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Embedded systems:&lt;/strong&gt; Controlling peripherals, setting flags.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Data compression and encryption:&lt;/strong&gt; Efficiently packing/unpacking data.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Optimized algorithms:&lt;/strong&gt; Sometimes, bitwise operations can be significantly faster than arithmetic operations.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Representing sets/flags:&lt;/strong&gt; Using individual bits to represent a collection of boolean states.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;In this chapter, we will explore C&amp;rsquo;s bitwise operators and learn how to use them effectively.&lt;/p&gt;</description></item><item><title>Stoolap vs. SQLite: Complete Technical Comparison 2026</title><link>https://ai-blog.noorshomelab.dev/comparisons/stoolap-vs-sqlite-comparison/</link><pubDate>Thu, 19 Mar 2026 00:00:00 +0000</pubDate><guid>https://ai-blog.noorshomelab.dev/comparisons/stoolap-vs-sqlite-comparison/</guid><description>&lt;h2 id="introduction"&gt;Introduction&lt;/h2&gt;
&lt;p&gt;In the rapidly evolving landscape of embedded databases, developers are constantly seeking solutions that offer the right balance of performance, flexibility, and ease of use. This deep technical comparison, current as of March 19, 2026, pits two prominent contenders against each other: the established and ubiquitous &lt;strong&gt;SQLite&lt;/strong&gt; and the newer, high-performance challenger, &lt;strong&gt;Stoolap&lt;/strong&gt;.&lt;/p&gt;
&lt;p&gt;SQLite has long been the de-facto standard for embedded, serverless databases, prized for its simplicity, reliability, and compact footprint. However, with modern application demands pushing the boundaries of what embedded databases can achieve, new solutions like Stoolap, built with Rust, are emerging to address high-performance transactional and analytical workloads directly within applications.&lt;/p&gt;</description></item></channel></rss>