- Start
- Lower Bounds on Vlsi Implementations of Communication Networks
Lower Bounds on Vlsi Implementations of Communication Networks
Angebote / Angebote:
Excerpt from Lower Bounds on Vlsi Implementations of Communication Networks: May 1981
An 0(n-2) lower bound on the area required for Vlsi implementations of permutation networks and concentrators is given. A tradeoff result for the bandwidth of packet switching networks and the area required to implement them is proven.
Keywords: Communication networks, Vlsi complexity.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully, any imperfections that remain are intentionally left to preserve the state of such historical works.
Folgt in ca. 5 Arbeitstagen