Interconnect Delay Minimization through Interlayer Via Placement in 3-D ICs

Size: px
Start display at page:

Download "Interconnect Delay Minimization through Interlayer Via Placement in 3-D ICs"

Transcription

1 Interonnet Delay Minimization through Interlayer Via Plaement in -D ICs Vasilis F. Pavlidis, Eby G. Friedman Department of Eletrial and Computer Engineering University of Rohester Rohester, New York 467, UA [pavlidis, ee.rohester.edu ABTRACT The dependene of the propagation delay of the interlayer -D interonnets on the vertial through via loation and length is investigated. For a variable vertial through via loation, with fixed vertial length, the optimum vertial through via loation that minimizes the propagation delay of an interonnet line onneting two iruits on different planes is determined. The optimum vertial through via loation and length or, equivalently, the number of physial planes traversed by the vertial through via, are determined for varying the plaement of the onneted iruits. Design expressions for the optimal via loations and lengths have been developed to support plaement and routing algorithms for -D ICs. Categories and ubjet Desriptors B.7. [Design Aids] General Terms: Performane, Design. Keywords: -D ICs, Elmore delay, RC Interonnets. for interonnet-entri iruits that offers signifiant redutions in interonnetion length. This advantage is ahieved by using the third dimension, as shown in Figure. In Figure, multiple physial planes are staked to reate a -D system. A variety of bonding tehniques to aomplish this task have been desribed in the literature [-]. Most of these tehniques invoe bonding fores with elevated temperatures and the bonding materials inlude adhesive polymers or euteti metal pads [4]. Eah physial plane of the stak is similar to a onventional -D iruit, in that a plane inludes a devie layer and multiple metal layers are used to onnet individual iruits on the same physial plane (the intralayer interonnets). Eah of the bonded planes an utilize ompletely different proesses or design disiplines. For instane, non-silion analog, digital, and RF iruits suh as GaAs and ige an be staked within a single -D multilayer system. uh tehnology diversity extends the apabilities of -D systems over a onventional CMO platform, greatly failitating the ystems-on-chip design onept. Communiation among iruits on different physial planes (the interlayer interonnets) is implemented by vertial through vias, whih are alled vias here for brevity.. INTRODUCTION Tehnology saling has enabled an inrease in integration density and a onsiderable derease in the intrinsi gate delay, through smaller and faster devies. Higher integration densities require both a greater number of interonnets and longer interonnets. Therefore, as the devie delay is redued, the performane of the integrated iruits is now dominated by the interonnet delay. In addition, other interonnet related issues, suh as power onsumption and signal integrity, have beome more pronouned with tehnology saling. To manage these issues, a variety of tehniques have been developed, suh as tapered buffers, repeater insertion, wire sizing, and shielding, to name a few. Nonetheless, these tehniques inrease silion area and power onsumption. As a result, innovative design proesses are sought to satisfy the ever inreasing demand for greater performane. Three-dimensional integration is an effetive design paradigm This researh was supported in part by the emiondutor Researh Corporation under Contrat No. 00-TJ-068 and 004-TJ-07, the National iene Foundation under Contrat No. CCR , the Fullbright Program under Grant No , a grant from the New York tate Offie of iene, Tehnology & Aademi Researh to the Center for Advaned Tehnology in Eletroni Imaging ystems, and by grants from Xerox Corporation, IBM Corporation, Intel Corporation, uent Tehnologies Corporation, and Eastman Kodak Company. Permission to make digital or hard opies of all or part of this work for personal or lassroom use is granted without fee provided that opies are not made or distributed for profit or ommerial advantage and that opies bear this notie and the full itation on the first page. To opy otherwise, or republish, to post on servers or to redistribute to lists, requires prior speifi permission and/or a fee. GVI 05, April 7 9, 005, Chiago, Illinois, UA. Copyright ACM /05/ $5.00. Interonnets Adhesive polymer Interonnets Adhesive polymer Devies ubstrate ubstrate Vertial interplane interonnets (vias) Bulk CMO rd plane nd plane st plane Figure. hemati of a three-dimensional iruit []. These short interlayer vias replae the long interonnets along the edges of the die, yielding a onsiderable redution in wirelength. This behavior is verified by a number of wirelength distribution models desribed in the literature whih predit signifiant savings in the number of long interonnets. The fundamental assumption of these models is that Rent s rule [5] an be applied to threedimensional partitions. More speifially, Joyner [6] extended a stohasti model for -D iruits introdued by Davis [7] to threedimensions. Rahman [8] also used the Davis model as the basis for his -D interonnet distribution model. Although wirelength redution is an attrative feature of -D ICs, volumetri design poses a number of hallenges. Plaement and routing algorithms are examples of suh a hallenge, sine another degree of freedom is added to the design proess [9]. Certain 0

2 transformations an be applied to onvert a -D routing problem to a -D routing task [0]. In addition, novel CAD tools are required for three-dimensional iruits. Reently, suh CAD tools have been published [] that validate the interonnet predition model desribed in [8]. In all of these algorithms, however, the partiular nature of the interlayer interonnets is not onsidered. Additionally, delay expressions used in the aforementioned interonnet predition models for -D iruits are similar to traditional CMO models, negleting the impat of the vias and the non-uniform impedane harateristis of these lines. Zhang et al. [] onsider the effet of the vertial vias on the interlayer interonnets in their delay expression by modeling the line with different impedanes; however, they apply two restritive assumptions. First, that the via is always plaed in the mide of the line, independent of the line length and, seond, eah horizontal segment of the interonnet has the same impedane harateristis. As shown in this paper, the former assumption leads to severe performane inauray, while the latter assumption does not aurately depit the physial nature of the interlayer interonnets. The optimum via loation that yields the minimum propagation delay of the line is determined in this work. The effet of the via length, or equivalently, the number of physial planes that the via spans, on the propagation delay of the line is also investigated. The inlusion of variable via loations into routing algorithms and a variable number of physial planes in plaement algorithms will onsiderably enhane the effiieny of the -D design proess. The rest of the paper is organized as follows. In the following setion, the problems are formulated, and various traits of the interlayer -D interonnets are outlined. For a fixed via length, the optimum via loation to minimize the propagation delay of these interonnets is desribed in etion. Additionally, onditions for the minimum propagation delay, where the via length and loation are varied, are desribed. Expressions for the via length and loation that yield the minimum delay are also provided. In etion 4, simulation results are presented, verifying the theoretial results presented in etion. Finally, in etion 5, some onlusions are offered.. PROBEM FORMUATION The problems explored in this paper an be better explained with the aid of Figure, where a ross setion of a three-dimensional manhattan grid is illustrated. The irles and the bold solid, dashed, and dotted lines represent possible plaement loations and routing paths, respetively. ine the overall performane is typially based on the delay of the long interonnets, it is assumed that these interonnets are routed first, thus multiple routing paths are possible. In Figure a, two iruits are plaed on two different devie layers. The total and interlayer distanes are fixed. The via loation (the length of the horizontal segments of the line), however, is allowed to hange, as shown by the dashed and dotted routing paths. In Figure b, not only does the length of the horizontal segments hange, but also the via is allowed to span a variable number of planes. In the first ase, the optimum via loation that minimizes the propagation delay is determined, while in the seond ase, both the optimum via loation and number of planes that the via traverses are determined. Beause the total geometri length for all of the possible routing paths is the same, in most plaement and routing algorithms a typial riterion to determine the most appropriate via loation and/or number of planes is to selet the routing path and/or plaement loation that yields the minimum routing blokage. This harateristi ours beause in -D iruits, interonnets are usually onsidered to oupy a single metal layer and to be of uniform impedane throughout the length, and the via loation and impedane are assumed to not affet the delay of the line. This assumption is no longer valid, however, for interlayer interonnets in three-dimensional iruits, as shown in Figure. To model interlayer interonnets as an assemblage of non-uniform segments is justified by the physial nature of -D ICs. For example, the iruit an be plaed on more than one die and therefore proess variations not only exist within a single die (intradie) but also die-todie (interdie) variations should be onsidered. Consequently, interonnet impedanes in different physial planes an differ from eah other by a non-negligible amount. In addition, -D ICs may ombine dies from totally disparate tehnologies, resulting in different interonnet parameters for eah physial plane. Furthermore, eah segment of the interlayer interonnet an be laid out on different metal layers, whih exhibit different impedane harateristis. Also, the oupling apaitane between eah segment will vary, as the interonnet struture that surrounds eah segment is typially different. Consider the ase where a -D iruit onsists of only two physial planes and the bonding proess is similar to that illustrated in Figure. The metal layers of the bottom physial plane will exhibit a greater line-to-ground apaitane beause the layers are sandwihed between two substrates, while for those interonnets within the upper plane, the same apaitane omponent is smaller due to the absene of a nearby seond substrate. Figure. Interlayer interonnet (a) with multiple routing paths, (b) with multiple plaement loations and routing paths. Figure. Interlayer interonnet and orresponding model, omposed of a set of non-uniformly distributed RC segments. The Elmore delay model has been adopted to analyze the propagation delay of these interonnets. If auray is an issue, a fitted Elmore delay model an be used []. However, unlike a single plane, more than one set of fitting oeffiients is required in a -D system. In the following setion, the optimum via loation problem is further explored.

3 . OPTIMUM VIA OCATION In this setion, two variants of the optimum via loation problem, whih enhane the task of routing and plaement for interlayer interonnets in -D iruits, are onsidered. In the first subsetion, the optimum via loation of an interonnet, for a fixed via length, is provided. The ase where the via length onstraint is removed is investigated in the seond subsetion.. Fixed number of physial planes An interlayer interonnet that onnets two iruits loated on two different physial planes is depited in Figure. As mentioned previously, due to the non-uniformity of the interonnets, eah segment is modeled as a distributed RC line with different impedane harateristis (see Figure ). Indutane is not onsidered in this work. The driver is modeled as a step input voltage and a linear resistane R, and the interonnet is terminated with a apaitive load C. The total resistane and apaitane of segment i are R i r i l i and C i i l i, where r i and i denote the resistane and apaitane, respetively, per unit length and l i is the length of the segment. The length of the horizontal segments is l and l and the via length is l. ine the via may span more than one physial plane, l an be expressed as l ( n ) l v, () where n is the number of physial planes making up the onneted iruits and l v is the length of the via that interonnets two metal layers loated in two adjaent physial planes. This value is determined by the fabriation proess and an range from 5 µm to 70 µm [], [4]. The total length of the line an be expressed as The Elmore delay for the system is l +. () + l l RC RC Tel + CR + + C + C ( R + R + R ) + C ( R + R ( R + R ) RC + + R + R ). ubstituting the total resistane and apaitane with the per unit length parameters, and using () and (), the Elmore delay desribed in () an be written as a funtion of the length of the first segment l, where ) ( ) ( r r r ) () T el ( l A l + A l + A, (4) A +, (5) Rs ( ) + ( n ) ( r r + r r ) ( r r ) + C ( r r ), A A R (( n ) l ( ) + ) + (( n ) l ) v v + r (6) r r + + r ( n ) ( r r ) + C (( n ) ( r r ) + R + r ) +. (7) Equation (4) desribes a parabola, but the existene of a minimum is not guaranteed. The seond derivative of (4) with respet to l is d Tel A. (8) Depending upon the sign of A, the propagation delay of the line will exhibit either a minimum or a maximum as l varies or, alternatively, as the loation of the via along the line hanges. The following notations are introdued to failitate the analysis, r a, r b, r m, and r From (9), the seond derivative is d Tel ( a + ) r b v. (9). (0) ine r is always positive, the sign of (0) and, onsequently, the timing behavior of the line only depends upon the sign of the term in the parentheses. For the propagation delay to be minimum, the following inequalities should be satisfied, a >, or b > d Tel b (,], a (,] > 0 () b ( 0, ], a (,], and a > b a ( 0, ], b (,], and b > a. If the inequalities in () are not satisfied, the delay of the line exhibits a maximum. The existene of either a minimum or maximum delay with the via loation depending on the values of a and b an be roughly explained as follows. Negleting the via, the line omprises two segments with different impedane harateristis. Alternatively, a non-uniform line an be seen as a uniform tapered line that only onsists of two segments. etting r r 0 /w, r r 0 /w, 0 w, and 0 w, a and b desribe the tapering fator of the line. It has been shown that an optimum tapering fator exists in terms of the delay, where the width of the line dereases towards the reeiver [5]. If a is greater than one, the tapering dereases. The value of l for whih the delay exhibits an extremum, either minimum or maximum, is ( r r + r r ) ( n ) A r r + r l A Rs ( ) ( ) ( ) + r r + C r r r r + r +. () ine no restritions have been applied on the value of l, the extreme point an our for values other than within the physial l 0 l where l 0 -l -l min. l min is the minimum domain of l, i.e., [ ], 0 distane between a via and a ell, determined by the design rules of the fabriation proess. The following emma is used to determine the optimum via loation for various values of a, b, and l. The proof is omitted due to spae limitations. emma : If f(x) Ax d f(x) +Bx+C and < 0 then dx (a) for x max [0,x 0 ] x0 x0 (i) if x max >, f(0) < f(x 0 ), (ii) if x max <, f(0) > f(x 0 ), (b) for x max < 0, f(0) > f(x 0 ), () for x max > x 0, f(0) < f(x 0 ). Depending upon the sign of (0) and the value of l in (), the optimum via loation is determined for eah possible ase: d T A) el > 0. If l [ 0, l0 ], the propagation delay is minimized when l is the value desribed in (). Consequently, the via should be plaed at a distane l from the driver. The Elmore delay for a 5 mm line is illustrated in Figure 4 versus the via loation l. Two

