Abstract
A new rearrangeable broadcast switching network has been invented. In its simplest form, the network has two stages. For larger networks, the switches in each stage can be replaced with two-stage networks to reduce crosspoint cost. The invention is based on an innovative approach of connecting each inlet channel to a multiplicity of first-stage switches according to a predetermined connection pattern. The network grows easily and has simple path hunt and rearrangement algorithms. It provides a general solution for any nonblocking broadcast switching application. Fewer crosspoints are required than in any other known two- or three-stage rearrangeable broadcast network. The connection arrangement exemplifies a topic heretofore unaddressed in combinatorial theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
