Algebraic Switching Theory and Broadband Applications...

Features

• Cover Type: Hard Cover with 240 pages
• Published by: Academic Press
• Edition: 1st Edition September 5, 2000
• Written in: English
• ISBN 10 Number: 0124471811
• ISBN 13 Number: 978-0124471818
• Book Dimensions: 9.3 x 6.3 x 1.2 inches
• Weighs: 1.9 pounds

Book Description
This book presents the algebraic basics of switching theory with applications to the field of telecommunications. In addition, applications are described in such areas as multi-processor interconnections, hardware sorting, fast Fourier transform, and convolution decoding. By linking switching theory to industrial practice throughout the book, readers benefit from exposure to more than a pure mathematical treatment.

Algebraic Switching Theory and Broadband Applications is unique in its focus on developing an algebraic foundation for switching networks. This focus will be of great value to researchers and distinguishes it from others in the field.

Key Features
* More than 250 illustrations
* Most relevant mathematical tools are all provided
* Parallel attention to applications and implemental feasibility throughout
* Some applications to parallel computing, multi-processor interconnection, and hardware sorting besides telecommunications
* Topics follow a continuous flow, motivate one another, and pin down basic principles, useful techniques, and feasible designs
* The book contains a large amount of original results accrued during 1986-99 that have not been previously published

Book Info
(Harcourt Science and Technology) Develops an algebraic foundation for switching networks. establishing a direct link between distinct algebraic principles and broadband switching designs. May be helpful to engineers and computer scientists in parallel processing and software engineers in e-commerce.

Reader Reviews
Explosion of the Internet pushes the demand of bandwidth to a critical point. Various technologies on opical fibre system enhance the transmission bandwidth in the worldwide communication system. But, a high transmission bandwidth network reveals its bottleneck on the switching bandwidth - how to switch singal and data in tight time bound in various fashions. Existing router and switch vendors use network flow probability models to simulate the performance and blocking probability of a switching matrix design. This trial and error approach has no guarantee on the performance and implementation complexity. Prof. Li breaks a new ground by using algebra calculation in the switching fibric representation. By his 20+ years research, his algebra algorithm has an unique ability in handling non-blocking switching, Time-Space-Time 3-phase switching and concentrator/sorter implementation. And he suggests some interesting implementation oriented design in reducing implementation complexity in a manhatten VLSI layout. This book covers Prof. Li's lifetime work and his research in switching, probability models and information theory. It worths any information engineers for a deep look, and it's a fanastic reference book for any switching researchers... Comment | | (Report this)