Log in

Relevant bibliographies by topics / Channel routing / Journal articles

To see the other types of publications on this topic, follow the link: Channel routing.

Journal articles on the topic 'Channel routing'

Author: Grafiati

Published: 4 June 2021

Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Channel routing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Roychowdhury, V. P., J. W. Greene, and A. El Gamal. "Segmented channel routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 12, no. 1 (1993): 79–95. http://dx.doi.org/10.1109/43.184845.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Leong, H. W., and C. L. Liu. "Discretionary channel routing." IEE Proceedings G (Electronic Circuits and Systems) 135, no. 2 (1988): 45. http://dx.doi.org/10.1049/ip-g-1.1988.0007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bhatia, Dinesh, and V. Shankar. "Greedy Segmented Channel Router." VLSI Design 5, no. 1 (January 1, 1996): 11–21. http://dx.doi.org/10.1155/1996/53512.

Full text

Abstract:

An efficient solution to the generalized detailed routing problem in segmented channels for row-based FPGAs is presented. A generalized detailed routing allows routing of each connection using an arbitrary number of tracks, i.e., doglegs are allowed. This approach is different from the normally followed method where each connection is routed on a single straight track. We present a router that performs generalized segmented channel routing using a greedy approach to route channels. The router also renders itself to limited tolerance against faults in the routing architecture.

APA, Harvard, Vancouver, ISO, and other styles

4

P. T. Nimbalkar, P. T. Nimbalkar, D. K. Mokashi D. K. Mokashi, and S. V. Kanitkar S. V. Kanitkar. "Channel Routing Model For Flood Zone Mapping." Indian Journal of Applied Research 1, no. 2 (October 1, 2011): 48–49. http://dx.doi.org/10.15373/2249555x/nov2011/15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chaudhary, K., and P. Robinson. "Channel routing by sorting." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 10, no. 6 (June 1991): 754–60. http://dx.doi.org/10.1109/43.137504.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Haruyama, S., D. F. Wong, and D. S. Fussell. "Topological channel routing (VLSI)." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 11, no. 10 (1992): 1177–97. http://dx.doi.org/10.1109/43.170984.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Tong Gao and C. L. Liu. "Minimum crosstalk channel routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15, no. 5 (May 1996): 465–74. http://dx.doi.org/10.1109/43.506134.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Markosyan, S. E., and G. S. Gasparyan. "LSI channel routing algorithms." Cybernetics 27, no. 3 (1991): 349–53. http://dx.doi.org/10.1007/bf01068315.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Tragoudas, Spyros. "On Channel Routing Problems With Interchangeable Terminals." VLSI Design 2, no. 1 (January 1, 1994): 51–68. http://dx.doi.org/10.1155/1994/48137.

Full text

Abstract:

The use of programmable logic cells in VLSI design allows the terminals on these cells to be interchanged since their geometrics are programmable. Recently, many exact algorithms and heuristics have been proposed for channel routing with interchangeable terminals [18, 25, 4, 11, 12, 20, 17, 3]. Various optimization problems have also been shown to be NP—hard [25, 23]. In this paper, we consider channels with exits. Let m, D be the number of terminals in the channel and the maximum number of terminals on a net, respectively. We present an O(m) algorithm that obtains optimal density for channels with exits that have one cell on each side. The existing algorithm for this problem [5] guarantees only an approximate density. Moreover, if one of the two cells has fixed terminals, we show that the density minimization problem is NP-hard. The latter problem was introduced in [5]. For instances with any number of cells we present an O(m) time algorithm for the via minimization problem, an O(m2⋅D) algorithm for the problem of finding a maximum planar subset of nets in a channel, and an O(m) algorithm to determine whether the channel adopts external-internal layout. Also for the special case where there exists one cell per side, we present an alternative algorithm that finds a maximum planar set of nets in O(m) time.

APA, Harvard, Vancouver, ISO, and other styles

10

Zakaria, Omar M., Aisha-Hassan A. Hashim, Wan H. Hassan, Othman O. Khalifa, M. Azram, Lalitha B. Jivanadham, Mistura L. Sanni, and Mahdi Zareei. "Joint Channel Assignment and Routing in Multiradio Multichannel Wireless Mesh Networks: Design Considerations and Approaches." Journal of Computer Networks and Communications 2016 (2016): 1–24. http://dx.doi.org/10.1155/2016/2769685.

