Lower Bounds on Vlsi Implementations of Communication Networks: May 1981 (Classic Reprint) - Tapa blanda

Lower Bounds on Vlsi Implementations of Communication Networks: May 1981

Paperback. Condición: New. Print on Demand. This book dives into the complexities of VLSI (Very Large Scale Integration), revealing the intricate relationship between communication networks and their physical implementation in integrated circuits. The author meticulously analyzes communication networks, examining fundamental concepts such as permutation networks, superconcentrators, and packet switching. Through rigorous mathematical proofs and theoretical insights, the book unveils lower bounds on the area required for VLSI implementations of these networks, highlighting trade-offs between bandwidth and area in packet switching networks. These findings significantly advance our understanding of the intricate relationship between communication networks and their hardware realization, a crucial aspect in designing efficient and compact VLSI systems. Delving into the depths of circuit switching networks, the author provides a comprehensive examination of their topologies and the constraints they impose. By exploring different network architectures, such as g-networks, flip networks, and baseline networks, the book offers a comparative analysis of their complexities, revealing insights into their suitability for various applications. The book's significance lies in its rigorous exploration of the lower bounds on VLSI implementations of communication networks, providing a solid theoretical foundation for future advancements in the design and analysis of high-performance computing systems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Nº de ref. del artículo: 9781332091379_0

Contactar al vendedor