4 observations an be made. First, that the delay exhibits a minimum and that the minima position shifts to the right as a inreases. If l < 0, the via should be plaed losest to the driver, while if l > l 0, the via should be plaed losest to the reeiver. d T B) el < 0. In this ase, the delay of the line reahes a maximum for the value of l desribed in (). If l [ 0 l ], 0, aording to emma, for l < l 0 /, the via should be plaed losest to the reeiver, while for l > l 0 /, the via should be plaed losest to the driver. In Figure 5, the Elmore delay of a 5 mm line is shown as a funtion of the via loation l. Note that the delay reahes a maximum and that the maximum shifts to the right as b inreases. If l < 0, the via should be plaed losest to the reeiver, while if l > l 0, the via should be plaed losest to the driver. T el [nse] Minima a. a.7 a. a.7 a 4. a l [mm] Figure 4. Propagation delay of a 5 mm line versus via loation l for various values of a. The interonnet parameters are r 76 W/mm, r 5 W/mm, ff/mm, 79 ff/mm, b.674, l v 0 µm, and n. The driver resistane and load apaitane are R 40 W and C 80 ff, respetively. d Tel C) 0. If the seond derivative equals zero, (4) beomes T el ( l) Al + A, () whih is a linear funtion of l. The first derivative of (4) is equal to A. For A < 0, (4) is stritly dereasing, and the delay is a minimum by plaing the via losest to the reeiver. For A > 0, (4) is stritly inreasing, and the delay is a minimum by plaing the via losest to the driver. Note that the fundamental minimum distane of a via from a ell is tehnology dependent. In the speial ase where a b, from (6) and (7), A << A and the delay is independent of l. However, as n inreases, A also inreases and the hoie of n affets the rate of hange in the delay, as disussed in the following setion. As illustrated in Figure 4, the optimum via loation shifts to the right (left) when a inreases (dereases). The same applies to Figure 5 in terms of b. To explain this behavior, onsider the definitions of a and b in (9), where a (b) desribes the resistane (apaitane) ratio of the horizontal segments. Referring to Figure 4, both a and b are greater than one, whih means that segment is less (more) resistive (apaitive) than segment. Assuming for the moment that a, the delay of the line dereases as the length of the more apaitive segment l (i.e., C ) dereases. However, l does not vanish beause C inreases as l dereases, approahing C. Consequently, as l is dereased beyond a ertain distane, desribed in (), the delay starts to inrease. As a inreases, the optimum point ours at values of l > l 0 /, although segment is more apaitive than segment (b > ). This behavior ours beause the delay depends not only on the apaitane, but also on the urrent, whih is ontrolled by the resistane of eah segment. In the ase where b >> and a <<, where segment is both more apaitive and resistive than segment, l beomes small to redue the overall delay and, in this ase, () yields negative values for l. imilar arguments apply to the dependene of the optimum via loation on b shown in Figure 5. In the following subsetion, the optimum via loation and number of planes in terms of the propagation delay are determined for a variable number of planes n. T el [nse] b 0.5 b 0.55 b 0.6 b 0.65 b 0.7 b 0.75 b 0.8 b 0.85 Maxima l [mm] Figure 5. Propagation delay of a 5 mm line versus via loation l for various values of b. The interonnet parameters are r 9 W/mm, r 4 W/mm, 96 ff/mm, 86 ff/mm, a 0.47, l v 0 µm, and n. The driver resistane and load apaitane are R 40 W and C 80 ff, respetively.. Variable number of physial planes If the number of physial planes is varied, multiple plaement loations an exist, and (4) beomes ( l l ) r ( F l + F l l + F l + F l + F l ) T el +, (4) where, 4 5 F6 ( ) ( a + ) F, F ( v m + ), (5) b mv a F m + a R C 4 r, (6), F ( b ) + + ( a) R C F5 ( v ) + ( m a) r +, (7) C R C F6 + + a + a. (8) r Equation (4) is a quadrati funtion with respet to l and l, and desribes a paraboloid. As a polynomial funtion is both ontinuous and differentiable, global extrema exist whih an our either on the boundary, or the interior of the domain of l and l. The solutions of the gradient T el ( l,l ), whih are alled ritial points, desribe possible interior extrema. The interior point at whih the delay an exhibit an extremum is