Full text

Abstract:

Multiradio wireless mesh network is a promising architecture that improves the network capacity by exploiting multiple radio channels concurrently. Channel assignment and routing are underlying challenges in multiradio architectures since both determine the traffic distribution over links and channels. The interdependency between channel assignments and routing promotes toward the joint solutions for efficient configurations. This paper presents an in-depth review of the joint approaches of channel assignment and routing in multiradio wireless mesh networks. First, the key design issues, modeling, and approaches are identified and discussed. Second, existing algorithms for joint channel assignment and routing are presented and classified based on the channel assignment types. Furthermore, the set of reconfiguration algorithms to adapt the network traffic dynamics is also discussed. Finally, the paper presents some multiradio practical implementations and test-beds and points out the future research directions.

APA, Harvard, Vancouver, ISO, and other styles

11

Yan, Jin-Tai, and Pei-Yung Hsiao. "An O(NlogN) Algorithm for Region Definition Using Channels/Switchboxes and Ordering Assignment." VLSI Design 4, no. 1 (January 1, 1996): 11–16. http://dx.doi.org/10.1155/1996/36403.

Full text

Abstract:

For a building block placement, the routing space can be further partitioned into channels and switchboxes. In general, the definition of switchboxes releases the cyclic channel precedence constraints and further yields a safe routing ordering process. However, switchbox routing is more difficult than channel routing. In this paper, an O(NlogN) region definition and ordering assignment (RDAOA) algorithm is proposed to minimize the number of switchboxes for the routing phase, where N is the number of vertices in a channel precedence graph. Several examples have been tested on the proposed algorithm, and the experimental results are listed and compared.

APA, Harvard, Vancouver, ISO, and other styles

12

WU, JIE, and LI SHENG. "DEADLOCK-FREE ROUTING IN IRREGULAR NETWORKS USING PREFIX ROUTING." Parallel Processing Letters 13, no. 04 (December 2003): 705–20. http://dx.doi.org/10.1142/s0129626403001616.

Full text

Abstract:

We propose a deadlock-free routing scheme in irregular networks using prefix routing. Prefix routing is a special type of routing with a compact routing table associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a prefix of the label of the destination node. Node and channel labeling in an irregular network is done through constructing a spanning tree. The routing process follows a two-phase process of going up and then down along the spanning tree, with a possible cross channel (shortcut) between two branches of the tree between two phases. We show that the proposed routing scheme is deadlock- and livelock-free. We also compare prefix routing with the existing up*/down* routing which has been widely used in irregular networks. Possible extensions are also discussed.

APA, Harvard, Vancouver, ISO, and other styles

13

Tseng, Ming-Hseng, Chiang-An Hsu, and Chia R. Chu. "Channel Routing in Open-Channel Flows with Surges." Journal of Hydraulic Engineering 127, no. 2 (February 2001): 115–22. http://dx.doi.org/10.1061/(asce)0733-9429(2001)127:2(115).

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Abida, Habib, and Ronald D. Townsend. "Parameter optimization in modelling unsteady compound channel flows." Canadian Journal of Civil Engineering 19, no. 3 (June 1, 1992): 441–46. http://dx.doi.org/10.1139/l92-053.

Full text

Abstract:

Optimization methods are used to estimate data for routing floods through open compound channels (main channels with flood plain zones). These data include the irregular channel section geometry and the varying boundary roughness. Differences between simulated and observed stages and discharges are minimized using three optimization algorithms: Powell's method, Rosenbrock's algorithm, and the Nelder and Meade simplex method. Powells' method performed poorly; however, both the Rosenbrock and simplex methods yielded good results. The estimated data using the Rosenbrock and simplex methods were used to route different flood events observed in a laboratory channel. Simulated peak stages and discharges were in good agreement with those estimated using actual routing data. Key words: compound channel, flood routing, lateral momentum transfer, optimization, unsteady flow.

APA, Harvard, Vancouver, ISO, and other styles

15

