The rearrangement process in a two-stage broadcast switching network

Jacobsen, S.B.

doi:10.1109/26.2774

Search citation statements

Order By: Relevance

Paper Sections

Select...

If We Change G2 To the Same1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1991

1993

Publication Types

Select...

Article2

Book1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…and j ' (i, j ) = 4 x imod5 + j m d 4 for 0 I i, j I 19. ( 5 ) We claim that this assignment operation permutes the set of all (i, j ) . To show this, we first observe that 0 5 i' (i,j),j'(i,j) 5 19 .…”

Section: If We Change G2 To the Samementioning

confidence: 99%

A two‐stage network with dual partial concentrators

Hwang

Richards

1993

Networks

View full text Add to dashboard Cite

A two-stage rearrangeable broadcast network (called an ordinary network here) that has been studied recently has a partial concentrator on the input side. We extend this study to a network with two partial concentrators: one on the input side and the other on the output side. We first study the network as a connection network and derive conditions for its rearrangeability. We show that the conditions are tight in some cases. We then show that a particular construction that meets the rearrangeability conditions actually yields a broadcast network. o 1993 John Wi/ey 8 Sons, ~n c .

show abstract

Section: If We Change G2 To the Samementioning

confidence: 99%