5 ( ab va + m mb + v v + vmb ) Rs l r (( v + m) + mv( b + a) + ab mb va v m ) (9) r ( C + )( va m)( m), r (( v + m) + mv( b + a) + ab mb va v m ) ( R + r ( C + ) )( m mb + ab av + v ) l. (0) r (( v + m) + mv( b + a) + ab mb va v m ) From multivariable alulus, the interior ritial point is a minimum for (4) when (9) and (0) satisfy the following onditions, ( l, l ) Tel H r F > 0, () l H r ( l, l ) T ( l, l ) T ( l, l ) Tel l ( 4F F F ) > 0. el l el l l () ine (4) is a quadrati funtion, both () and () are independent of the ritial points of (4) and the values depend only on the ratios desribed in (9). Depending upon these values, the following ases are distinguished: A) H > 0, H > 0. The delay is a minimum in terms of both the via loation and length. The optimum via loation is given by (9), while the optimum number of planes n opt is obtained after the disreteness onstraints for variable l, desribed in (0), are applied aording to (), l l +, if l < + n opt () l l +, if l > +, where, in (), [x] denotes the integer part of number x. In Figure 6, the Elmore delay of a 5 mm line is plotted versus the via loation l and the via length l. The global minimum is depited in Figure 6 by the dot. Figure 6. Propagation delay of a 5 mm line versus via loation l and via length l. The interonnet parameters are r 5 W/mm, 88 ff/mm, a., b.85, m., and v.5. The driver resistane and load apaitane are R 476 W and C 88 ff, respetively. B) H < 0, H > 0. The delay is a maximum for the values of l and l desribed in (9) and (0), respetively. In this ase, the optimal point both for the via loation and length is on the boundary of the domain of l and l, whih defines a retangle. earhing in the subset of boundary points that onsists of the verties of the retangle, namely T el (l min, l v ), T el (l min, (n max -)l v ), T el (-l v -l min, l v ), and T el (-(n max -)l v -l min, (n max -)l v ) suffies for the minimum delay to be determined. n max is the maximum number of staked planes permitted by the target tehnology. The point that yields the smallest delay provides the optimal values for l and l. C) H < 0. If () is negative, (9) and (0) do not represent an extremum but rather a sade point. The optimal point is again loated on the boundary. Note that in this ase, depending on the signs of F and F, a different subset of boundary points should be examined to determine the optimal values of l and l. In addition, seleting the number of planes an be based on other riteria as disussed in the following setion, where simulation results are presented. 4. REUT AND DICUION In this setion, experimental results are presented and a disussion of the proposed approah is offered, partiularly for those ases where the minimum ours at the boundary. The analysis has been applied to interonnets with lengths ranging from mm to 0 mm, for different interonnets parameters. The ratios in (9) range from 0. to 0, and over all pratial ases of interest. The maximum variation in delay with the length of the segment l (or equivalently the via loation) for different line lengths and interonnet parameters is listed in Table. This variation expresses the differene between the delay of the line when the via is plaed at the optimum point and the delay of the line when the via loation oinides with a point lose to either the reeiver or the driver. It is assumed that the physial design rules impose a minimum 0 µm distane between a via and a ell. The number of planes is equal to two and the via length is assumed to be l l v 0 µm [4]. As listed in Table, the optimum via loation shifts to the right as a inreases, in agreement with the theoretial results depited in Figure 4. In Table, the optimum via loation and number of planes for different line lengths are listed. In this ase, the minimum via length l v 50 µm. As mentioned in etion, a minimum does not exist if () is negative and the values of l and l, from (9) and (0), respetively, orrespond to a sade point. In addition, (0) may result in an infeasible solution, sine the maximum number of planes that an be staked n max is tehnology limited. In these ases, the optima our at the boundary of the domain of l and l. Thus, either n or n n max should be seleted depending upon whih value produes the smaller delay. The hoie of the number of planes n an also be based on a different riterion than the propagation delay. For example, if the impedane parameters of the via are muh greater than those of the horizontal segments (m, v >> ), n an be inreased suh that the delay of the line does not vary signifiantly as the via loation hanges. Alternatively, if the impedane parameters of the line segments are of similar value, the number of planes n an be seleted suh that the delay with respet to l is a minimum when the via is plaed at the enter of the line. In this ase, the variation of the line delay with via loation is smallest, as shown in Figure 4, for a.7. Thus, if an inrease in the overall delay is aeptable, the number of layers n an be hosen suh that the skew between interonnets (e.g., lok skew) varies slowly with via loation. 4

