This repository contains the implementation of two matrix multiplication algorithms for fixed-size square matrices (10,000 x 10,000). The first version is sequential, while the second version is ...

Abstract: Cache oblivious algorithms are designed to get the good benefit from any of the underlying hierarchy of caches without the need to know about the exact structure of the cache. These ...

The project demonstrates speedup, efficiency, and scalability of parallel computing techniques and applies theoretical models (Amdahl's Law and Gustafson's Law) to understand performance improvements.

Abstract: Orthogonal Time Frequency Space (OTFS) modulation exhibits excellent bit error rate (BER) performance in high-speed mobile scenarios. However, the two ...