Browsing by Author "Collier, Martin J."

Now showing 1 - 6 of 6

A new routing algorithm for symmetric rearrangeable networks and emerging applications
(© 2012 IEEE, 2012) Chakrabarty, Amitabha; Collier, Martin J.
An excavation tele-robotic system is developed to excavate and collect lunar regolith. The excavator has been developed by the team BRACU ChondroBot consisting students from BRAC University for NASA's 2nd Annual Lunabotics Mining Competition (LMC) 2011. Considering the requirement of NASA and calculating the load, friction and power the mechanical excavator was designed and built. The dimension of the excavator is 1.45m ×.74m × 1.48m and the weight is 80 kg. It consists of two excavation arm and one pulley system depositor bucket. Two conveyer belt type wheels are used to drive the robot. Efficient control and communication is always a big challenge for a Tele-robot. In our developed system hardware can be operated both manually and remotely through a web browser by logging in from any computer without direct visual and auditory access to the hardware. A unique control circuit, graphical user interface and communication module for two terminals are also developed for remote access.
A new routing algorithm for symmetric rearrangeable networks and emerging applications
(© 2012 IEEE, 2012) Chakrabarty, Amitabha; Collier, Martin J.
An excavation tele-robotic system is developed to excavate and collect lunar regolith. The excavator has been developed by the team BRACU ChondroBot consisting students from BRAC University for NASA's 2nd Annual Lunabotics Mining Competition (LMC) 2011. Considering the requirement of NASA and calculating the load, friction and power the mechanical excavator was designed and built. The dimension of the excavator is 1.45m ×.74m × 1.48m and the weight is 80 kg. It consists of two excavation arm and one pulley system depositor bucket. Two conveyer belt type wheels are used to drive the robot. Efficient control and communication is always a big challenge for a Tele-robot. In our developed system hardware can be operated both manually and remotely through a web browser by logging in from any computer without direct visual and auditory access to the hardware. A unique control circuit, graphical user interface and communication module for two terminals are also developed for remote access.
Low complexity routing algorithm for rearrangeable switching networks
(© 2013 IEEE, 2013-03) Chakrabarty, Amitabha; Collier, Martin J.
For a long time among the research community. Routing algorithms for this class of networks have attracted lots of researchers along with other related areas, such as modification of the networks structure, crosspoints reduction etc. In this paper a new routing algorithm is presented for symmetric rearrangeable networks built with 2 × 2 switching element. A new matrix based abstraction model is derived to determine conflict free routing paths for each input-output request. Each stage of a network is mapped into a set of sub-matrices and number of matrices in each stage correspond to number of subnetworks in that stage. Once the input permutation is given, matrix cells are populated with binary values depending on the position of the switching elements in the actual hardware and their mapped matrix cells. These binary values control the routing decision in the underlying hardware. This new routing algorithm is capable of connection setup for partial permutation, m = ρN, where N is the total input numbers and m is the number of active inputs. Overall the serial time complexity of this method is O(NlogN)1 and Ο(mlogN) where all N inputs are active and with m < N active inputs respectively. The time complexity of this routing algorithm in a parallel machine with N completely connected processors is Ο(log2N). With m active requests the time complexity goes down to Ο(logmlogN), which is better than the O(log2m + logN), reported in the literature for 21/2 [(log2N-4logN)1/2-logN] ≤ ρ ≤ 1. Later half of this paper demonstrates how this routing algorithm is applicable for crosstalk free routing in optical domain.
Low complexity routing algorithm for rearrangeable switching networks
(© 2013 IEEE, 2013-03) Chakrabarty, Amitabha; Collier, Martin J.
For a long time among the research community. Routing algorithms for this class of networks have attracted lots of researchers along with other related areas, such as modification of the networks structure, crosspoints reduction etc. In this paper a new routing algorithm is presented for symmetric rearrangeable networks built with 2 × 2 switching element. A new matrix based abstraction model is derived to determine conflict free routing paths for each input-output request. Each stage of a network is mapped into a set of sub-matrices and number of matrices in each stage correspond to number of subnetworks in that stage. Once the input permutation is given, matrix cells are populated with binary values depending on the position of the switching elements in the actual hardware and their mapped matrix cells. These binary values control the routing decision in the underlying hardware. This new routing algorithm is capable of connection setup for partial permutation, m = ρN, where N is the total input numbers and m is the number of active inputs. Overall the serial time complexity of this method is O(NlogN)1 and Ο(mlogN) where all N inputs are active and with m < N active inputs respectively. The time complexity of this routing algorithm in a parallel machine with N completely connected processors is Ο(log2N). With m active requests the time complexity goes down to Ο(logmlogN), which is better than the O(log2m + logN), reported in the literature for 21/2 [(log2N-4logN)1/2-logN] ≤ ρ ≤ 1. Later half of this paper demonstrates how this routing algorithm is applicable for crosstalk free routing in optical domain.
O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
(© 2014 Elsevier Inc., 2014) Chakrabarty, Amitabha; Collier, Martin J.
This paper addresses routing algorithm for a classic network called rearrangeable network with a complexity which is minimum than any other reported algorithms in this class. A new routing algorithm is presented for symmetric rearrangeable networks built with 2 × 2 switching elements. This new algorithm is capable of connection setup for partial permutation, over(m, -) = ρ N, where N is the total input numbers and over(m, -) is the number of active inputs. Overall the serial time complexity of this method is O (N log N)1 1 All log in this paper are base-2. and O (over(m, -) . log N) where all N inputs are active and with over(m, -) < N active inputs respectively. The time complexity of this algorithm in a parallel machine with N completely connected processors is O (log2 N). With over(m, -) active requests the time complexity goes down to O (log over(m, -) . log N), which is better than the O (log2 over(m, -) + log N), reported in the literature for 2frac(1, 2) [(log2 N - 4 log N)frac(1, 2) - log N] ≤ ρ ≤ 1. In later half of this paper, modified rearrangeable networks have been demonstrated built with bigger switching elements (> 2 × 2) with shorter network depth. Routing algorithm for these new networks have been proposed by modifying the proposed algorithm for smaller switching elements networks. Also we shall look into the application of these networks in optical domain for crosstalk free routing.
O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
(© 2014 Elsevier Inc., 2014) Chakrabarty, Amitabha; Collier, Martin J.
This paper addresses routing algorithm for a classic network called rearrangeable network with a complexity which is minimum than any other reported algorithms in this class. A new routing algorithm is presented for symmetric rearrangeable networks built with 2 × 2 switching elements. This new algorithm is capable of connection setup for partial permutation, over(m, -) = ρ N, where N is the total input numbers and over(m, -) is the number of active inputs. Overall the serial time complexity of this method is O (N log N)1 1 All log in this paper are base-2. and O (over(m, -) . log N) where all N inputs are active and with over(m, -) < N active inputs respectively. The time complexity of this algorithm in a parallel machine with N completely connected processors is O (log2 N). With over(m, -) active requests the time complexity goes down to O (log over(m, -) . log N), which is better than the O (log2 over(m, -) + log N), reported in the literature for 2frac(1, 2) [(log2 N - 4 log N)frac(1, 2) - log N] ≤ ρ ≤ 1. In later half of this paper, modified rearrangeable networks have been demonstrated built with bigger switching elements (> 2 × 2) with shorter network depth. Routing algorithm for these new networks have been proposed by modifying the proposed algorithm for smaller switching elements networks. Also we shall look into the application of these networks in optical domain for crosstalk free routing.