Skip to search formSkip to main contentSkip to account menu

H tree

Known as: H-Fractal, H-tree, Mandelbrot tree 
In fractal geometry, the H tree is a fractal tree structure constructed from perpendicular line segments, each smaller by a factor of the square root… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Clock signalFractalFractal canopyGraph drawing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Vertex-transitive expansions of (1, 3)-trees
2010
2010
INVESTIGATIONS ON AN H-FRACTAL WIDEBAND MICROSTRIP FILTER WITH MULTI-PASSBANDS AND A TUNED NOTCH BAND
This paper investigates an H-fractal wideband microstrip fllter with multi-passbands and a tuned notch band for wireless… 
2008
2008
Parameter variations and crosstalk noise effects on high performance H-tree clock distribution networks
Controlling the delay and the transition time of the clock signal in the presence of various noise sources, process parameter… 
2008
2008
A Medium-Grain Reconfigurable Architecture for DSP: VLSI Design, Benchmark Mapping, and Performance
Reconfigurable hardware has become a well-accepted option for implementing digital signal processing (DSP). Traditional devices… 
2005
2005
Exponentially tapered H-tree clock distribution networks
Exponentially tapered interconnect can reduce the dynamic power dissipation of clock distribution networks. A criterion for… 
2005
2005
Effects of parameter variations and crosstalk on H-tree clock distribution networks
Controlling the delay and the transition time of the clock signal in the presence of various noise sources, process parameter… 
2004
2004
Chip-package Co-implementation of a triple DES Processor
This paper describes the design and implementation of a dedicated data encryption standard (DES) processor. The processor… 
1997
1997
A configurable type hierarchy index for OODB
Abstract. With respect to the specific requirements of advanced OODB applications, index data structures for type hierarchies in… 
Highly Cited
1992
Highly Cited
1992
H-trees: a dynamic associative search index for OODB
The support of the superclass-subclass concept in object-oriented databases (OODB) makes an instance of a subclass also an… 
Highly Cited
1987
Highly Cited
1987
Data Movement Techniques for the Pyramid Computer
The pyramid computer was initially proposed for performing high-speed low-level image processing. However, its regular geometry… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)