Leong, H. W., and C. L. Liu. "Algorithms for permutation channel routing." Integration 5, no. 1 (March 1987): 17–45. http://dx.doi.org/10.1016/s0167-9260(87)80004-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Cheng, C. K., D. N. Deutsch, C. Shohara, M. Taparauskas, and M. Bubien. "Geometric compaction on channel routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 11, no. 1 (1992): 115–27. http://dx.doi.org/10.1109/43.108624.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Braun, D., J. L. Burns, F. Romeo, A. Sangiovanni-Vincentelli, K. Mayaram, S. Devadas, and H. K. T. Ma. "Techniques for multilayer channel routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 7, no. 6 (June 1988): 698–712. http://dx.doi.org/10.1109/43.3209.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Cong, J., and C. L. Liu. "Over-the-cell channel routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 9, no. 4 (April 1990): 408–18. http://dx.doi.org/10.1109/43.45872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Gao, Shaodi, and Michael Kaufmann. "Channel routing of multiterminal nets." Journal of the ACM 41, no. 4 (July 1994): 791–818. http://dx.doi.org/10.1145/179812.179927.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Jin, Ming, and Danny L. Fread. "Channel Routing with Flow Losses." Journal of Hydraulic Engineering 122, no. 10 (October 1996): 580–82. http://dx.doi.org/10.1061/(asce)0733-9429(1996)122:10(580).

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

LaPaugh, A. S., and R. Y. Pinter. "Channel Routing for Integrated Circuits." Annual Review of Computer Science 4, no. 1 (June 1990): 307–65. http://dx.doi.org/10.1146/annurev.cs.04.060190.001515.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Shih, Pao‐Hsu, and Wu‐Shung Feng. "Channel routing using neural networking." Journal of the Chinese Institute of Engineers 14, no. 6 (September 1991): 603–10. http://dx.doi.org/10.1080/02533839.1991.9677376.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Tan, Xuehou, and Xiaoyu Song. "Hexagonal three-layer channel routing." Information Processing Letters 55, no. 4 (August 1995): 223–28. http://dx.doi.org/10.1016/0020-0190(95)00090-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Braun, D., J. Burns, F. Romeo, A. Sangiovanni-Vincentelli, K. Mayaram, S. Devada, and H. K. Tony. "Techniques for multilayer channel routing." Computer-Aided Design 20, no. 7 (September 1988): 423. http://dx.doi.org/10.1016/0010-4485(88)90225-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Brady, M. L., D. J. Brown, and K. D. Powers. "Hexagonal Models for Channel Routing." Algorithmica 19, no. 3 (November 1997): 263–90. http://dx.doi.org/10.1007/pl00009174.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Cao, Zhan Mao, and Jian Chao Tang. "Routing Methods and Scheduling Patterns in MIMO WMN Virtual Model." Applied Mechanics and Materials 519-520 (February 2014): 216–21. http://dx.doi.org/10.4028/www.scientific.net/amm.519-520.216.

Full text

Abstract:

Multi-input multi-output wireless mesh networks (MIMO WMNs) act as backbone broadband networks for ubiquitous access. Topology model is a crucial factor in interference avoidance, simplifying channel allocation, and discussing optimal scheduling and routing. Cartesian product of graphs (CPG) is introduced for MIMO WMN as a virtual topology. By putting orthogonal channels into different channel layer meshes, some conclusions are explored on channel allocation, routing and scheduling. A path coherent realization is composed of combinatorial edges over multiple channels for all hops. Some important property propositions in CPG are also given, such as path hops with node address and path number counting. Practical mesh node addressing scheme and path number counting theorems are useful virtual topology properties.

APA, Harvard, Vancouver, ISO, and other styles

27

YAN, JIN-TAI. "ROUTING SPACE ESTIMATION AND ASSIGNMENT FOR MACRO-CELL PLACEMENT." Journal of Circuits, Systems and Computers 08, no. 04 (August 1998): 435–46. http://dx.doi.org/10.1142/s0218126698000237.

Full text

Abstract:

