<?xml version="1.0" encoding="UTF-8"?><oembed><type>video</type><version>1.0</version><html>&lt;iframe src=&quot;https://www.loom.com/embed/ae307eb0709d4e43a79d95194c3868f8&quot; frameborder=&quot;0&quot; width=&quot;1440&quot; height=&quot;1080&quot; webkitallowfullscreen mozallowfullscreen allowfullscreen&gt;&lt;/iframe&gt;</html><height>1080</height><width>1440</width><provider_name>Loom</provider_name><provider_url>https://www.loom.com</provider_url><thumbnail_height>1080</thumbnail_height><thumbnail_width>1440</thumbnail_width><thumbnail_url>https://cdn.loom.com/sessions/thumbnails/ae307eb0709d4e43a79d95194c3868f8-00001.gif</thumbnail_url><duration>155.033</duration><title>Fee-lang Hackathon Project: Implementing Fixed Point Representation</title><description>In this video, I discuss my fee-lang hackathon project, which focuses on implementing a fixed point representation. The project aims to eliminate the need for floating numbers by using a fixed point representation with 16 bits for the integer part, 16 bits for the fractional part, and 1 bit for the sign of the data. I showcase the implementation and highlight the various methods available, such as addition, subtraction, multiplication, division, exponential, logarithms, natural logarithm, power, and square root. Additionally, I demonstrate how to use the library and provide insights into future developments, including the implementation of mathematical functions and machine learning algorithms.</description></oembed>