6 5. CONCUION The interlayer via loation and length to minimize the signal delay in -D systems is desribed in this paper. The Elmore delay model is adopted to investigate the propagation delay of interlayer -D interonnets. The non-uniform impedane harateristis of the line are also onsidered. The propagation delay of the interonnet is shown to depend both on the via loation and the number of planes that the via vertially traverses. Expressions for the optimum via loation and number of planes are provided. imulation results verifying these expressions are also presented. The proposed design expressions an be used to enhane plaement and routing algorithms targeting -D ICs. 6. REFERENCE [] R. J. Gutmann et al., Three-dimensional (D) ICs: A Tehnology Platform for Integrated ystems and Opportunities for New Polymeri Adhesives, Proeedings of the Conferene on Polymers and Adhesives in Miroeletronis and Photonis, pp. 7-80, Otober 00. []. Xue, C. iu, and. Tiwari, Multi-layers With Buried trutures (MB): An Approah to Three-dimensional Integration, Proeedings of the IEEE International Conferene on ilion On Insulator, pp. 7-8, Otober 00. [] M. Koyanagi et al., Future ystem-on-silion I Chips, IEEE Miro, Vol. 8, No. 4, pp 7-, July/August 998. [4] A. Fan, A. Rahman, and R. Reif, Copper Wafer Bonding, Eletrohemial and olid-tate etters, Vol. 0, No., pp , Otober 999. [5] B. andman and R. Russo, On a Pin vs. Blok Relationship for Partitions of ogi Graphs, IEEE Transations on Computers, Vol. 0, No., pp , Deember 97. [6] J. W. Joyner et al., Impat of Three-dimensional Arhitetures on Interonnets in Gigasale Integration, IEEE Transations on Very arge ale Integration (VI) ystems, Vol. 9, No. 6, pp. 9-97, Deember 000. [7] J. Davis and J. Mein, A tohasti Wire-length Distribution for Gigasale - Part I: Derivation and Validation, IEEE Transations on Eletron Devies, Vol. 45, No., pp , Marh 999. [8] A. Rahman and R. Reif, ystem-level Performane Evaluation of Three-dimensional Integrated Ciruits, IEEE Transations on Very arge ale Integration (VI) ystems, Vol. 8, No. 6, pp , Deember 000. [9] A. Cohoon et al., Physial ayout for Three-Dimensional FPGAs, Proeedings of the ACM/IGDA Physial Design Workshop, pp. 4-49, April 996. [0] C. C. Tong and C.-. Wu, Routing in a Three-dimensional Chip, IEEE Transations on Computers, Vol. 44, No., pp. 06-7, January 995. []. Das et al., Calibration of Rent s Rule for Three-Dimensional Integrated Ciruits, IEEE Transations on Very arge ale Integration (VI) ystems, Vol., No. 4, April 004. [] R. Zhang et al., tohasti Modeling, Power Trends, and Performane Charaterization of -D Ciruits, IEEE Transations on Eletron Devies, Vol. 48, No. 4, April 00. [] A.I. Abou-eido, B. Nowak, and C. Chu, Fitted Elmore Delay: A imple and Aurate Interonnet Delay Model, IEEE Transations on Very arge ale Integration (VI) ystems, Vol., No. 7, pp , July 004. [4] P. Ramn et al., InterChip Via Tehnology for Vertial ystem Integration, Proeedings of the IEEE International Interonnet Tehnology Conferene, pp. 60-6, June 00. [5] C.-P. Chen et al., Optimal izing Formula Under the Elmore Delay Model, Proeedings of the International ACM/IEEE Design Automation Conferene, pp , June 996. Table. Maximum delay variation and optimum via loation for different interonnet lengths and impedane parameters r 86 Ω/mm, r 5 Ω/mm, 79 ff/mm, 96 ff/mm, b., C 80 ff, and l v 0 µm mm, R 40 Ω mm, R 40 Ω a Del. Variation (%) l opt [mm] mm, R 940 Ω 4 mm, R 940 Ω a Del. Variation (%) l opt [mm] mm, R 560 Ω 6 mm, R 560 Ω a Del. Variation (%) l opt [mm] mm, R 0 Ω 8 mm, R 0 Ω a Del. Variation (%) l opt [mm] mm, R 0 Ω 0 mm, R 0 Ω a Del. Variation (%) l opt [mm] Table. Optimum via loation l and number of physial planes n for different interonnet lengths and impedane parameters Inter. ength l opt [mm] n opt a b m v R [Ω] C [ff] r [Ω/mm] [ff/mm] mm mm mm mm mm

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,