In general, the routing space between two adjacent macro-cells is estimated and assigned after completing the placement of all the macro-cells. In this paper, the routing space in a macro-cell placement is divided into straight channels. First, based on a probabilistic analysis, a new routing space estimation approach for a channel is proposed. For the assignment of routing space between two adjacent macro-cells, it is desired that this assignment does not change the topological relation between any pair of adjacent macro-cells in a macro-cell placement. Hence, the assignment of a previous channel will not be modified by the assignment of a recent channel during the assignment process of routing space. A safe routing space assignment approach is further proposed for obtaining a complete macro-cell placement. It is proved that the time complexity of a safe routing space assignment is O(Nlog N), where N is the number of macro-cells in a macro-cell netlist. Finally, the experimental results show that the proposed estimation and assignment of routing space is effective in a macro-cell placement.

APA, Harvard, Vancouver, ISO, and other styles

28

TAYU, Satoshi, Toshihiko TAKAHASHI, Eita KOBAYASHI, and Shuichi UENO. "On the Three-Dimensional Channel Routing." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A, no. 10 (2016): 1813–21. http://dx.doi.org/10.1587/transfun.e99.a.1813.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Wing Ning Li. "The complexity of segmented channel routing." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 14, no. 4 (April 1995): 518–23. http://dx.doi.org/10.1109/43.372378.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Atallah and Hambrusch. "Optimal Rotation Problems in Channel Routing." IEEE Transactions on Computers C-35, no. 9 (September 1986): 843–47. http://dx.doi.org/10.1109/tc.1986.1676846.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Chen, S. S., C. H. Yang, and S. J. Chen. "Bubble-sort approach to channel routing." IEE Proceedings - Computers and Digital Techniques 147, no. 6 (2000): 415. http://dx.doi.org/10.1049/ip-cdt:20000810.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Sarrafzadeh, M. "Channel routing with provably short wires." IEEE Transactions on Circuits and Systems 34, no. 9 (September 1987): 1133–35. http://dx.doi.org/10.1109/tcs.1987.1086260.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Ho, T. T., S. S. Iyengar, and S. Q. Zheng. "A general greedy channel routing algorithm." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 10, no. 2 (1991): 204–11. http://dx.doi.org/10.1109/43.68407.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Diskin, Mordechai H., and Yan Ding. "Channel routing independent of length subdivision." Water Resources Research 30, no. 5 (May 1994): 1529–34. http://dx.doi.org/10.1029/93wr03417.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Shimamoto, Takashi, Akio Sakamoto, and Akio Ushida. "On routability for channel routing problem." Electronics and Communications in Japan (Part I: Communications) 70, no. 4 (1987): 25–34. http://dx.doi.org/10.1002/ecja.4410700403.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Hambrusch, S. E. "Channel Routing Algorithms for Overlap Models." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 4, no. 1 (January 1985): 23–30. http://dx.doi.org/10.1109/tcad.1985.1270095.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Szymanski, T. G. "Dogleg Channel Routing is NP-Complete." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 4, no. 1 (January 1985): 31–41. http://dx.doi.org/10.1109/tcad.1985.1270096.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Tan, K. P., and T. S. Tan. "Discretionary channel routing using score function." IEE Proceedings I Solid State and Electron Devices 135, no. 3 (1988): 49. http://dx.doi.org/10.1049/ip-i-1.1988.0009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Bisztray, D. "Interchangeable terminals in channel routing problem." Electronics Letters 22, no. 14 (1986): 743. http://dx.doi.org/10.1049/el:19860511.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Rossi, A. "A simulated annealing channel routing algorithm." Calcolo 27, no. 3-4 (September 1990): 279–90. http://dx.doi.org/10.1007/bf02575798.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Brady, Martin L., and Donna J. Brown. "Optimal multilayer channel routing with overlap." Algorithmica 6, no. 1-6 (June 1991): 83–101. http://dx.doi.org/10.1007/bf01759036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Lodi, E., F. Luccio, and L. Pagli. "Channel routing for strictly multiterminal nets." Integration 8, no. 2 (November 1989): 143–53. http://dx.doi.org/10.1016/0167-9260(89)90045-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Cong, Jingsheng, and D. F. Wong. "Generating more compactable channel routing solutions." Integration 9, no. 2 (April 1990): 199–214. http://dx.doi.org/10.1016/0167-9260(90)90036-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Gleason, Colin J., Kang Yang, Dongmei Feng, Laurence C. Smith, Kai Liu, Lincoln H. Pitcher, Vena W. Chu, et al. "Hourly surface meltwater routing for a Greenlandic supraglacial catchment across hillslopes and through a dense topological channel network." Cryosphere 15, no. 5 (May 18, 2021): 2315–31. http://dx.doi.org/10.5194/tc-15-2315-2021.

