An arrays of O's and l's has the u v horizontal window property if every nonzero view is seen once when a u v window is moved horizontally across the array. We study the problem of constructing an array which, for a given m, has the u x v horizontal window property for all factorizations rn uv. Using maximal linear shift register sequences for the rows we are able to construct such arrays of si...

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 ...

In this correspondence we determine the linear complexity of all Legendre sequences and the (monic) feedback polynomial of the shortest linear feedback shift register that generates such a Legendre sequence. The result of this correspondence shows that Legendre sequences are quite good from the linear complexity viewpoint.