More information

Acoustic Links. Maximizing Channel Utilization for Underwater

Acoustic Links. Maximizing Channel Utilization for Underwater Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,

More information

The AMDREL Project in Retrospective

The AMDREL Project in Retrospective The AMDREL Projet in Retrospetive K. Siozios 1, G. Koutroumpezis 1, K. Tatas 1, N. Vassiliadis 2, V. Kalenteridis 2, H. Pournara 2, I. Pappas 2, D. Soudris 1, S. Nikolaidis 2, S. Siskos 2, and A. Thanailakis

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

INTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS

INTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS Proeedings of the COST G-6 Conferene on Digital Audio Effets (DAFX-), Verona, Italy, Deember 7-9, INTERPOLATED AND WARPED -D DIGITAL WAVEGUIDE MESH ALGORITHMS Vesa Välimäki Lab. of Aoustis and Audio Signal

More information

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1. Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks 62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens

More information

Improved flooding of broadcast messages using extended multipoint relaying

Improved flooding of broadcast messages using extended multipoint relaying Improved flooding of broadast messages using extended multipoint relaying Pere Montolio Aranda a, Joaquin Garia-Alfaro a,b, David Megías a a Universitat Oberta de Catalunya, Estudis d Informàtia, Mulimèdia

More information

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis

More information

Reduced-Complexity Column-Layered Decoding and. Implementation for LDPC Codes

Reduced-Complexity Column-Layered Decoding and. Implementation for LDPC Codes Redued-Complexity Column-Layered Deoding and Implementation for LDPC Codes Zhiqiang Cui 1, Zhongfeng Wang 2, Senior Member, IEEE, and Xinmiao Zhang 3 1 Qualomm In., San Diego, CA 92121, USA 2 Broadom Corp.,

More information

Approximate logic synthesis for error tolerant applications

Approximate logic synthesis for error tolerant applications Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu

More information

Distributed Resource Allocation Strategies for Achieving Quality of Service in Server Clusters

Distributed Resource Allocation Strategies for Achieving Quality of Service in Server Clusters Proeedings of the 45th IEEE Conferene on Deision & Control Manhester Grand Hyatt Hotel an Diego, CA, UA, Deember 13-15, 2006 Distributed Resoure Alloation trategies for Ahieving Quality of ervie in erver

More information

Design of High Speed Mac Unit

Design of High Speed Mac Unit Design of High Speed Ma Unit 1 Harish Babu N, 2 Rajeev Pankaj N 1 PG Student, 2 Assistant professor Shools of Eletronis Engineering, VIT University, Vellore -632014, TamilNadu, India. 1 harishharsha72@gmail.om,

More information

Particle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating

Particle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur

More information

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,

More information

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using

More information

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

We P9 16 Eigenray Tracing in 3D Heterogeneous Media

We P9 16 Eigenray Tracing in 3D Heterogeneous Media We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting

More information

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,

More information

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Partial Character Decoding for Improved Regular Expression Matching in FPGAs Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia

More information

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary

More information

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar

Plot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

Cluster-Based Cumulative Ensembles

Cluster-Based Cumulative Ensembles Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,

More information

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali

More information

Accommodations of QoS DiffServ Over IP and MPLS Networks

Accommodations of QoS DiffServ Over IP and MPLS Networks Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering

More information

HEXA: Compact Data Structures for Faster Packet Processing

HEXA: Compact Data Structures for Faster Packet Processing Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for

More information

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of

More information

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,

More information

New Channel Allocation Techniques for Power Efficient WiFi Networks

New Channel Allocation Techniques for Power Efficient WiFi Networks ew Channel Alloation Tehniques for Power Effiient WiFi etworks V. Miliotis, A. Apostolaras, T. Korakis, Z. Tao and L. Tassiulas Computer & Communiations Engineering Dept. University of Thessaly Centre

More information

Tackling IPv6 Address Scalability from the Root

Tackling IPv6 Address Scalability from the Root Takling IPv6 Address Salability from the Root Mei Wang Ashish Goel Balaji Prabhakar Stanford University {wmei, ashishg, balaji}@stanford.edu ABSTRACT Internet address alloation shemes have a huge impat

More information

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0.

1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0. C HPTER 1 SETS I. DEFINITION OF SET We begin our study of probability with the disussion of the basi onept of set. We assume that there is a ommon understanding of what is meant by the notion of a olletion

More information

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? 3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg

More information

Performance Benchmarks for an Interactive Video-on-Demand System

Performance Benchmarks for an Interactive Video-on-Demand System Performane Benhmarks for an Interative Video-on-Demand System. Guo,P.G.Taylor,E.W.M.Wong,S.Chan,M.Zukerman andk.s.tang ARC Speial Researh Centre for Ultra-Broadband Information Networks (CUBIN) Department

More information

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr

More information

COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems

COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems Andreas Brokalakis Synelixis Solutions Ltd, Greee brokalakis@synelixis.om Nikolaos Tampouratzis Teleommuniation

More information

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless

More information

M32: A Constructive Multilevel Logic Synthesis System*

M32: A Constructive Multilevel Logic Synthesis System* M32: A Construtive Multilevel Logi Synthesis System* Vitor N. Kravets Karem A. Sakallah Department of Eletrial Engineering and Computer Siene University of Mihigan, Ann Arbor, MI 48109 {vkravets, karem}@ees.umih.edu

More information

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of

More information

Improved Circuit-to-CNF Transformation for SAT-based ATPG

Improved Circuit-to-CNF Transformation for SAT-based ATPG Improved Ciruit-to-CNF Transformation for SAT-based ATPG Daniel Tille 1 René Krenz-Bååth 2 Juergen Shloeffel 2 Rolf Drehsler 1 1 Institute of Computer Siene, University of Bremen, 28359 Bremen, Germany

More information

Detection of RF interference to GPS using day-to-day C/No differences

Detection of RF interference to GPS using day-to-day C/No differences 1 International Symposium on GPS/GSS Otober 6-8, 1. Detetion of RF interferene to GPS using day-to-day /o differenes Ryan J. R. Thompson 1#, Jinghui Wu #, Asghar Tabatabaei Balaei 3^, and Andrew G. Dempster

More information

An Efficient and Scalable Approach to CNN Queries in a Road Network

An Efficient and Scalable Approach to CNN Queries in a Road Network An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,