Full text

Abstract:

Abstract. Recent work has identified complex perennial supraglacial stream and river networks in areas of the Greenland Ice Sheet (GrIS) ablation zone. Current surface mass balance (SMB) models appear to overestimate meltwater runoff in these networks compared to in-channel measurements of supraglacial discharge. Here, we constrain SMB models using the hillslope river routing model (HRR), a spatially explicit flow routing model used in terrestrial hydrology, in a 63 km2 supraglacial river catchment in southwest Greenland. HRR conserves water mass and momentum and explicitly accounts for hillslope routing (i.e., flow over ice and/or firn on the GrIS), and we produce hourly flows for nearly 10 000 channels given inputs of an ice surface digital elevation model (DEM), a remotely sensed supraglacial channel network, SMB-modeled runoff, and an in situ discharge dataset used for calibration. Model calibration yields a Nash–Sutcliffe efficiency as high as 0.92 and physically realistic parameters. We confirm earlier assertions that SMB runoff exceeds the conserved mass of water measured in this catchment (by 12 %–59 %) and that large channels do not dewater overnight despite a diurnal shutdown of SMB runoff production. We further test hillslope routing and network density controls on channel discharge and conclude that explicitly including hillslope flow and routing runoff through a realistic fine-channel network (as opposed to excluding hillslope flow and using a coarse-channel network) produces the most accurate results. Modeling complex surface water processes is thus both possible and necessary to accurately simulate the timing and magnitude of supraglacial channel flows, and we highlight a need for additional in situ discharge datasets to better calibrate and apply this method elsewhere on the ice sheet.

APA, Harvard, Vancouver, ISO, and other styles

45

Pal, Achira, Tarak N. Mandal, Rajat K. Pal, Debojit Kundu, and Alak K. Datta. "Algorithms for Generating Random Channel Instances for Channel Routing Problem." International Journal of Applied Research on Information Technology and Computing 1, no. 1 (2010): 106. http://dx.doi.org/10.5958/j.0975-8070.1.1.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Mustafa, Saad, Sajjad A. Madani, Kashif Bilal, Khizar Hayat, and Samee U. Khan. "Stable-path multi-channel routing with extended level channel assignment." International Journal of Communication Systems 25, no. 7 (July 1, 2011): 887–902. http://dx.doi.org/10.1002/dac.1294.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Zang, Shuaihong, Zhijia Li, Cheng Yao, Ke Zhang, Mingkun Sun, and Xiangyi Kong. "A New Runoff Routing Scheme for Xin’anjiang Model and Its Routing Parameters Estimation Based on Geographical Information." Water 12, no. 12 (December 6, 2020): 3429. http://dx.doi.org/10.3390/w12123429.

Full text

Abstract:

The Xin’anjiang model is a conceptual hydrological model, which has an essential application in humid and semi-humid regions. In the model, the parameters estimation of runoff routing has always been a significant problem in hydrology. The quantitative relationship between parameters of the lag-and-route method and catchment characteristics has not been well studied. In addition, channels in Muskingum method of the Xin’anjiang model are assumed to be virtual channels. Therefore, its parameters need to be estimated by observed flow data. In this paper, a new routing scheme for the Xin’anjiang model is proposed, adopting isochrones method for overland flow and the grid-to-grid Muskingum–Cunge–Todini (MCT) method for channel routing, so that the routing parameters can be estimated according to the geographic information. For the new routing scheme the average overland flow velocity can be determined through the land cover and overland slope, and the channel routing parameters can be determined through channel geometric characteristic, stream order and channel gradient. The improved model was applied at a 90 m grid scale to a nested watershed located in Anhui province, China. The parent Tunxi watershed, with a drainage area of 2692 km2, contains four internal points with available observed streamflow data, allowing us to evaluate the model’s ability to simulate the hydrologic processes within the watershed. Calibration and verification of the improved model were carried out for hourly time scales using hourly streamflow data from 1982 to 2005. Model performance was assessed by comparing simulated and observed flows at the watershed outlet and interior gauging stations. The performance of both original and new runoff routing schemes were tested and compared at hourly scale. Similar and satisfactory performances were achieved at the outlet both in the new runoff routing scheme using the estimated routing parameters and in the original runoff routing scheme using the calibrated routing parameters, with averaged Nash-Sutcliffe efficiency (NSE) of 0.92 and 0.93, respectively. Moreover, the new runoff routing scheme is also able to reproduce promising hydrographs at internal gauges in study catchment with the mean NSE ranging from 0.84 to 0.88. These results indicate that the parameter estimation approach is efficient and the developed model can satisfactorily simulate not only the streamflow at the parent watershed outlet, but also the flood hydrograph at the interior gauging points without model recalibration. This study can provide some guidance for the application of the Xin’anjiang model in ungauged areas.

