Channel routing is a key problem in VLSI physical design. The main goal of the channel routing problem is to reduce the area of an IC chip. If we concentrate on reducing track number in channel routing problem then automatically the area of an IC chip will be reduced. Here, we propose a new algorithm to reduce the number of tracks using four layers (two horizontal layers and two vertical layers). To be more specific, through this algorithm we convert a two-layer channel routing problem into a four-layer channel routing problem using VCG of the channel. Next, we show the experimental results and graphical structure of that solution.
Performance comparison of XY,OE and DyAd routing algorithm by Load Variation...Jayesh Kumar Dalal
This summarizes a document that compares the performance of three routing algorithms - XY, Odd-Even (OE), and DyAD - under varying load conditions on a 2D 3x3 mesh network-on-chip topology. The document presents simulation results showing that DyAD routing achieves the minimum overall average latency per channel in clock cycles per flit and packets, as well as the minimum total network power, making it the best performing algorithm compared to XY and OE routing.
Crdom cell re ordering based domino on-the-fly mappingVLSICS Design
This Domino logic is often the choice for designing high speed CMOS circuits. Often VLSI designers
choose library based approaches to perform technology mapping of large scale circuits involving static
CMOS logic style. Cells designed using Domino logic style have the flexibility to accommodate wide range
of functions in them. Hence, there is a scope to adopt a library free synthesis approach for circuits
designed using Domino logic. In this work, we present an approach for mapping a domino logic circuit
using an On-the-fly technique. First, we present a node mapping algorithm which maps a given Domino
logic netlist using On-the-fly technique. Next, using an Equivalence Table, we re-order the cells along the
critical path for delay, area benefit. Finally, we find an optimum re-ordering set which can obtain
maximum delay savings for a minimum area penalty. We have tested the efficacy of our approach with a
set of standard benchmark circuits. Our proposed mapping approach (CRDOM) obtained 21%
improvement in area and 17% improvement in delay compared to existing work.
An Adaptive Algorithm for MU-MIMO using Spatial Channel ModelCSCJournals
In this paper, Multi User Multiple Input Multiple Output (MU-MIMO) spatial channel model has been implemented for different outdoor environments – Urban Micro, and Urban Macro using MATLAB for finding various parameters like angle of arrival of the user, user direction and the distance between user and access point (AP).
A New Approach to Linear Estimation Problem in Multiuser Massive MIMO SystemsRadita Apriana
A novel approach for solving linear estimation problem in multi-user massive MIMO systems is
proposed. In this approach, the difficulty of matrix inversion is attributed to the incomplete definition of the
dot product. The general definition of dot product implies that the columns of channel matrix are always
orthogonal whereas, in practice, they may be not. If the latter information can be incorporated into dot
product, then the unknowns can be directly computed from projections without inverting the channel
matrix. By doing so, the proposed method is able to achieve an exact solution with a 25% reduction in
computational complexity as compared to the QR method. Proposed method is stable, offers an extra
flexibility of computing any single unknown, and can be implemented in just twelve lines of code.
This document summarizes the results of applying the Successive Survivable Routing (SSR) algorithm to different network models to calculate backup capacity requirements. The SSR algorithm provides an approximate solution to the Spare Capacity Assignment problem of finding the minimum backup capacity needed to deploy equivalent failure-disjoint recovery paths. The document finds that enhanced versions of SSR that incorporate capacity giveback and state-dependent restoration can reduce backup capacity requirements by an average of 12% compared to the standard SSR algorithm. These SSR techniques were applied to reference networks, realistic networks from internet topology data, and synthetic networks generated by the BRITE topology generator.
A NOVEL FULL ADDER CELL BASED ON CARBON NANOTUBE FIELD EFFECT TRANSISTORSVLSICS Design
Presenting a novel full adder cell will be increases all the arithmetic logic unit performance. In this paper, We present two new full adder cell designs using carbon nanotube field effect transistors (CNTFETs). In the first design we have 42 transistors and 5 pull-up resistance so that we have achieved an improvement in the output parameters. Simulations were carried out using HSPICE based on the CNTFET model with 0.9V VDD. The denouments results in that we have a considerable improvement in power, Delay and power delay product than the previous works.
A collection of mobile nodes is known as ad-hoc network in which wireless communication network is used to connect these mobile nodes. A major requirement on the MANET is to provide unidentifiability and unlinkability for mobile nodes During the last few decades, continuous progresses in wireless communications have opened new research fields in computer networking, goal of extending data networks connectivity to environments where wired solutions are impracticable. Among these, vehicular traffic is attracting a increasing attention from both academic and industry, due to the amount and importance of the related applications, ranging from road safety to traffic control, up to mobile entertainment. Vehicular Ad-hoc Network(VANETs) are self-organized networks built up from moving vehicles, and are part of the broader class of Mobile Ad-hoc Net- works(MANETs). Because of their peculiar characteristics, VANETs require the definition of specific networking techniques, whose feasibility and performance are usually tested by means of simulation. One of the main challenges posed by VANETs simulations is the faithful characterization of vehicular mobility at both macroscopic and microscopic levels, leads to realistic non-uniform distributions of cars and velocity, and unique connectivity dynamics. There are various secure routing protocols have been proposed, but the requirement is not satisfied. The existing protocols are unguarded to the attacks of fake routing packets. Simulation results have demonstrated the effectiveness of the proposed AODV protocol with improved performance as compared to the existing protocols.
ABSTRACT : Performance enhancement of smart antennas versus their complexity for commercial wireless
applications. The goal of the study presented in this paper is to investigate the performance improvement
attainable using relatively simple smart antenna techniques when applied to the third-generation W-CDMA air
interface. Methods to achieve this goal include fixed multi beam architectures with different beam selection
algorithms (maximum power criterion, combined beams) or adaptive solutions driven by relatively simple direction
finding algorithms. After comparing these methods against each other for several representative scenarios, some
issues related to the sensitivity of these methods are also studied, (e.g., robustness to environment, mismatches
originating from implementation limitations, etc.). Results indicate that overall, conventional beam forming
seems to be the best choice in terms of balancing the performance and complexity requirements, in particular
when the problem with interfering high-bit-rate W-CDMA 3g users is considered.
Performance comparison of XY,OE and DyAd routing algorithm by Load Variation...Jayesh Kumar Dalal
This summarizes a document that compares the performance of three routing algorithms - XY, Odd-Even (OE), and DyAD - under varying load conditions on a 2D 3x3 mesh network-on-chip topology. The document presents simulation results showing that DyAD routing achieves the minimum overall average latency per channel in clock cycles per flit and packets, as well as the minimum total network power, making it the best performing algorithm compared to XY and OE routing.
Crdom cell re ordering based domino on-the-fly mappingVLSICS Design
This Domino logic is often the choice for designing high speed CMOS circuits. Often VLSI designers
choose library based approaches to perform technology mapping of large scale circuits involving static
CMOS logic style. Cells designed using Domino logic style have the flexibility to accommodate wide range
of functions in them. Hence, there is a scope to adopt a library free synthesis approach for circuits
designed using Domino logic. In this work, we present an approach for mapping a domino logic circuit
using an On-the-fly technique. First, we present a node mapping algorithm which maps a given Domino
logic netlist using On-the-fly technique. Next, using an Equivalence Table, we re-order the cells along the
critical path for delay, area benefit. Finally, we find an optimum re-ordering set which can obtain
maximum delay savings for a minimum area penalty. We have tested the efficacy of our approach with a
set of standard benchmark circuits. Our proposed mapping approach (CRDOM) obtained 21%
improvement in area and 17% improvement in delay compared to existing work.
An Adaptive Algorithm for MU-MIMO using Spatial Channel ModelCSCJournals
In this paper, Multi User Multiple Input Multiple Output (MU-MIMO) spatial channel model has been implemented for different outdoor environments – Urban Micro, and Urban Macro using MATLAB for finding various parameters like angle of arrival of the user, user direction and the distance between user and access point (AP).
A New Approach to Linear Estimation Problem in Multiuser Massive MIMO SystemsRadita Apriana
A novel approach for solving linear estimation problem in multi-user massive MIMO systems is
proposed. In this approach, the difficulty of matrix inversion is attributed to the incomplete definition of the
dot product. The general definition of dot product implies that the columns of channel matrix are always
orthogonal whereas, in practice, they may be not. If the latter information can be incorporated into dot
product, then the unknowns can be directly computed from projections without inverting the channel
matrix. By doing so, the proposed method is able to achieve an exact solution with a 25% reduction in
computational complexity as compared to the QR method. Proposed method is stable, offers an extra
flexibility of computing any single unknown, and can be implemented in just twelve lines of code.
This document summarizes the results of applying the Successive Survivable Routing (SSR) algorithm to different network models to calculate backup capacity requirements. The SSR algorithm provides an approximate solution to the Spare Capacity Assignment problem of finding the minimum backup capacity needed to deploy equivalent failure-disjoint recovery paths. The document finds that enhanced versions of SSR that incorporate capacity giveback and state-dependent restoration can reduce backup capacity requirements by an average of 12% compared to the standard SSR algorithm. These SSR techniques were applied to reference networks, realistic networks from internet topology data, and synthetic networks generated by the BRITE topology generator.
A NOVEL FULL ADDER CELL BASED ON CARBON NANOTUBE FIELD EFFECT TRANSISTORSVLSICS Design
Presenting a novel full adder cell will be increases all the arithmetic logic unit performance. In this paper, We present two new full adder cell designs using carbon nanotube field effect transistors (CNTFETs). In the first design we have 42 transistors and 5 pull-up resistance so that we have achieved an improvement in the output parameters. Simulations were carried out using HSPICE based on the CNTFET model with 0.9V VDD. The denouments results in that we have a considerable improvement in power, Delay and power delay product than the previous works.
A collection of mobile nodes is known as ad-hoc network in which wireless communication network is used to connect these mobile nodes. A major requirement on the MANET is to provide unidentifiability and unlinkability for mobile nodes During the last few decades, continuous progresses in wireless communications have opened new research fields in computer networking, goal of extending data networks connectivity to environments where wired solutions are impracticable. Among these, vehicular traffic is attracting a increasing attention from both academic and industry, due to the amount and importance of the related applications, ranging from road safety to traffic control, up to mobile entertainment. Vehicular Ad-hoc Network(VANETs) are self-organized networks built up from moving vehicles, and are part of the broader class of Mobile Ad-hoc Net- works(MANETs). Because of their peculiar characteristics, VANETs require the definition of specific networking techniques, whose feasibility and performance are usually tested by means of simulation. One of the main challenges posed by VANETs simulations is the faithful characterization of vehicular mobility at both macroscopic and microscopic levels, leads to realistic non-uniform distributions of cars and velocity, and unique connectivity dynamics. There are various secure routing protocols have been proposed, but the requirement is not satisfied. The existing protocols are unguarded to the attacks of fake routing packets. Simulation results have demonstrated the effectiveness of the proposed AODV protocol with improved performance as compared to the existing protocols.
ABSTRACT : Performance enhancement of smart antennas versus their complexity for commercial wireless
applications. The goal of the study presented in this paper is to investigate the performance improvement
attainable using relatively simple smart antenna techniques when applied to the third-generation W-CDMA air
interface. Methods to achieve this goal include fixed multi beam architectures with different beam selection
algorithms (maximum power criterion, combined beams) or adaptive solutions driven by relatively simple direction
finding algorithms. After comparing these methods against each other for several representative scenarios, some
issues related to the sensitivity of these methods are also studied, (e.g., robustness to environment, mismatches
originating from implementation limitations, etc.). Results indicate that overall, conventional beam forming
seems to be the best choice in terms of balancing the performance and complexity requirements, in particular
when the problem with interfering high-bit-rate W-CDMA 3g users is considered.
ON THE PROBABILITY OF K-CONNECTIVITY IN WIRELESS AD HOC NETWORKS UNDER DIFFER...graphhoc
The document analyzes the probability of k-connectivity in wireless ad hoc networks under different mobility models. It compares the Random Waypoint, City Section, and Manhattan mobility models. Simulations show that the Random Waypoint model yields the highest probability of k-connectivity for most node densities and velocities. The probability of k-connectivity decreases as k increases and increases as node density increases, for all three models.
A Weighted Duality based Formulation of MIMO SystemsIJERA Editor
This work is based on the modeling and analysis of multiple-input multiple-output (MIMO) system in downlink communication system. We take into account a recent work on the ratio of quadratic forms to formulate the weight matrices of quadratic norm in a duality structure. This enables us to achieve exact solutions for MIMO system operating under Rayleigh fading channels. We outline couple of scenarios dependent on the structure of eigenvalues to investigate the system behavior. The results obtained are validated by means of Monte Carlo simulations.
This paper discusses constructing optimal frequency hopping sequences for use in TDMA-FDMA cellular systems operating in fading channels. It reviews conditions for frequency and time channels to fade independently based on coherence time and bandwidth. The paper presents an algebraic construction of frequency hopping sequences based on linear congruences that guarantees sufficient channel separation to achieve maximum frequency diversity. Examples applicable to the GSM system are provided.
Hex-Cell is an interconnection network that has attractive features like the embedding capability of topological structures; such as; bus, ring, tree and mesh topologies. In this paper, we present two algorithms for embedding bus and ring topologies onto Hex-Cell interconnection network. We use three metrics to evaluate our proposed algorithms: dilation, congestion, and expansion. Our evaluation results
show that the congestion of our two proposed algorithms is equal to one; and the dilation is equal to 2d-1 for the first algorithm and 1 for the second.
Optimization of IP Networks in Various Hybrid IGP/MPLS Routing SchemesEM Legacy
This document discusses optimization of IP networks using hybrid IGP/MPLS routing schemes. It proposes a heuristic approach using genetic algorithms to optimize network performance metrics like utilization and hop count while minimizing the number of label switched paths (LSPs). The document presents models for different hybrid routing approaches, a problem formulation, and results from applying the genetic algorithm approach to a case study network.
Mobile ad hoc networks – dangling issues of optimal path strategyAlexander Decker
The document discusses issues related to selecting optimal paths in mobile ad hoc networks. It proposes using a random direction mobility model to detect neighborhoods and trace paths between source and destination nodes. The model represents nodes moving in random directions for periods of time before pausing. The paper also discusses calculating the probability of link availability over time between two moving nodes based on their movements and developing a link maintenance probability model. An implementation of detecting neighborhoods using this low probability mobility model in Java is also described.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...cscpconf
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active research area, basically for supporting real time applications that are based upon interaction between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve more deterministic behavior of the network i.e. a stable path, so that information carried by the network can be delivered in an uninterrupted fashion and for better resource utilization. In this paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing algorithm for MANETs with better route failure management and which will be highly adaptive and energy efficient.
Amtr the ant based qos aware multipath temporally ordered routing algorithm ...csandit
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which
are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active
research area, basically for supporting real time applications that are based upon interaction
between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve
more deterministic behavior of the network i.e. a stable path, so that information carried by the
network can be delivered in an uninterrupted fashion and for better resource utilization. In this
paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing
algorithm for MANETs with better route failure management and which will be highly adaptive
and energy efficient.
This document discusses two schemes for implementing multirate transmission in fiber-optic code-division multiple access (CDMA) networks: the parallel scheme and the serial mapping scheme. The parallel scheme assigns each user multiple addresses based on their data rate and encodes bits in parallel. The serial mapping scheme encodes bits serially using optical orthogonal codes (OOCs) constructed from frequency hop codes. Analysis shows the parallel scheme can support error correction coding to increase network capacity, while the serial mapping performs well even without coding. Both schemes allow accommodating high numbers of multirate users without increasing optical processing complexity.
Section based hex cell routing algorithm (sbhcr)IJCNCJournal
A Hex-Cell network topology can be constructed using units of hexagon cells. It has been introduced in the literature as interconnection network suitable for large parallel computers, which can connect large number of nodes with three links per node. Although this topology exhibits attractive characteristics such as embeddability, symmetry, regularity, strong resilience, and simple routing, the previously suggested routing algorithms suffer from the high number of logical operations and the need for readdressing of nodes every time a new level is add to the network. This negatively impacts the performance of the network as it increases the execution time of these algorithms. In this paper we propose an improved optimal point to point routing algorithm for Hex-Cell network. The algorithm is based on dividing the Hex-Cell topology into six divisions, hence the name Section Based Hex-Cell Routing (SBHCR). The SBHCR algorithm is simple and preserves the advantage of the addressing scheme proposed for the Hex-Cell network. It does not depend on the depth of the network topology which leads to overcome the issue of readdressing of nodes every time a new level is added. Evaluation against two previously suggested routing algorithms has shown the superiority of SBHCR in term of less logical operations.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
A Method to Determine End-Points ofStraight Lines Detected Using the Hough Tr...IJERA Editor
This document presents a method for determining the end points of lines detected using the Hough transform. The Hough transform detects lines of unspecified length by finding equations that describe lines, but does not provide information about the actual end points. The presented method tracks points from the original image that contributed to lines detected in the Hough transform space. Consecutive points are grouped into sub-lines if there are enough points to constitute a significant segment and points are far enough from other groups along the same line. Sample results demonstrating the method are shown. The method involves grouping contributing points into valid sub-lines based on minimum length and separation criteria.
Design And Evaluation of Time Slot Assignment Algorithm For IEEE 802.16j Rela...CSCJournals
In IEEE 802.16j relay networks, wireless communications are carried out based on TDMA where the wireless network resources are divided into multiple time slots and they are assigned to wireless links between relay nodes as transmission opportunities. The network performance is improved by decreasing the total number of different time slots assigned to all links in a single scheduling cycle, because it brings the increase in the transmission opportunities of the links per unit time. Although it can be achieved when multiple links utilize the same time slot, the capacity of such links is degraded due to the radio interference. On the other hand, since all links in the network need to have enough time slots to accommodate their traffic load, degrading the link capacity may increase the total number of different time slots in the scheduling cycle. Therefore, we should determine the time slot assignment by considering the above-mentioned tradeoff relationship. In this paper, we propose heuristic algorithms for time slot assignment problem in IEEE 802.16j relay networks, and evaluate them through extensive simulation experiments. Two algorithms based on different heuristic are introduced. One algorithm assigns a set of time slots to links by a greedy approach. The other algorithm determines a set of links that use a time slot by a brute-force search for maximizing the total link capacity. Performance evaluation results exhibit that the proposed algorithms reduces around 34% and 39% of the total time slots compared with the case where no link utilizes the same time slot, respectively. Meanwhile, they also show that calculation time of the latter algorithm is longer than that of the former algorithm to reduce the total time slots. Thus, we show that there is a tradeoff between performance and calculation time.
This document proposes a semiblind channel estimation approach for MIMO-OFDM systems that combines training-based and blind techniques. It derives a linear prediction-based blind constraint and incorporates it into a training-based least squares cost function using a weighting factor. A perturbation analysis justifies the superiority of the semiblind solution and derives a closed-form expression for the mean square error of the blind constraint, facilitating the calculation of the optimal weighting factor. Computer simulations show the proposed semiblind approach achieves very high channel estimation accuracy compared to purely training-based or blind methods.
This document analyzes and models the Enhanced Data rates for GSM Evolution (EDGE) mobile communication system. It develops a MATLAB simulation of the EDGE system to model channel coding, modulation, interleaving, burst building, multipath fading channels, channel estimation and detection. The simulation tests the system over additive white Gaussian noise and Rayleigh fading channels. Results show received signal quality decreases with lower signal-to-noise ratio, and fading channels require higher SNR to achieve the same performance as non-fading channels.
This document proposes two genetic algorithm based methodologies called Minimum Spanning Tree First (MSTF) and Shortest Paths First (SPF) for designing customized and energy optimized irregular Network-on-Chip (NoC) topologies tailored to an application's communication characteristics. The MSTF methodology first constructs a minimum spanning tree and then extends the topology by adding shortest energy paths, while SPF first finds the shortest energy paths and then constructs the minimum spanning tree. Experimental results on random benchmarks show the SPF methodology reduces average dynamic communication energy by 18.5% on average compared to MSTF. SPF also achieves lower latency and similar throughput. Comparisons with regular 2D mesh NoCs and an intelligent mapping
Determining location information of sensor node is an essential issue to capture the sensed data and to
update the necessary information in many wireless sensor network applications, such as healthcare services,
military applications, warning systems, environmental monitoring etc. Mobile Anchor Node is used to achieve
Localization in a wireless sensor networks. Hence the main challenge is to design and develop a Path Planning
Algorithm for a Mobile Anchor Node to broadcast three consecutive non-collinear messages for location
estimation which in turn increases localization accuracy and coverage and also reduces time required to
determine location information. In this paper, I propose a Path Planning Algorithm called Z-curve to perform
trilateration calculation to estimate sensor nodes location. Proposed trajectory can successfully localize all
deployed sensor nodes in a network region of interest with more accuracy and consumes less time for
localization. Furthermore, to handle obstacles, Z-curve obstacle-handling trajectory is proposed.
Keywords— Wireless sensor networks, mobile anchor node, path planning, non-collinear, localization
IMPACT OF FADING CORRELATION, POLARIZATION COUPLING AND KEYHOLES ON MIMO DETE...ijmnct
This document summarizes a research paper that analyzes the impact of fading correlation, cross polarization coupling, and the keyhole effect on the error performance of V-BLAST MIMO systems using detectors like ZF, MMSE, and ML. It is observed that performance is better when channel fading correlation and cross polarization coupling values are lower. The keyhole effect can cause the channel matrix to be rank deficient, limiting the benefits of multiple antennas. Simulation results show the BER performance of these detectors for different modulation schemes under varying channel conditions.
Compressed fuzzy logic based multi-criteria AODV routing in VANET environmentIJECEIAES
Vehicular ad hoc networks (VANETs) are the core of intelligent transportation systems (ITS) to obtain safety, better transportation services, and improved traffic management. Providing more reliable and efficient on demand routing protocol is one of the main challenges in these networks research scope. This paper argues a compressed fuzzy logic based method to enhance Ad hoc on demand distance vector (AODV) routing decision by jointly considering number of relays, distance factor, direction angle, and vehicles speed variance. The proposed scheme is simulated in both freeway and urban scenarios with different number of vehicles using real time interaction between both OMNet++ and SUMO simulators. Simulation results show that the proposed approach can get better performance in terms of packet delivery ratio, throughput, mean delay, and number of sent control packets.
A Review on Channel Routing On VLSI Physical DesignIOSR Journals
This document provides a review and analysis of several algorithms for channel routing in VLSI physical design. It begins with an introduction to channel routing and multi-layer routing models. It then analyzes and summarizes two important two-layer channel routing algorithms: the Efficient Routing Algorithm and the MCC1 and MCC2 algorithms. Next, it discusses a three-layer channel routing algorithm. Finally, it analyzes the MulCh multi-layer channel routing algorithm and its differences from the Chameleon algorithm. Key concepts discussed include horizontal and vertical constraint graphs, net merging techniques, and assigning nets to different routing layers or groups.
The document proposes a hybrid architecture for channel allocation and routing in wireless mesh networks to improve quality of service. It uses a combination of static and dynamic channel allocation. Dynamic channel allocation (DCA) is optimized using an Adaptive DCA protocol (ADCA) that considers both throughput and delay. Static channels provide high throughput paths while dynamic channels improve connectivity and adaptability. Simulation results show the hybrid approach achieves lower delay and higher throughput than static-only or dynamic-only approaches. It also compares clustering which can further increase throughput and reduce delay compared to the hybrid method.
ON THE PROBABILITY OF K-CONNECTIVITY IN WIRELESS AD HOC NETWORKS UNDER DIFFER...graphhoc
The document analyzes the probability of k-connectivity in wireless ad hoc networks under different mobility models. It compares the Random Waypoint, City Section, and Manhattan mobility models. Simulations show that the Random Waypoint model yields the highest probability of k-connectivity for most node densities and velocities. The probability of k-connectivity decreases as k increases and increases as node density increases, for all three models.
A Weighted Duality based Formulation of MIMO SystemsIJERA Editor
This work is based on the modeling and analysis of multiple-input multiple-output (MIMO) system in downlink communication system. We take into account a recent work on the ratio of quadratic forms to formulate the weight matrices of quadratic norm in a duality structure. This enables us to achieve exact solutions for MIMO system operating under Rayleigh fading channels. We outline couple of scenarios dependent on the structure of eigenvalues to investigate the system behavior. The results obtained are validated by means of Monte Carlo simulations.
This paper discusses constructing optimal frequency hopping sequences for use in TDMA-FDMA cellular systems operating in fading channels. It reviews conditions for frequency and time channels to fade independently based on coherence time and bandwidth. The paper presents an algebraic construction of frequency hopping sequences based on linear congruences that guarantees sufficient channel separation to achieve maximum frequency diversity. Examples applicable to the GSM system are provided.
Hex-Cell is an interconnection network that has attractive features like the embedding capability of topological structures; such as; bus, ring, tree and mesh topologies. In this paper, we present two algorithms for embedding bus and ring topologies onto Hex-Cell interconnection network. We use three metrics to evaluate our proposed algorithms: dilation, congestion, and expansion. Our evaluation results
show that the congestion of our two proposed algorithms is equal to one; and the dilation is equal to 2d-1 for the first algorithm and 1 for the second.
Optimization of IP Networks in Various Hybrid IGP/MPLS Routing SchemesEM Legacy
This document discusses optimization of IP networks using hybrid IGP/MPLS routing schemes. It proposes a heuristic approach using genetic algorithms to optimize network performance metrics like utilization and hop count while minimizing the number of label switched paths (LSPs). The document presents models for different hybrid routing approaches, a problem formulation, and results from applying the genetic algorithm approach to a case study network.
Mobile ad hoc networks – dangling issues of optimal path strategyAlexander Decker
The document discusses issues related to selecting optimal paths in mobile ad hoc networks. It proposes using a random direction mobility model to detect neighborhoods and trace paths between source and destination nodes. The model represents nodes moving in random directions for periods of time before pausing. The paper also discusses calculating the probability of link availability over time between two moving nodes based on their movements and developing a link maintenance probability model. An implementation of detecting neighborhoods using this low probability mobility model in Java is also described.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...cscpconf
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active research area, basically for supporting real time applications that are based upon interaction between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve more deterministic behavior of the network i.e. a stable path, so that information carried by the network can be delivered in an uninterrupted fashion and for better resource utilization. In this paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing algorithm for MANETs with better route failure management and which will be highly adaptive and energy efficient.
Amtr the ant based qos aware multipath temporally ordered routing algorithm ...csandit
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which
are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active
research area, basically for supporting real time applications that are based upon interaction
between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve
more deterministic behavior of the network i.e. a stable path, so that information carried by the
network can be delivered in an uninterrupted fashion and for better resource utilization. In this
paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing
algorithm for MANETs with better route failure management and which will be highly adaptive
and energy efficient.
This document discusses two schemes for implementing multirate transmission in fiber-optic code-division multiple access (CDMA) networks: the parallel scheme and the serial mapping scheme. The parallel scheme assigns each user multiple addresses based on their data rate and encodes bits in parallel. The serial mapping scheme encodes bits serially using optical orthogonal codes (OOCs) constructed from frequency hop codes. Analysis shows the parallel scheme can support error correction coding to increase network capacity, while the serial mapping performs well even without coding. Both schemes allow accommodating high numbers of multirate users without increasing optical processing complexity.
Section based hex cell routing algorithm (sbhcr)IJCNCJournal
A Hex-Cell network topology can be constructed using units of hexagon cells. It has been introduced in the literature as interconnection network suitable for large parallel computers, which can connect large number of nodes with three links per node. Although this topology exhibits attractive characteristics such as embeddability, symmetry, regularity, strong resilience, and simple routing, the previously suggested routing algorithms suffer from the high number of logical operations and the need for readdressing of nodes every time a new level is add to the network. This negatively impacts the performance of the network as it increases the execution time of these algorithms. In this paper we propose an improved optimal point to point routing algorithm for Hex-Cell network. The algorithm is based on dividing the Hex-Cell topology into six divisions, hence the name Section Based Hex-Cell Routing (SBHCR). The SBHCR algorithm is simple and preserves the advantage of the addressing scheme proposed for the Hex-Cell network. It does not depend on the depth of the network topology which leads to overcome the issue of readdressing of nodes every time a new level is added. Evaluation against two previously suggested routing algorithms has shown the superiority of SBHCR in term of less logical operations.
PERFORMANCE OF OLSR MANET ADOPTING CROSS-LAYER APPROACH UNDER CBR AND VBR TRA...IJCNCJournal
The routing protocols play an important role in Mobile Ad-Hoc Network (MANET) because of the dynamically change of its topology. Optimized Link State Routing (OLSR), unawareness of Quality of Service (QoS) and power-consumed protocol, is an example of a widely-used routing protocol in MANET.
The Multi-Point Relays (MPR) selection algorithm is very crucial in OLSR. Therefore, firstly, we propose a heuristic method to select the best path based on two parameters; Bit Error Rate (BER) derived from the physical layer and Weighted Connectivity Index (CI) adopted from the network layer. This can be done via the cross-layer design scheme. This is anticipated to enhance the performance of OLSR, provide QoS
guarantee and improve the power consumption. The performances of the proposed scheme are investigated
by simulation of two types of traffics: CBR and VBR (MPEG-4), evaluated by metrics namely Throughput, Packet Delivery Ratio (PDR), Average End-to-End Delay, Control Overhead and Average Total Power Consumption.We compare our results with the typical OLSR and OLSR using only Weighted CI. It is
obvious that our proposed scheme provides superior performances to the typical OLSR and OLSR using only Weighted CI, especially, at high traffic load.
A Method to Determine End-Points ofStraight Lines Detected Using the Hough Tr...IJERA Editor
This document presents a method for determining the end points of lines detected using the Hough transform. The Hough transform detects lines of unspecified length by finding equations that describe lines, but does not provide information about the actual end points. The presented method tracks points from the original image that contributed to lines detected in the Hough transform space. Consecutive points are grouped into sub-lines if there are enough points to constitute a significant segment and points are far enough from other groups along the same line. Sample results demonstrating the method are shown. The method involves grouping contributing points into valid sub-lines based on minimum length and separation criteria.
Design And Evaluation of Time Slot Assignment Algorithm For IEEE 802.16j Rela...CSCJournals
In IEEE 802.16j relay networks, wireless communications are carried out based on TDMA where the wireless network resources are divided into multiple time slots and they are assigned to wireless links between relay nodes as transmission opportunities. The network performance is improved by decreasing the total number of different time slots assigned to all links in a single scheduling cycle, because it brings the increase in the transmission opportunities of the links per unit time. Although it can be achieved when multiple links utilize the same time slot, the capacity of such links is degraded due to the radio interference. On the other hand, since all links in the network need to have enough time slots to accommodate their traffic load, degrading the link capacity may increase the total number of different time slots in the scheduling cycle. Therefore, we should determine the time slot assignment by considering the above-mentioned tradeoff relationship. In this paper, we propose heuristic algorithms for time slot assignment problem in IEEE 802.16j relay networks, and evaluate them through extensive simulation experiments. Two algorithms based on different heuristic are introduced. One algorithm assigns a set of time slots to links by a greedy approach. The other algorithm determines a set of links that use a time slot by a brute-force search for maximizing the total link capacity. Performance evaluation results exhibit that the proposed algorithms reduces around 34% and 39% of the total time slots compared with the case where no link utilizes the same time slot, respectively. Meanwhile, they also show that calculation time of the latter algorithm is longer than that of the former algorithm to reduce the total time slots. Thus, we show that there is a tradeoff between performance and calculation time.
This document proposes a semiblind channel estimation approach for MIMO-OFDM systems that combines training-based and blind techniques. It derives a linear prediction-based blind constraint and incorporates it into a training-based least squares cost function using a weighting factor. A perturbation analysis justifies the superiority of the semiblind solution and derives a closed-form expression for the mean square error of the blind constraint, facilitating the calculation of the optimal weighting factor. Computer simulations show the proposed semiblind approach achieves very high channel estimation accuracy compared to purely training-based or blind methods.
This document analyzes and models the Enhanced Data rates for GSM Evolution (EDGE) mobile communication system. It develops a MATLAB simulation of the EDGE system to model channel coding, modulation, interleaving, burst building, multipath fading channels, channel estimation and detection. The simulation tests the system over additive white Gaussian noise and Rayleigh fading channels. Results show received signal quality decreases with lower signal-to-noise ratio, and fading channels require higher SNR to achieve the same performance as non-fading channels.
This document proposes two genetic algorithm based methodologies called Minimum Spanning Tree First (MSTF) and Shortest Paths First (SPF) for designing customized and energy optimized irregular Network-on-Chip (NoC) topologies tailored to an application's communication characteristics. The MSTF methodology first constructs a minimum spanning tree and then extends the topology by adding shortest energy paths, while SPF first finds the shortest energy paths and then constructs the minimum spanning tree. Experimental results on random benchmarks show the SPF methodology reduces average dynamic communication energy by 18.5% on average compared to MSTF. SPF also achieves lower latency and similar throughput. Comparisons with regular 2D mesh NoCs and an intelligent mapping
Determining location information of sensor node is an essential issue to capture the sensed data and to
update the necessary information in many wireless sensor network applications, such as healthcare services,
military applications, warning systems, environmental monitoring etc. Mobile Anchor Node is used to achieve
Localization in a wireless sensor networks. Hence the main challenge is to design and develop a Path Planning
Algorithm for a Mobile Anchor Node to broadcast three consecutive non-collinear messages for location
estimation which in turn increases localization accuracy and coverage and also reduces time required to
determine location information. In this paper, I propose a Path Planning Algorithm called Z-curve to perform
trilateration calculation to estimate sensor nodes location. Proposed trajectory can successfully localize all
deployed sensor nodes in a network region of interest with more accuracy and consumes less time for
localization. Furthermore, to handle obstacles, Z-curve obstacle-handling trajectory is proposed.
Keywords— Wireless sensor networks, mobile anchor node, path planning, non-collinear, localization
IMPACT OF FADING CORRELATION, POLARIZATION COUPLING AND KEYHOLES ON MIMO DETE...ijmnct
This document summarizes a research paper that analyzes the impact of fading correlation, cross polarization coupling, and the keyhole effect on the error performance of V-BLAST MIMO systems using detectors like ZF, MMSE, and ML. It is observed that performance is better when channel fading correlation and cross polarization coupling values are lower. The keyhole effect can cause the channel matrix to be rank deficient, limiting the benefits of multiple antennas. Simulation results show the BER performance of these detectors for different modulation schemes under varying channel conditions.
Compressed fuzzy logic based multi-criteria AODV routing in VANET environmentIJECEIAES
Vehicular ad hoc networks (VANETs) are the core of intelligent transportation systems (ITS) to obtain safety, better transportation services, and improved traffic management. Providing more reliable and efficient on demand routing protocol is one of the main challenges in these networks research scope. This paper argues a compressed fuzzy logic based method to enhance Ad hoc on demand distance vector (AODV) routing decision by jointly considering number of relays, distance factor, direction angle, and vehicles speed variance. The proposed scheme is simulated in both freeway and urban scenarios with different number of vehicles using real time interaction between both OMNet++ and SUMO simulators. Simulation results show that the proposed approach can get better performance in terms of packet delivery ratio, throughput, mean delay, and number of sent control packets.
A Review on Channel Routing On VLSI Physical DesignIOSR Journals
This document provides a review and analysis of several algorithms for channel routing in VLSI physical design. It begins with an introduction to channel routing and multi-layer routing models. It then analyzes and summarizes two important two-layer channel routing algorithms: the Efficient Routing Algorithm and the MCC1 and MCC2 algorithms. Next, it discusses a three-layer channel routing algorithm. Finally, it analyzes the MulCh multi-layer channel routing algorithm and its differences from the Chameleon algorithm. Key concepts discussed include horizontal and vertical constraint graphs, net merging techniques, and assigning nets to different routing layers or groups.
The document proposes a hybrid architecture for channel allocation and routing in wireless mesh networks to improve quality of service. It uses a combination of static and dynamic channel allocation. Dynamic channel allocation (DCA) is optimized using an Adaptive DCA protocol (ADCA) that considers both throughput and delay. Static channels provide high throughput paths while dynamic channels improve connectivity and adaptability. Simulation results show the hybrid approach achieves lower delay and higher throughput than static-only or dynamic-only approaches. It also compares clustering which can further increase throughput and reduce delay compared to the hybrid method.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
GTSH: A New Channel Assignment Algorithm in Multi-Radio Multi-channel Wireles...IJERA Editor
This document presents a new channel assignment algorithm called GTSH for multi-radio multi-channel wireless mesh networks. It combines the genetic algorithm and tabu search algorithm to maximize throughput. The genetic algorithm is used to generate initial solutions while tabu search explores neighbors of the best solution to avoid getting stuck in local optima. Simulation results using the NS2 simulator showed the hybrid GTSH method achieved significantly higher throughput than using genetic or tabu search alone.
1) The authors implemented an advanced standard cell router using the OpenAccess C++ API. They enhanced the previous SnakeRouter in three ways: implementing a Star Maze routing algorithm, adding support for an extra metal layer and bidirectional wires, and revising the post processor.
2) The Star Maze router uses an A* algorithm to find faster routes with minimal length. The layout generator was modified to support the extra layer and wire types. The post processor was improved to reduce violations.
3) The improved router passed 26/28 LVS tests and 18/28 DRC tests. Further improvements could generate layouts in one pass and use polygons for more intelligent shape merging.
One of the biggest reasons for road accidents is curvy lanes and blind turns. Even one of the biggest hurdles for new autonomous vehicles is to detect curvy lanes, multiple lanes and lanes
with a lot of discontinuity and noise. This paper presents very efficient and advanced algorithm
for detecting curves having desired slopes (especially for detecting curvy lanes in real time)
and detection of curves (lanes) with a lot of noise, discontinuity and disturbances. Overall aim
is to develop robust method for this task which is applicable even in adverse conditions. Even in
some of most famous and useful libraries like OpenCV and Matlab, there is no function
available for detecting curves having desired slopes, shapes, discontinuities. Only few
predefined shapes like circle, ellipse, etc, can be detected using presently available functions.
Proposed algorithm can not only detect curves with discontinuity, noise, desired slope but also
it can perform shadow and illumination correction and detect/ differentiate between different
curves.
Robust and Real Time Detection of Curvy Lanes (Curves) Having Desired Slopes ...csandit
One of the biggest reasons for road accidents is curvy lanes and blind turns. Even one of the
biggest hurdles for new autonomous vehicles is to detect curvy lanes, multiple lanes and lanes
with a lot of discontinuity and noise. This paper presents very efficient and advanced algorithm
for detecting curves having desired slopes (especially for detecting curvy lanes in real time)
and detection of curves (lanes) with a lot of noise, discontinuity and disturbances. Overall aim
is to develop robust method for this task which is applicable even in adverse conditions. Even in
some of most famous and useful libraries like OpenCV and Matlab, there is no function
available for detecting curves having desired slopes, shapes, discontinuities. Only few
predefined shapes like circle, ellipse, etc, can be detected using presently available functions.
Proposed algorithm can not only detect curves with discontinuity, noise, desired slope but also
it can perform shadow and illumination correction and detect/ differentiate between different
curves.
Area, Delay and Power Comparison of Adder TopologiesVLSICS Design
This document compares the area, delay, and power characteristics of different adder topologies, including ripple carry adder, carry look-ahead adder, carry skip adder, carry select adder, carry increment adder, carry save adder, and carry bypass adder. It analyzes the functionality and performance of 8-bit implementations of each adder type using Microwind simulation software at a 0.12μm CMOS technology node. The ripple carry adder has the simplest design but the longest propagation delay that scales with the number of bits, while other topologies like the carry look-ahead adder and carry skip adder reduce delay but have more complex circuitry. The document aims to
DESIGNING HIGH-SPEED, LOW-POWER FULL ADDER CELLS BASED ON CARBON NANOTUBE TEC...VLSICS Design
This article presents novel high speed and low power full adder cells based on carbon nanotube field effect transistor (CNFET). Four full adder cells are proposed in this article. First one named CN9P4G) and second one (CN9P8GBUFF) utilizes 13 and 17 CNFETs respectively. Third design that we named CN10PFS uses only 10 transistors and is full swing. Finally, CN8P10G uses 18 transistors and divided into two modules, causing Sum and Cout signals are produced in a parallel manner. All inputs have been used straight, without inverting. These designs also used the special feature of CNFET that is controlling the threshold voltage by adjusting the diameters of CNFETs to achieve the best performance and right voltage levels. All simulation performed using Synopsys HSPICE software and the proposed designs are compared to other classical and modern CMOS and CNFET-based full adder cells in terms of delay, power consumption and power delay product.
Bit Error Rate Performance of MIMO Spatial Multiplexing with MPSK Modulation ...ijsrd.com
Wireless communication is one of the most effective areas of technology development of our time. Wireless communications today covers a very wide array of applications. In this, we study the performance of general MIMO system, the general V-BLAST architecture with MPSK Modulation in Rayleigh fading channels. Based on bit error rate, we show the performance of the 2x2 schemes with MPSK Modulation in noisy environment. We also show the bit error rate performance of 2x2, 3x3, 4x4 systems with BPSK modulation. We see that the bit error rate performance of 2x2 systems with QPSK modulation gives us the best performance among other schemes analysed here.
A new clustering technique based on replication for MANET routing protocolsTELKOMNIKA JOURNAL
The cluster head nodes in most mobile ad hoc networks (MANET) clustering protocols take on an extraordinary role in managing routing information. The reliability, efficiency and scalability of the clustering in MANET will ultimately be dramatically impacted. In this work we establish a new approach to form the clusters in MANET called the square cluster-based routing protocol (SCBRP). That protocol is based on the theory of replication. The goal of the protocol is to achieve reliability, availability and scalability with in the MANET. The proposed protocol is evaluated by caring the performance analysis using the NS-3 simulator. The performance shows 50% improvementin data delivering ratio in large network size, also shows an improvement in network stability and availability which is reflected in energy consumption measurements and increase in the system lifetime to 20%.
Localized Algorithm for Channel Assignment in Cognitive Radio NetworksIJERA Editor
Cognitive Radio has been emerged as a revolutionary solution to migrate the current shortage of spectrum
allocation in wireless networks. In this paper, an improved localized channel allocation algorithm based on
channel weight is proposed. A factor of channel stability is introduced based on link environment, which
efficiently assigns the best channels to the links. Based on the framework, a conflict resolution strategy is used to
make the scheme adaptable to different network conditions. Calculations indicate that this algorithm can reduce
the conflicts, increase the delivery rate and link assignment rate compared with the basic channel assignment
algorithm.
ANGLE ROUTING:A FULLY ADAPTIVE PACKET ROUTING FOR NOCijcsa
The performance of network-on-chip largely depends on the underlying routing techniques. In this paper a
novel fully adaptive deadlock-free packet routing algorithm for network on chip is proposed. This method which is called angle routing (AR) determines a path based on minimizing the angle between the candidate
neighbouring switch, current switch and destination. Simulation results under different traffic patterns
show that, as the volume traffic of the network on chip increases, our new algorithm achieves significant
better average latency compared to some other deterministic and partially adaptive routing algorithms.
1) The document presents upper and lower bounds on the capacity of MIMO relay channels, which are wireless channels with multiple antennas at the source, relay, and destination nodes.
2) For fixed channel conditions, an upper bound is derived involving maximization over covariance matrices and a scalar parameter capturing signal cooperation. A lower bound is found as the maximum of the direct link and cascaded link capacities.
3) The analysis is extended to Rayleigh fading channels, where the ergodic (average) capacity is considered. It is shown that under certain conditions, the upper and lower bounds meet, characterizing the exact ergodic capacity.
Channel Allocation and Routing in Wireless Mesh Networks: A survey and qualit...ijwmn
In order to avoid transmission's collisions and improve network performances in wireless mesh networks (WMNs), a reliable and efficient medium access control (MAC) protocol and a good channel allocation are needed. Allowing multiple channels use in the same network is often presented as a possible way to improve the network capacity. As IEEE 802.11, IEEE 802.15 and IEEE 802.16 standards provide more than one channel, thus a trivial way to improve the network performances is to allow transmission on multiple channels in each network node. A lot of research work have been conducted in the area of multi-channel allocation in order to improve the aggregate bandwidth of the hole network. In this paper, we focus our attention on the proposals for solving the channel allocation problem for Multi-Transceiver per node in the backbone level using the IEEE 802.11s technology. We classify these proposals into three categories. The first one consists on channel allocation proposals done at the MAC level independently to the other layers. The second one consists on a channel allocation approaches done by a modified MAC collaborating with upper layers. Finally, the third category concerns channel allocation methods implemented in a new layer resulting from a common-layer design between MAC and Network layer. For each category, the existing multi-channel protocols and their channel allocation approaches are identified. A qualitative comparison is conducted according to the advantages that they present, the limitations and problems they are facing, and the performances they are claiming to offer.
One of the main challenges faced by the developing (3GPP-LTE-Advanced) standard is providing high throughput at the cell edge.
One solution to improve coverage is the use of fixed relays.
HIGH SPEED MULTIPLE VALUED LOGIC FULL ADDER USING CARBON NANO TUBE FIELD EFFE...VLSICS Design
High speed Full-Adder (FA) module is a critical element in designing high performance arithmetic circuits. In this paper, we propose a new high speed multiple-valued logic FA module. The proposed FA is constructed by 14 transistors and 3 capacitors, using carbon nano-tube field effect transistor (CNFET) technology. Furthermore, our proposed technique has been examined in different voltages (i.e., 0.65v and 0.9v). The observed results reveal power consumption and power delay product (PDP) improvements compared to existing FA counterparts.
Multi-Channel Preemptive Priority Model for SpectrumMobility in Cognitive Rad...IJECEIAES
Cognitive Radio techniques have been proposed for improving utilization of the spectrum by exploiting the unoccupied bands of the licensed spectrum. This paper proposes a preemptive multi-channel access model for prioritized cognitive radio networks using an iterative method of queuing theory to solve the spectrum scarcity problem. The proposed model formulates accurate closed form of an expected waiting time in the queue, an expected number of users in the queue, an expected waiting time in the system, and an expected number of users in the system. The results compared to the basic model (without preemptive priority) show that, the waiting time in queue and the waiting time in the system compared to the basic model will be improved by 92.99% and 33.15% respectively for class one secondary user. The results also show that, the waiting time in queue and the waiting time in the system will be improved by 43.25% and 15.42% respectively for class two secondary users. The proposed model investigates the desirable schedules of primary and secondary users.
Efficiency of two decoders based on hash techniques and syndrome calculation ...IJECEIAES
The explosive growth of connected devices demands high quality and reliability in data transmission and storage. Error correction codes (ECCs) contribute to this in ways that are not very apparent to the end user, yet indispensable and effective at the most basic level of transmission. This paper presents an investigation of the performance and analysis of two decoders that are based on hash techniques and syndrome calculation over a Rayleigh channel. These decoders under study consist of two main features: a reduced complexity compared to other competitors and good error correction performance over an additive white gaussian noise (AWGN) channel. When applied to decode some linear block codes such as Bose, Ray-Chaudhuri, and Hocquenghem (BCH) and quadratic residue (QR) codes over a Rayleigh channel, the experiment and comparison results of these decoders have shown their efficiency in terms of guaranteed performance measured in bit error rate (BER). For example, the coding gain obtained by syndrome decoding and hash techniques (SDHT) when it is applied to decode BCH (31, 11, 11) equals 34.5 dB, i.e., a reduction rate of 75% compared to the case where the exchange is carried out without coding and decoding process.
Similar to AN EFFICIENT APPROACH FOR FOUR-LAYER CHANNEL ROUTING IN VLSI DESIGN (20)
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
A review on techniques and modelling methodologies used for checking electrom...nooriasukmaningtyas
The proper function of the integrated circuit (IC) in an inhibiting electromagnetic environment has always been a serious concern throughout the decades of revolution in the world of electronics, from disjunct devices to today’s integrated circuit technology, where billions of transistors are combined on a single chip. The automotive industry and smart vehicles in particular, are confronting design issues such as being prone to electromagnetic interference (EMI). Electronic control devices calculate incorrect outputs because of EMI and sensors give misleading values which can prove fatal in case of automotives. In this paper, the authors have non exhaustively tried to review research work concerned with the investigation of EMI in ICs and prediction of this EMI using various modelling methodologies and measurement setups.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
Batteries -Introduction – Types of Batteries – discharging and charging of battery - characteristics of battery –battery rating- various tests on battery- – Primary battery: silver button cell- Secondary battery :Ni-Cd battery-modern battery: lithium ion battery-maintenance of batteries-choices of batteries for electric vehicle applications.
Fuel Cells: Introduction- importance and classification of fuel cells - description, principle, components, applications of fuel cells: H2-O2 fuel cell, alkaline fuel cell, molten carbonate fuel cell and direct methanol fuel cells.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELgerogepatton
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
TIME DIVISION MULTIPLEXING TECHNIQUE FOR COMMUNICATION SYSTEMHODECEDSIET
Time Division Multiplexing (TDM) is a method of transmitting multiple signals over a single communication channel by dividing the signal into many segments, each having a very short duration of time. These time slots are then allocated to different data streams, allowing multiple signals to share the same transmission medium efficiently. TDM is widely used in telecommunications and data communication systems.
### How TDM Works
1. **Time Slots Allocation**: The core principle of TDM is to assign distinct time slots to each signal. During each time slot, the respective signal is transmitted, and then the process repeats cyclically. For example, if there are four signals to be transmitted, the TDM cycle will divide time into four slots, each assigned to one signal.
2. **Synchronization**: Synchronization is crucial in TDM systems to ensure that the signals are correctly aligned with their respective time slots. Both the transmitter and receiver must be synchronized to avoid any overlap or loss of data. This synchronization is typically maintained by a clock signal that ensures time slots are accurately aligned.
3. **Frame Structure**: TDM data is organized into frames, where each frame consists of a set of time slots. Each frame is repeated at regular intervals, ensuring continuous transmission of data streams. The frame structure helps in managing the data streams and maintaining the synchronization between the transmitter and receiver.
4. **Multiplexer and Demultiplexer**: At the transmitting end, a multiplexer combines multiple input signals into a single composite signal by assigning each signal to a specific time slot. At the receiving end, a demultiplexer separates the composite signal back into individual signals based on their respective time slots.
### Types of TDM
1. **Synchronous TDM**: In synchronous TDM, time slots are pre-assigned to each signal, regardless of whether the signal has data to transmit or not. This can lead to inefficiencies if some time slots remain empty due to the absence of data.
2. **Asynchronous TDM (or Statistical TDM)**: Asynchronous TDM addresses the inefficiencies of synchronous TDM by allocating time slots dynamically based on the presence of data. Time slots are assigned only when there is data to transmit, which optimizes the use of the communication channel.
### Applications of TDM
- **Telecommunications**: TDM is extensively used in telecommunication systems, such as in T1 and E1 lines, where multiple telephone calls are transmitted over a single line by assigning each call to a specific time slot.
- **Digital Audio and Video Broadcasting**: TDM is used in broadcasting systems to transmit multiple audio or video streams over a single channel, ensuring efficient use of bandwidth.
- **Computer Networks**: TDM is used in network protocols and systems to manage the transmission of data from multiple sources over a single network medium.
### Advantages of TDM
- **Efficient Use of Bandwidth**: TDM all
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...IJECEIAES
Medical image analysis has witnessed significant advancements with deep learning techniques. In the domain of brain tumor segmentation, the ability to
precisely delineate tumor boundaries from magnetic resonance imaging (MRI)
scans holds profound implications for diagnosis. This study presents an ensemble convolutional neural network (CNN) with transfer learning, integrating
the state-of-the-art Deeplabv3+ architecture with the ResNet18 backbone. The
model is rigorously trained and evaluated, exhibiting remarkable performance
metrics, including an impressive global accuracy of 99.286%, a high-class accuracy of 82.191%, a mean intersection over union (IoU) of 79.900%, a weighted
IoU of 98.620%, and a Boundary F1 (BF) score of 83.303%. Notably, a detailed comparative analysis with existing methods showcases the superiority of
our proposed model. These findings underscore the model’s competence in precise brain tumor localization, underscoring its potential to revolutionize medical
image analysis and enhance healthcare outcomes. This research paves the way
for future exploration and optimization of advanced CNN models in medical
imaging, emphasizing addressing false positives and resource efficiency.
The Python for beginners. This is an advance computer language.
AN EFFICIENT APPROACH FOR FOUR-LAYER CHANNEL ROUTING IN VLSI DESIGN
1. International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.5, October 2012
DOI : 10.5121/vlsic.2012.3512 147
AN EFFICIENT APPROACH FOR FOUR-LAYER
CHANNEL ROUTING IN VLSI DESIGN
Ajoy Kumar Khan1
, Bhaskar Das2
and Tapas Kumar Bayen3
1
Department of Information Technology, Assam University, Silchar, India
ajoyiitg@gmail.com
2
Department of Information Technology, Assam University, Silchar, India
bhaskardas2006@gmail.com
3
Department of Computer Science and Engineering, N. I. S. T, Berhampur, India
tapas.bayen@gmail.com
ABSTRACT
Channel routing is a key problem in VLSI physical design. The main goal of the channel routing problem is
to reduce the area of an IC chip. If we concentrate on reducing track number in channel routing problem
then automatically the area of an IC chip will be reduced. Here, we propose a new algorithm to reduce the
number of tracks using four layers (two horizontal layers and two vertical layers). To be more specific,
through this algorithm we convert a two-layer channel routing problem into a four-layer channel routing
problem using VCG of the channel. Next, we show the experimental results and graphical structure of that
solution.
KEYWORDS
Track, Channel routing, Manhattan routing model, VCG & Merging.
1. INTRODUCTION
We all know that routing is very important problem in VLSI physical design. The main goal of
routing is the reduction of area of an IC chip. The process of finding the geometric layout of all
nets is called routing. Nets must be routed within the routing regions. In addition, nets must
not short-circuit, i.e. nets must not intersect each other.
The input of the general routing problem is:
1. Netlist.
2. Timing budget of nets, typically for critical nets only.
3. Placement information including location of blocks, location of pins on the block
boundary as well as on top due to ATM model (sea-of-pins model), and location of
I/O pins on the chip boundary as well as on top due to C4 solder bumps.
4. RC delay per unit length on each metal layer, as well as RC delay for each type of
via.
The traditional approach to routing, however, divides the routing into two phases. The first phase
is called Global Routing and second phase is called Detailed Routing. In Global Routing, we
generate a loose route for each net. In fact it assigns a list of routing regions to each net without
specifying the actual geometrical layout of wires. In Detailed Routing we find actual geometric
layout of each net within the assigned routing regions. We are in global routing phase.
2. International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.5, October 2012
148
To make easier to the routing problem the routing regions are divided into rectangular blocks.
The blocks contain pins which need to be connected in their perimeter. There are two types of
routing regions: Channel and switchbox. We are concentrating on channel routing problem. A
channel is rectangular area which has two open ends and other two sides are bounded by two
opposite sides of the blocks.
Channel routing has been used to implement the layout of Integrated Circuits (ICs) in a variety of
design styles such as gatearrays, standard cells, and macro-cells (building blocks). The traditional
channel routing problem assumes that two layers of material are available for routing. Advances
in manufacturing technology, however, have made it practical to use three or even four layers for
interconnections, and it is possible that in the near future more interconnect layers will be
available.
We know that in Manhattan routing model we can only use horizontal wire segments and vertical
wire segments to interconnect the nets. The layer with only horizontal wire segments is called
horizontal layer (H) and the layer with only vertical wire segments is called vertical layer (V). In
the case of multi-layer we place the horizontal and vertical layers alternatively. The connection
between the layers is done through via hole.
Now we are going to discuss some important concepts which are needed in our proposed
algorithm. These are HCG, VCG, HNCG and transitive HNCG. HCG is an undirected graph in
which each node represents the net. In HCG any vertex adjacent to some other vertex means that
these two nets can’t be given to the same track. VCG is directed graph in which the directed edge
represents that the track occupied by the source vertex or net must lies above the track occupied
by the destination vertex or net. HNCG is the complement of HCG. The figure 1 shows an
example of a channel and its HCG, VCG and HNCG of that particular channel.
Figure 1. (a) An example channel (b) HCG (c) VCG (d) HNCG of the channel.
In this paper, we are transforming the two layer channel routing problem into a four layer channel
routing problem using a new approach. Next part we discuss about problem formulation and next
(a) (b)
(c) (d)
V1
V2
V3
V1
V2
V3
V1
V2 V3
1
2 3 2 1
30
0
1 0
3. International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.5, October 2012
149
we discuss the algorithm using an example. After that we show the result and future scope of our
newly developed algorithm.
2. RELATED WORKS
In 1971, Hashimoto and Stevens [12] proposed an algorithm, for routing channels without vertical
constraints. Their algorithm, commonly known as the left edge algorithm (LEA), can route a
channel using no-dogleg routing within density number of tracks. The LEA is an iterative
algorithm. In each step it computes a set of pair wise non-overlapping intervals for assignment to
a track. Such a set is computed in each step starting from the leftmost net in the remaining
channel. Consider the first iteration. Let I1be the interval with a terminal at the leftmost column
position. Let I2be the interval with leftmost starting column position after the right end of I1.
Non-overlapping intervals I1 and I2 are selected by the LEA for assignment to the first track.
Yoshimura and Kuh [7] proposed a different but very efficient algorithm for two layer channel
routing. They divide the channel area into many zones first. This Algorithm doesn’t allow the
dogleg routing. This algorithm is based on the merging technique of two nets. They considered
that two nets can be merged if there is no horizontal overlapping and there is no direct path in the
vertical constraint graph between these two nets. We scan from left zone to right zone. We check
that in one zone one net ends and one net begins from the next zone. If these two nets have one
directed path in vertical constraint graph then we choose the net from previous zone to merge
with it. Otherwise we merge these two nets. After merging we also update the VCG accordingly.
This procedure is continuing to the last zone.
Yoshimura and Kuh [7] again proposed another algorithm which is the variant of the above
algorithm. In that algorithm, the pair of nets to be merged is selected using bipartite graph
matching technique.
Here we analyse two algorithms: MCC1 [6] and MCC2 [6]. Here we consider that there is no
vertical constraint. So we resolve the horizontal constraint to get the minimum track needed for
routing. The first algorithm MINIMUM_CLICK_COVER_1 (MCC1) is based on graph theoretic
approach. The second algorithm MINIMUM_CLICK_COVER_2 (MCC2) is based on balanced
binary search tree data structure.
Then one new algorithm is proposed by Chen and Liu [9] and is applicable in three-layer channel
routing. This algorithm is extension of net merging method. This router separately considers
routing for the VHV and HVH routing models. In VHV case the Left Edge Algorithm (LEA) is
extended. In this case, after assigning all the horizontal wire segments to the horizontal layer
using LEA, all upward vertical wire segments are assigned to one vertical layer and all downward
vertical layer segments are assigned to the another vertical layer. In the case of HVH, this
algorithm takes the concept of merging techniques. Here, the router not only merges the nets
between two different zones (as in two-layer routing) but also merges the nets in the same zone.
The merging of nets between two zones is called serial merging and the merging of nets in the
same layer is called parallel merging.
New techniques for routing general multi-layer channels are introduced by D. Braunt, J. Burns, S.
Devadas, H. K. Ma, K. Mayaram, F. Romeo, and A. Sangiovanni-Vincentelli [13]. These
techniques can handle a variety of technology constraints. For example, linewidth and line-to-line
spacing can be specified independently for each layer, and contact stacking can be allowed or
forbidden. These techniques have been implemented in a new multi-layer channel router called
Chameleon.
Greenberg, Ishii and Sangiovanni-Vincentelli [3] proposed an algorithm MulCh for routing a
channel which has more than four layers. MulCh can use unrestricted doglegging in the reserved
4. International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.5, October 2012
150
layer Manhattan routing model and always route channels with cyclic vertical constraints. Here,
the problem is decomposed by assigning the nets into groups. One is VH group, another is HVH
group and another new group called B group. MulCh allows the layer called B layer on which
wire segments are allowed to run both horizontal and vertical directions.
3. PROBLEM STATEMENT
The primary objective of routing is to minimize the channel area. The secondary objectives are to
minimize the number of vias and to minimize the length of each net. The objectives may be in
opposition: for example, doglegging can reduce area but it can also increase net length and via
count.
If we concentrate on reducing the number of tracks needed for connecting the nets then
automatically the area is also reduced. Here we use two horizontal layers and two vertical layers
and trying to find out minimum number of tracks for connecting the nets.
4. PROPOSED ALGORITHM
In this section, we propose a new algorithm for the four layer channel routing problem where
there is no cycle in VCG of that channel. To be more specific, through this algorithm we
transform the two layer routing problem into four layer routing problem using VCG of that
channel. Here we use two horizontal layers and two vertical layers. In our proposed algorithm, the
horizontal segments of which nets are placed in first horizontal layer, the vertical segments of
those nets are paced in first vertical layer and the same is happened in second horizontal layer and
second vertical layer also. First, we draw the vertical constraint graph (VCG) of a given channel.
Then, all the nets in the channel are sorted according to their starting column position in
ascending order.
Let us take an example to illustrate our algorithm. Figure 2 shows an example channel. Figure 3
shows the VCG of that channel. In this example channel we can see that the net 7 starts from first
column and next net 2. So, after sorting all the nets, the sorting order of the nets becomes (7, 2,
1, 5, 4, 3, 8, 6).
Figure 2. An Example Channel for Routing
7 70 0 01 12 3 345 6
7 0 001 12 4 55 68 8
5. International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.5, October 2012
151
Figure 3. VCG of figure 2.
First we select that net N which is first in the sorted list and that is stored into another list L. Then
we choose the net Ns which start first after the net N ends. Then we check if there is a path or not
between the any nets in the list L and Ns. If there is a path, then left Ns and choose the net which
starts next and that is the new Ns. Next Ns becomes N and this is also inserted into L. This process
is continued till the columns of channel ends. These nets which are in list L that is placed into
one track. Then, the nets which are in list L those nets are deleted from the sorted list and merge
these vertices in VCG and that becomes the new VCG. Then again select the first net in sorted
list. This whole process repeats till the sorted list is empty.
In the figure 2 we can see that 7 is the first net in the sorted list and so we select 7. After 7 ends, 5
starts first but there is a path between 7 and 5 in VCG. So, we choose the net which starts next
and that is 4. We can see that there is no path between 7 and 4 and so we select 4. Then, again
after 4 ends, 8 starts first but there is a path between 7 and 8. So, we choose next and that is 6. We
can see that there is no path between 7 and 6 or 4 and 6. So we select 6. So, one L becomes (7, 4,
6) and these nets can be placed into one track. Then Merge these vertices in VCG and that
become the new VCG shown in figure 4. Next delete these nets from sorted list. Now again select
the first net in sorted list and repeat these all steps until the sorted list become empty. According
to the algorithm the next L becomes (2, 5, 8) and merge this vertices in new VCG shown in figure
5. Two other lists are (1) and (3).
So we need four tracks in two layer channel routing problem. Here we use two horizontal layers.
So we need minimum two tracks for routing. The first two cliques are placed into first horizontal
layer and next two cliques are placed into second horizontal layer. And vertical wire segments for
first two cliques are placed into first vertical layers and vertical wire segments of next two cliques
are placed into second vertical layer. So we are using four layers (HVHV) for routing.
Figure 4. Merged VCG after First List
7
4
3
6
85
1
2
6. International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.5, October 2012
152
Now, the lists (7, 4, 6) and (2, 5, 8) are placed in the first horizontal layer and the lists (1) and (3)
are placed in the second horizontal layer. We can see that (7, 4, 6) are on the upper level than (2,
5, 8). So, (7, 4, 6) are placed on first track and the (2, 5, 8) is placed on the second track.
Similarly for the second horizontal layer (3) is placed on first track and (1) is placed on second
track.
Figure 5. Merged VCG after Second, Third and Last List
Figure 6. Solution of figure 2.
In our example, the number of lists is 4 and that is even. But if the number of lists is odd then first
n/2 lists is placed in first horizontal layer and the rest are placed in the second horizontal layer
where n is the number of lists. So, now the figure 6 shows the solution of the example channel
shown in figure 2. The nets which are drawn by plain lines are placed in first horizontal and
vertical layers, and the nets which are drawn by dotted lines are placed in second horizontal and
vertical layers.
Now we are in the algorithm part.
Algorithm: Minimum_Track_1
Input: Channel Specification.
Output: Minimum number of tracks for four layers.
Begin
Step 1: Sort the nets according to their starting column positions in ascending order.
Step 2: Construct the VCG G = (V, E). Take a variable count = 0.
7 70 0 01 12 3 345 6
7 0 001 12 4 55 68 8
1
3
7, 4, 6
2, 5, 8
7. International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.5, October 2012
153
Step 3: while (the sorted list is non-empty) do
begin
Step 3.1: Assign a list L Φ.
Step 3.2: Select the first net N from the sorted list. Assign L L ᴗ N.
Step 3.3: Repeat.
Step 3.3.1: Select the net Ns which starts first after N ends
Step 3.3.2: Repeat.
Step 3.3.2.1: Check in that there is one path or not between Ns and any vertex in
the list L in VCG.
Step 3.3.2.2: If path exists then left Ns and choose which starts next Ns and that
is new Ns.
Step 3.3.3: until one net is selected or Scan all the nets.
Step 3.3.5: Now assign N Ns and L L ᴗ N.
Step 3.4: Until the vertex N is a last net.
Step 4.5: L is one list and count++.
Step 4.6: Merge L vertices in VCG and it is new VCG.
End
Step 4: Minimum number of tracks Ts = count/2 .
End
5. EXPERIMENTAL RESULTS
The program is written in C programming language in Windows XP platform. The result is very
good. We show the results in table 1. These examples are taken from [9].
The figure 7 shows the graphical representation of Ex.6. We can see that in two-layer problem it
need 8 tracks for routing but in our four-layer channel routing algorithm we need only 4 tracks. In
the same way figure 8 and figure 9 also shows the solution of Ex. 7 and Ex. P&G. So, we can
come to know that the new algorithm gives the better result comparison to any two layer channel
routing algorithms.
Table 1. Experimental Results.
Examples
No. of
nets
No. of tracks
(Two-Layer)
No. of tracks
(Four-Layer)
% of reduction
Ex. 1 5 4 2 50%
Ex. 2 6 6 3 50%
Ex. 3 7 5 3 40%
Ex. 4 8 5 3 40%
Ex. 5 10 5 3 40%
Ex. 6 12 8 4 50%
Ex. 7 19 8 4 50%
9. International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.5, October 2012
155
6. CONCLUSION AND FUTURE SCOPE
So, we are in the end of this paper. Here we reduced the number of tracks needed for channel
routing problem. We know that if we reduce the number of tracks then automatically the area of
an IC chip is also reduced. So, we can conclude that our algorithm gives very good result
comparison to any two-layer channel routing problem but our algorithm will run only when there
is no close loop in the initial VCG of that channel that means the VCG must be a tree.
We know that if there is a cycle in VCG then we must need one more vertical layer. So, we can
add one more vertical layer before horizontal layer. Then it becomes a five-layer channel
problem. Then again another problem arises that if there are more than two cycles in VCG then
what to do? So, we have to draw some algorithm for this purpose also. That is our future scope.
REFERENCES
[1] A. Pal, A. K. Khan, S. Saha Sau, A. K. Dutta, R. K. Pal and A. Chaodhury, (2010) “Application of
Graph in Computing Reduced Area VLSI Channel Routing Solutions,” Proc. Of International
Conference on Computing and Systems (ICCS- 2010), pp. 249-256.
[2] A. Pal, T. N. Maldal, S. Saha Sau, A. K. Dutta, R. K. Pal and A. Chaudhuri, (2011) “Graph – The
Tool to Visualize the Problems in VLSI Channel Routing.” Assam University Journal of Science &
technology, Vol. 7, Number II, pp 73-83.
[3] R. I. Greengerg, A. T. Ishii and A. L. Sangiovanni –Vincentelli, (1988) “Mulch: A Multi-Layer
Channel Router Using One, Two, and Three Layer Partitions,” IEEE International Conference
on Digital Object Identifier, pp. 88-91.
[4] R. K. Pal, A. K. Datta, S. P. Pal, M. M. Das and A. Pal, (1995) “A General Graph Theoretic
Framework for Multi-Layer Channel Routing,” Proc. Of Eighth VSI/IEEE International Conference
on VLSI Design, New Delhi, India, pp. 202-207.
[5] A. Pal, T. N. Maldal, S. Saha Sau, A. K. Dutta, R. K. Pal and A. Chaudhuri, (2011) “An Efficient
Heuristic to Find Ruduced Area VLSI Channel Routing Solutions with Floating Terminals” Assam
University Journal of Science & technology, Vol. 9, Number II, pp 55-64.
[6] R. K. Pal, A. K. Datta, S. P. Pal and A. Pal, (1993) “Resolving Horizontal Constraints and Minimizing
Net Wire Length for Multi-Layer Channel Routing,” Proc. Of IEEE Region 10’s 8th
Annual Int. Conj.
On Computer, Communication, Control and Engineering (TENCON 1993), vol. 1, pp. 569-573.
[7] T. Yoshimura and E. S. Kuh, (1982) “Efficient Algorithms for Channel routing,” IEEE Trans. On
CAD of Integrated Circuits and Systems, vol. 1, pp. 25-35.
[8] R. K. Pal, (2000)”Multi-Layer Channel Routing: Complexity and Algorithms” Narosa Publishing
House, New Delhi.
[9] Y. K. Chen and M. L. Liu, (1984) “Three-Layer Channel Routing,” IEEE Trans. On CAD, Vol. Cad-
3, No.2, pp. 156-163.
[10] R. K. Pal, S. P. Pal and A. Pal, (1998) “An Algorithm for Finding a Non-Trivial Lower Bound for
Channel Routing,” INTEGRATION: the VLSI Journal, Vol. 25, No. 1, pp. 71-84.
[11] J.Reed, A.Sangiovanni–Vincentelli and M. Santomauro, (1985) “A New Symbolic Channel Router:
YACR2,” IEEE Trans. On CAD of Integrated Circuits and Systems, vol. 4, pp. 208-219.
[12] Hashimto A. and I. Stevens, (1971) “Win routing by optimiaing channel assignment within large
apertures”, Proc. of 8th Design Aufomation Wonbhop, pp. 155-169.
[13] D. Braunt, J. Burns, S. Devadas, H. K.Ma, K. Mayaram, F. Romeo, and A. Sangiovanni-Vincentelli,
(1986) “Chameleon: A New Multi-Layer Channel Router,” IEEE 23rd Design Automation
Conference, pp. 495-502.
[14] P. Bruell and P. Sun, (1984) “A “Greedy” Three Layer Channel Router”. Pmt. ZCCAD-85. pp. 298-
300.
[15] D. Deutsch, (1976) “A ‘dogleg’ channel router”. A-cc. 23th Design Automation Conf., pp. 425-433.
[16] R. Rivest, (1982) “Benchmark channel-routing problems”, private communication.
10. International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.5, October 2012
156
Authors
Ajoy Kumar Khan was born on 17th
September,
1979 in Kolkata, India. He completed his
M.Tech degree from Calcutta University,
Kolkata, in 2007, in Computer Science and
Engineering. Now, he is pursuing Ph.D in the
area of VLSI Design from Assam University,
Silchar, India. Presently, he is serving as
Assistant Professor in the Department of
Information Technology, Assam University. He
has more than 5 years teaching experience. His
main research interests are in the area of VLSI
Design and Network Security.
Bhaskar Das was born in Kolkata, India on 12th
June, 1987. He graduated from West Bengal
University of Technology, Kolkata, in Computer
Science and Engineering, in 2009. Then he was a
Lecturer in the department of Information
Technology in Uttar Pradesh Technical
University from 2009 to 2011. Now, he is
pursuing M.Tech in Information Technology
from Assam University, Silchar, India. His main
research interests are in the area of VLSI Design
and Design of Algorithm.
Tapas Kumar Bayen was born in Kolkata, India
on 10th
April, 1980. He completed his M.Tech
degree from Calcutta University, Kolkata, in
2008, in Computer Science and Engineering.
Presently, he is serving as Assistant Professor in
the Department of Computer Science and
Engineering, National Institute of Science and
Technology, Berhampur, Orissa, India. He has
more than 5 years teaching experience. His main
research interests are in the area of VLSI Design
and Algorithm.