More information

New Fuzzy Object Segmentation Algorithm for Video Sequences *

New Fuzzy Object Segmentation Algorithm for Video Sequences * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 521-537 (2008) New Fuzzy Obet Segmentation Algorithm for Video Sequenes * KUO-LIANG CHUNG, SHIH-WEI YU, HSUEH-JU YEH, YONG-HUAI HUANG AND TA-JEN YAO Department

More information

Modeling of Wire Electrochemical Machining

Modeling of Wire Electrochemical Machining A publiation of 91 CHEMICAL ENGINEERING TRANSACTIONS VOL. 41, 214 Guest Editors: Simonetta Palmas, Mihele Masia, Annalisa Vaa Copyright 214, AIDIC Servizi S.r.l., ISBN 978-88-9568-32-7; ISSN 2283-9216

More information

Sparse Certificates for 2-Connectivity in Directed Graphs

Sparse Certificates for 2-Connectivity in Directed Graphs Sparse Certifiates for 2-Connetivity in Direted Graphs Loukas Georgiadis Giuseppe F. Italiano Aikaterini Karanasiou Charis Papadopoulos Nikos Parotsidis Abstrat Motivated by the emergene of large-sale

More information

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in

More information

1. Introduction. 2. The Probable Stope Algorithm

1. Introduction. 2. The Probable Stope Algorithm 1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground

More information

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking

Algorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient

More information

The Mathematics of Simple Ultrasonic 2-Dimensional Sensing

The Mathematics of Simple Ultrasonic 2-Dimensional Sensing The Mathematis of Simple Ultrasoni -Dimensional Sensing President, Bitstream Tehnology The Mathematis of Simple Ultrasoni -Dimensional Sensing Introdution Our ompany, Bitstream Tehnology, has been developing

More information

Fast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon

Fast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon ACEEE Int. J. on Information Tehnology, Vol. 3, No. 2, June 2013 Fast Distribution of Repliated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon Email: mmalli@aou.edu.lb

More information

A {k, n}-secret Sharing Scheme for Color Images

A {k, n}-secret Sharing Scheme for Color Images A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University

More information

An Approach to Physics Based Surrogate Model Development for Application with IDPSA

An Approach to Physics Based Surrogate Model Development for Application with IDPSA An Approah to Physis Based Surrogate Model Development for Appliation with IDPSA Ignas Mikus a*, Kaspar Kööp a, Marti Jeltsov a, Yuri Vorobyev b, Walter Villanueva a, and Pavel Kudinov a a Royal Institute

More information

Alleviating DFT cost using testability driven HLS

Alleviating DFT cost using testability driven HLS Alleviating DFT ost using testability driven HLS M.L.Flottes, R.Pires, B.Rouzeyre Laboratoire d Informatique, de Robotique et de Miroéletronique de Montpellier, U.M. CNRS 5506 6 rue Ada, 34392 Montpellier

More information

A Fast Kernel-based Multilevel Algorithm for Graph Clustering

A Fast Kernel-based Multilevel Algorithm for Graph Clustering A Fast Kernel-based Multilevel Algorithm for Graph Clustering Inderjit Dhillon Dept. of Computer Sienes University of Texas at Austin Austin, TX 78712 inderjit@s.utexas.edu Yuqiang Guan Dept. of Computer

More information

Adapting K-Medians to Generate Normalized Cluster Centers

Adapting K-Medians to Generate Normalized Cluster Centers Adapting -Medians to Generate Normalized Cluster Centers Benamin J. Anderson, Deborah S. Gross, David R. Musiant Anna M. Ritz, Thomas G. Smith, Leah E. Steinberg Carleton College andersbe@gmail.om, {dgross,

More information

Detection and Recognition of Non-Occluded Objects using Signature Map

Detection and Recognition of Non-Occluded Objects using Signature Map 6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

the data. Structured Principal Component Analysis (SPCA)

the data. Structured Principal Component Analysis (SPCA) Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

HIGHER ORDER full-wave three-dimensional (3-D) large-domain techniques in

HIGHER ORDER full-wave three-dimensional (3-D) large-domain techniques in FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 21, no. 2, August 2008, 209-220 Comparison of Higher Order FEM and MoM/SIE Approahes in Analyses of Closed- and Open-Region Eletromagneti Problems Milan

More information

Multi-Channel Wireless Networks: Capacity and Protocols

Multi-Channel Wireless Networks: Capacity and Protocols Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:

More information

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of

More information

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty

More information

Department of Electrical and Computer Engineering University of Wisconsin Madison. Fall

Department of Electrical and Computer Engineering University of Wisconsin Madison. Fall Department of Eletrial and Computer Engineering University of Wisonsin Madison ECE 553: Testing and Testable Design of Digital Systems Fall 2014-2015 Assignment #2 Date Tuesday, September 25, 2014 Due

More information

The Happy Ending Problem

The Happy Ending Problem The Happy Ending Problem Neeldhara Misra STATUTORY WARNING This doument is a draft version 1 Introdution The Happy Ending problem first manifested itself on a typial wintery evening in 1933 These evenings

More information

The Implementation of RRTs for a Remote-Controlled Mobile Robot

The Implementation of RRTs for a Remote-Controlled Mobile Robot ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh

More information

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department

More information

Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive Results

Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive Results CCCG 2018, Winnipeg, Canada, August 8 10, 2018 Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inonlusive Results Luis A. Garia Andres Gutierrrez Isaa Ruiz Andrew Winslow Abstrat We

More information

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese

More information

High-level synthesis under I/O Timing and Memory constraints

High-level synthesis under I/O Timing and Memory constraints Highlevel synthesis under I/O Timing and Memory onstraints Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn, Eri Martin To ite this version: Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn,

More information

Exploiting Enriched Contextual Information for Mobile App Classification

Exploiting Enriched Contextual Information for Mobile App Classification Exploiting Enrihed Contextual Information for Mobile App Classifiation Hengshu Zhu 1 Huanhuan Cao 2 Enhong Chen 1 Hui Xiong 3 Jilei Tian 2 1 University of Siene and Tehnology of China 2 Nokia Researh Center

More information

DATA ACQUISITION AND PROCESSING OF PARALLEL FREQUENCY SAR BASED ON COMPRESSIVE SENSING

DATA ACQUISITION AND PROCESSING OF PARALLEL FREQUENCY SAR BASED ON COMPRESSIVE SENSING Progress In Eletromagnetis Researh, Vol. 133, 199 215, 2013 DATA ACQUISITION AND PROCESSING OF PARALLEL FREQUENCY SAR BASED ON COMPRESSIVE SENSING Y. N. You, H. P. Xu *, C. S. Li, and L. Q. Zhang Shool

More information

arxiv: v1 [cs.gr] 10 Apr 2015

arxiv: v1 [cs.gr] 10 Apr 2015 REAL-TIME TOOL FOR AFFINE TRANSFORMATIONS OF TWO DIMENSIONAL IFS FRACTALS ELENA HADZIEVA AND MARIJA SHUMINOSKA arxiv:1504.02744v1 s.gr 10 Apr 2015 Abstrat. This work introdues a novel tool for interative,

More information

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center Construting Transation Serialization Order for Inremental Data Warehouse Refresh Ming-Ling Lo and Hui-I Hsiao IBM T. J. Watson Researh Center July 11, 1997 Abstrat In typial pratie of data warehouse, the

More information

COMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP

COMBINATION OF INTERSECTION- AND SWEPT-BASED METHODS FOR SINGLE-MATERIAL REMAP Combination of intersetion- and swept-based methods for single-material remap 11th World Congress on Computational Mehanis WCCM XI) 5th European Conferene on Computational Mehanis ECCM V) 6th European

