Graph-Based Byte Construction from Reusable Bits: Toward Resilient and Memory-Efficient Systems
Bildiriler > Tam Metin Bildiri
Yazarlar: Mehmet Savran, Züleyha AKUSTA DAĞDEVİREN, Hasan BULUT
2025 9th International Artificial Intelligence and Data Processing Symposium (IDAP), , , Uluslararası, Tam Metin Bildiri, ss 1-7
DOI: 10.1109/idap68205.2025.11222260
Özet
In this paper, we present a novel graph-based framework for constructing bytes from reusable bits that addresses emerging challenges in hardware efficiency, data resilience, and symbolic modeling. In contrast to conventional byte construction, where bits are treated as non-reusable units, our model represents each bit as a graph node and assembles target bytes via traversal algorithms that prioritize reuse. This method enables more efficient hardware utilization, reduces redundancy, and supports fault-tolerant reconstruction under volatile conditions through a simulated bit mutation mechanism. The framework also provides transparent, visual representations of bit states and lineage, making it suitable for educational and debugging purposes. Our experimental results, implemented using Python and NetworkX, show an improvement in bit utilization efficiency and scalability for even higher reuse. The proposed system has implications for low-level data compression, resilient memory systems, and next-generation computing architectures that require compactness, traceability, and adaptability.