{"type":"video","version":"1.0","html":"<iframe src=\"https://www.loom.com/embed/ae307eb0709d4e43a79d95194c3868f8\" frameborder=\"0\" width=\"1440\" height=\"1080\" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>","height":1080,"width":1440,"provider_name":"Loom","provider_url":"https://www.loom.com","thumbnail_height":1080,"thumbnail_width":1440,"thumbnail_url":"https://cdn.loom.com/sessions/thumbnails/ae307eb0709d4e43a79d95194c3868f8-00001.gif","duration":155.033,"title":"Fee-lang Hackathon Project: Implementing Fixed Point Representation","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."}