More information

Space- and Time-Efficient BDD Construction via Working Set Control

Space- and Time-Efficient BDD Construction via Working Set Control Spae- and Time-Effiient BDD Constrution via Working Set Control Bwolen Yang Yirng-An Chen Randal E. Bryant David R. O Hallaron Computer Siene Department Carnegie Mellon University Pittsburgh, PA 15213.

More information

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Ho Wireless Networks Giorgio Quer, Federio Librino, Lua Canzian, Leonardo Badia, Mihele Zorzi, University of California San Diego La

More information

Graph-Based vs Depth-Based Data Representation for Multiview Images

Graph-Based vs Depth-Based Data Representation for Multiview Images Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:

More information

Time delay estimation of reverberant meeting speech: on the use of multichannel linear prediction

Time delay estimation of reverberant meeting speech: on the use of multichannel linear prediction University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel

More information

Optimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints

Optimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints 5 JOURNAL OF SOFTWARE VOL. 8 NO. 8 AUGUST Optimization of Two-Stage Cylindrial Gear Reduer with Adaptive Boundary Constraints Xueyi Li College of Mehanial and Eletroni Engineering Shandong University of

More information

A Hybrid Neuro-Genetic Approach to Short-Term Traffic Volume Prediction

A Hybrid Neuro-Genetic Approach to Short-Term Traffic Volume Prediction A Hybrid Neuro-Geneti Approah to Short-Term Traffi Volume Predition 1. Introdution Shahriar Afandizadeh 1,*, Jalil Kianfar 2 Reeived: January 2003, Revised: July 2008, Aepted: January 2009 Abstrat: This

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Improvement of low illumination image enhancement algorithm based on physical mode

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Improvement of low illumination image enhancement algorithm based on physical mode [Type text] [Type text] [Type text] ISSN : 0974-7435 Volume 10 Issue 22 BioTehnology 2014 An Indian Journal FULL PAPER BTAIJ, 10(22), 2014 [13995-14001] Improvement of low illumination image enhanement

More information

BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS

BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS Proeedings of ASME 0 International Mehanial Engineering Congress & Exposition IMECE0 November 5-, 0, San Diego, CA IMECE0-6657 BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS

More information

Video Data and Sonar Data: Real World Data Fusion Example

Video Data and Sonar Data: Real World Data Fusion Example 14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu

More information

Implementing Load-Balanced Switches With Fat-Tree Networks

Implementing Load-Balanced Switches With Fat-Tree Networks Implementing Load-Balaned Swithes With Fat-Tree Networks Hung-Shih Chueh, Ching-Min Lien, Cheng-Shang Chang, Jay Cheng, and Duan-Shin Lee Department of Eletrial Engineering & Institute of Communiations

More information

We don t need no generation - a practical approach to sliding window RLNC

We don t need no generation - a practical approach to sliding window RLNC We don t need no generation - a pratial approah to sliding window RLNC Simon Wunderlih, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek Deutshe Telekom Chair of Communiation Networks, TU Dresden, Dresden,

More information

Direct-Mapped Caches

Direct-Mapped Caches A Case for Diret-Mapped Cahes Mark D. Hill University of Wisonsin ahe is a small, fast buffer in whih a system keeps those parts, of the ontents of a larger, slower memory that are likely to be used soon.

More information

CleanUp: Improving Quadrilateral Finite Element Meshes

CleanUp: Improving Quadrilateral Finite Element Meshes CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)

More information

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0; Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;

More information