Sciweavers

JSA
2000
103views more  JSA 2000»
14 years 9 months ago
O(n) routing in rearrangeable networks
In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n2 ) compared to its propagation delay O(n) only. Here, we attempt to identify the sets...
Nabanita Das, Krishnendu Mukhopadhyaya, Jayasree D...
JPDC
2000
95views more  JPDC 2000»
14 years 9 months ago
Permutation Capability of Optical Multistage Interconnection Networks
In this paper, we study optical multistage interconnection networks (MINs). Advances in electro-optic technologies have made optical communication a promising networking choice to...
Yuanyuan Yang, Jianchao Wang, Yi Pan
92
Voted
ASAP
2006
IEEE
147views Hardware» more  ASAP 2006»
15 years 1 days ago
Reconfigurable Shuffle Network Design in LDPC Decoders
Several semi-parallel decoding architectures have been explored by researchers for the quasi-cyclic low density parity check (LDPC) codes. In these architectures, the reconfigurab...
Jun Tang, Tejas Bhatt, Vishwas Sundaramurthy