APA, Harvard, Vancouver, ISO, and other styles

48

Hossain, Md Motaleb. "Analysis of Flood Routing." Dhaka University Journal of Science 62, no. 2 (February 8, 2015): 69–73. http://dx.doi.org/10.3329/dujs.v62i2.21968.

Full text

Abstract:

Flood routing is the technique of determining the flood hydrograph at a section of a river by utilizing the data of flood flow at one or more upstream sections. The hydrologic analysis of problems such as flood forecasting, flood protection, reservoir design and spillway design invariably include flood routing. In these applications two broad categories of routing can be recognized. These are reservoir routing and channel routing. In reservoir routing the effect of a flood wave entering a reservoir is studied. In channel routing the change in the shape of a hydrograph as it travels down a channel is studied. In this paper pick rate of runoff and risk of a coffer dam for different construction years are discussed. We found that peakrate depends on length of travel of water course and risk of coffer dam is more if it is designed for short time for long construction period. DOI: http://dx.doi.org/10.3329/dujs.v62i2.21968 Dhaka Univ. J. Sci. 62(2): 69-73, 2014 (July)

APA, Harvard, Vancouver, ISO, and other styles

49

Sabur, M. A., and P. M. Steffler. "A conservative diffusion wave flood routing scheme for channel networks." Canadian Journal of Civil Engineering 23, no. 2 (April 1, 1996): 566–70. http://dx.doi.org/10.1139/l96-061.

Full text

Abstract:

For long flood waves propagating over considerable distances on relatively flat slopes, the diffusion wave is an adequate approximation to the St. Venant equations of unsteady channel flow. A relatively simple and robust computational scheme based on this approximation is presented herein. The scheme is based on mass conservation equations for discrete control volumes with unique intervolume flows which ensures overall mass conservation. Simple guidelines for determining the spatial and temporal discretizations are provided. Application to a number of test situations indicates that the scheme offers acceptable accuracy without calibration using only reach-averaged channel geometry and roughness characteristics. The scheme would be especially useful as a subcomponent of a large-scale distributed hydrologic or water resources system model. Key words: flood routing, rivers, channels, networks, computational hydraulics, diffusive wave, hydrologic modelling, St. Venant equations.

APA, Harvard, Vancouver, ISO, and other styles

50

MANIKAS, THEODORE W. "INTEGRATED CIRCUIT CHANNEL ROUTING USING A PARETO-OPTIMAL GENETIC ALGORITHM." Journal of Circuits, Systems and Computers 21, no. 05 (August 2012): 1250041. http://dx.doi.org/10.1142/s0218126612500417.

Full text

Abstract:

An important part of the integrated circuit design process is the channel routing stage, which determines how to interconnect components that are arranged in sets of rows. The channel routing problem has been shown to be NP-complete, thus this problem is often solved using genetic algorithms. The traditional objective for most channel routers is to minimize total area required to complete routing. However, another important objective is to minimize signal propagation delays in the circuit. This paper describes the development of a genetic channel routing algorithm that uses a Pareto-optimal approach to accommodate both objectives. When compared to the traditional channel routing approach, the new channel router produced layouts with decreased signal delay, while still minimizing routing area.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!