none

Microprocessors are used in a variety of systems ranging from high-performance super computers running scientific applications to battery powered cell phones performing realtime tasks. Due to the large disparity between processor clock speed and main memory access time, most modern processors include several caches, which consume more than half of the total chip area and power budget. As the performance gap between processors and memory has increased, the trend has been to increase the size of the on-chip caches. However, increasing the cache size also increases its access time and energy consumptions. This growing power dissipation problem is making traditional cooling and packaging techniques less effective thus requiring cache designers to focus more on architectural level energy efficiency than performance alone. The goal of this thesis is to propose a new cache architecture and to evaluate its efficiency in terms of miss rate, system performance, energy consumption, and area overhead. The proposed architecture employs the use of a few Ternary-CAM (TCAM) cells in the tag array to enable dynamic compression of tag entries containing contiguous values. By dynamically compressing tag entries, the number of entries in the tag array can be reduced by 2N, where N is the number of tag bits that can be compressed. The architecture described in this thesis is applicable to any cache structure that uses Content Addressable Memory (CAM) cells to store tag bits. To evaluate the effectiveness of the TCAM Enhanced Cache Architecture for a wide scope of applications, two case studies were performed ?? the L2 Data-TLB (DTLB) of a high-performance processor and the L1 instruction and data caches of a low-power embedded processor. Results indicate that a L2 DTLB implementing 3-bit tag compression can achieve 93% of the performance of a conventional L2 DTLB of the same size while reducing the on-chip energy consumption by 74% and the total area by 50%. Similarly, an embedded processor cache implementing 2-bit tag compression achieves 99% of the performance of a conventional cache while reducing the on-chip energy consumption by 33% and the total area by 10%.

In this dissertation, particle swarm optimization (PSO) is utilized for fractal image compression (FIC) and active contour model (ACM). The dissertation is divided into two parts. The first part is concerned with the FIC and the second part with ACM. FIC is promising both theoretically and practically for image compression. However, since the encoding speed of the traditional full search method is very time-consuming, FIC with full search is unsuitable for real-time applications. In this dissertation, several novel PSO-based approaches incorporating the edge property of the image blocks are proposed to speedup the encoder and preserve the image quality. Instead of the full search, a direction map is built according to the edge type of the image blocks, which directs the particles in the swarm to regions consisting of candidates of higher similarity. Therefore, the searching space is reduced and the speedup can be achieved. Also, since the strategy is performed according to the edge property, better visual effect can be preserved. Experimental results show that the visual-based particle swarm optimization speeds up the encoder 125 times faster with only 0.89 dB decay of image quality in comparison to the full search method. The second part of the dissertation is concerned with the active contour model for automatic object boundary identification. In the traditional methods for ACM, each control point searches its new position in a small nearby window. Consequently, the boundary concavities cannot be searched accurately. Some improvements have been made in the past to enlarge the searching space, yet they are still time-consuming. To overcome these drawbacks, a novel multi-population PSO technique is adopted in this dissertation to enhance the concavity searching capability and reduce the search time but in a larger searching window. In the proposed scheme, to each control point in the contour there is a corresponding swarm of particles with the best swarm particle as the new control point. The proposed optimizer not only inherits the spirit of the original PSO in each swarm but also shares information of the surrounding swarms. Experimental results demonstrate that the proposed method can improve the search of object concavities without extra computation time.

A synthesis methodology for multiple scan trees that considers output pin limitation, scan chain routing length, test application time and test data compression rate simultaneously is proposed in this thesis. Multiple scan trees, also known as a scan forest, greatly reduce test data volume and test application time in SOC testing. However, previous research on scan tree synthesis rarely considered issues such as routing length and output port limitation, and hence created scan trees with a large number of scan output ports and excessively long routing paths. The proposed algorithm provides a mechanism that effectively reduces test time and test data volume, and routing length under output port constraint. As a result, no output compressors are required, which significantly reduce the hardware overhead.

No description available.

<p>The exploitation of sandwich structures as a means toachieve high specific strength and stiffness is relatively new.Therefore, the knowledge of its damage tolerance is limitedcompared to other structural concepts such as truss bars andmonocoque plate solutions.</p><p>Several aspects of the damage tolerance of sandwichstructures are investigated. The influence of impact velocityonresidual strength is investigated. Sandwich panels withfaces of glass fiber reinforced vinylester are impacted bothwith very high velocity and quasi static. The residual strengthafter impact is found to be similar for both cases of impactvelocity.</p><p>Curved sandwich beams subjected to opening bending momentare studied. Faceñcore debonds of varying size areintroduced between the compressively loaded face sheet and thecore. Finite element analysis in combination with a pointstress criterion is utilized to predict the residual strengthof the beams. It is shown that it is possible to predict thefailure load of the beams with face-core debond.</p><p>Using fractography the governing mode of failure ofcompressively NCF-carbon is characterized. Sandwich panelssubjected to compression after impact are shown to fail byplastic micro buckling.</p><p>The residual compressive strength after impact of sandwichpanels is investigated. Sandwich panels with face sheets ofnon-crimp fabric (NCF) carbon are subjected to different typesof impact damages. Predictions of residual strength are madeusing the Budiansky, Soutis, Fleck (BSF) model. The residualstrength is tested, and the results are compared topredictions. Predictions and tests correlate well, and indicatethat the residual strength is dependent on damage size and notthe size of the damaged panel.</p><p>A study of the properties of a selection of fiberreinforcements commonly used in sandwich panels is conducted.The reinforcements are combined with two types of core materialand three types of matrix. Also the influence of laminatethickness is tested. Each combination materials is tested inuni-axial compression, compressive strength after impact andenergy absorption during quasi static indentation. Thespecimens which are tested for residual strength are eithersubjected to quasi-static or dynamic impact of comparableenergy level. Prediction of the residual strength is made andcorrelates reasonably whith the test results. The tests showthat if weight is taken into account the preferred choice offiber reinforcement is carbon.</p>

Thèse de doctorat--Signal et images--Paris--ENST, 2006. / Bibliogr. p. 215-221.

Thèse de doctorat : Génie Biologique et Médical : Villeurbanne, INSA : 1997. / Titre provenant de l'écran-titre. Bibliogr. p. 220-228.

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 184-197). Available also in a digital version from Dissertation Abstracts.

Thesis (Ph.D.)--University of Florida, 2005. / Title from title page of source document. Document formatted into pages; contains 101 pages. Includes vita. Includes bibliographical references.