JSA
2000
13 years 11 months ago
2000
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...
JPDC
2000
13 years 11 months ago
2000
In this paper, we study optical multistage interconnection networks (MINs). Advances in electro-optic technologies have made optical communication a promising networking choice to...
ASAP
2006
IEEE
14 years 1 months ago
2006
IEEE
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...