Free AccessBible Registerhttps://doi.org/10.14220/9783737013444.263SectionsPDF/EPUB ToolsAdd to favoritesDownload CitationsTrack Citations ShareShare onFacebookTwitterLinkedInRedditEmail About Previous chapter FiguresReferencesRelatedDetails Download book coverOsnabrücker Studien zur Jüdischen und Christlichen Bibel.Volume 8 1st editionISBN: 978-3-8471-1344-7 eISBN: 978-3-7370-1344-4HistoryPubl...

Efficient implementation of matrix algebra is important to the performance of many large and complex physical models. Among important tuning techniques is loop fusion which can reduce the amount of data moved between memory and the processor. We have developed the Build to Order (BTO) compiler to automate loop fusion for matrix algebra kernels. In this paper, we present BTO’s analytic memory mo...

The need to reduce the power consumption of the next generation of digital systems is clearly recognized at all levels of system design At the system level power management is a very powerful technique and delivers large and unambiguous savings The ideas behind power management can be extended to the logic level This would involve determining which parts of a circuit are computing results that ...

The main focus of this paper is to apply suitable combiner function for cryptographic use which possesses multiple cryptographic properties such as balanced, correlation immune and high algebraic degree. Resilient function which is the generalization of correlation immune Boolean function is thus considered. In this paper we presents RFSG, a new sequence generator which uses (q, m+1, m, 1) resi...

adequate coverage is one of the main problems for distributed wireless sensor networks and the effectiveness of that highly depends on the sensor deployment scheme. given a finite number of sensors, optimizing the sensor deployment will provide sufficient sensor coverage and save power of sensors for movement to target location to adequate coverage. in this paper, we apply fuzzy logic system to...

Several important compiler optimizations such as instruction scheduling and register allocation are fundamentally hard and are usually solved using heuristics or approximate solutions. In contrast, this thesis examines optimal solutions to three combinatorial problems in compiler optimization. The first problem addresses instruction scheduling for clustered architectures, popular in embedded sy...