Trade-offs in scan path and BIST implementations for RAMs

In this article we propose efficient scan path and BIST schemes for RAMs. Tools for automatic generation of these schemes have been implemented. They reduce the design effort and thus allow the designer to select the more appropriate scheme with respect to various constraints.     

Zero aliasing ROM BIST

Signature analyzers are very efficient output response compactors for BIST design. The only limitation of signature analysis is the fault coverage reduction (aliasing) due to the information loss inherent to any data compaction. In this article, in order to increase the effectiveness of ROM BIST, we take advantage from the simplicity of the error patterns generated by ROMs and we show that aliasing free signature analysis can be achieved in ROM BIST.This work was performed when the author was on leave from Minsk Radio Engineering Institute, Computer Department, Belorus.     

Linear periodically time-varying discrete-time systems: Aliasing and LTI approximations

Linear periodically time-varying (LPTV) systems are abundant in control and signal processing; examples include multirate sampled-data control systems and multirate filter-bank systems. In this paper, several ways are proposed to quantify aliasing effect in discrete-time LPTV systems; these are associated with optimal time-invariant approximations of LPTV systems using operator norms.     

A learning classifier system for mazes with aliasing clones

Maze problems represent a simplified virtual model of the real environment and can be used for developing core algorithms of many real-world application related to the problem of navigation. Learning Classifier Systems (LCS) are the most widely used class of algorithms for reinforcement learning in mazes. However, LCSs best achievements in maze problems are still mostly bounded to non-aliasing environments, while LCS complexity seems to obstruct a proper analysis of the reasons for failure. Moreover, there is a lack of knowledge of what makes a maze problem hard to solve by a learning agent. To overcome this restriction we try to improve our understanding of the nature and structure of maze environments. In this paper we describe a new LCS agent that has a simpler and more transparent performance mechanism. We use the structure of a predictive LCS model, strip out the evolutionary mechanism, simplify the reinforcement learning procedure and equip the agent with the ability to Associative Perception, adopted from psychology. We then assess the new LCS with Associative Perception on an extensive set of mazes and analyse the results to discover which features of the environments play the most significant role in the learning process. We identify a particularly hard feature for learning in mazes, aliasing clones, which arise when groups of aliasing cells occur in similar patterns in different parts of the maze. We discuss the impact of aliasing clones and other types of aliasing on learning algorithms.     

Comments on “Aliasing Properties of Circular MISRs”

The analysis of aliasing probability presented in a recent article, Aliasing Properties of Circular MISRs [1], is based on an error model that cannot adequately represent real circuits. We show why conclusions presented in [1] should not be used in practice, substantiating our claim with experimental results.This work was supported in part by grants from the Natural Sciences and Engineering Research Council of Canada and in part by the British Columbia Advanced Systems Institute     

Common coupling and pointer variables,with application to a Linux case study

Both common coupling and pointer variables can exert a deleterious effect on the quality of software. The situation is exacerbated when global variables are assigned to pointer variables, that is, when an alias to a global variable is created. When this occurs, the number of global variables increases, and it becomes considerably harder to compute quality metrics correctly. However, unless aliasing is taken into account, variables may incorrectly appear to be unreferenced (neither defined nor used), or to be used without being defined. These ideas are illustrated by means of a case study of common coupling in the Linux kernel.

二阶非均匀带通采样信号的快速恢复

本文讨论了实带通信号在二阶非均匀采样下的快速频域搬移、恢复,即用FFT方法将实带通信号恢复到两倍带宽(2B)内的复解析信号,而幅度和相位保持不变,最后经过简单的运算,得到原始频率。计算机模拟证实了上述方法。     

罗盘仪表绘制中高斯积分法反走样算法的研究

随着计算机及图形学技术的发展,座舱仪表对图形显示的质量提出了更高的要求,本文主要从图形走样产生的根本原因出发,提出利用高斯积分法来消除走样现象,且给出了较详细的数学推导,并将此算法应用于罗盘刻度线的生成,效果比较明显。     

Interprocedural optimization: Experimental results

The problem of tracking data flow across procedure boundaries has a long history of theoretical study by people who believed that such information would be useful for code optimization. Building upon previous work, an algorithm for interprocedural data flow analysis has been implemented. The algorithm produces three flow-insensitive summary sets: MOD, USE and ALIASES. The utility of the resulting information was investigated using an optimizing Pascal compiler. Over a sampling of 27 bench-marks, new optimizations performed as a result of interprocedural summary information contributed almost nothing to program execution speed. Finally, related optimization techniques of possibly greater potential are discussed.     

Aliasing probability transients

Test data reduction for digital systems is often accomplished through the use of a feedback shift register. This method, known as signature analysis, can exhibit error masking or aliasing. Recent analysis has shown that the use of a primitive polynomial for the register feedback can reduce the probability of aliasing. In this work we demonstrate that not all primitive polynomials are created equal. Some primitive polynomials can have very large transients in their aliasing probability. For example, 1 +X ¹³ +X ³³ can exhibit an aliasing probability more than a million times larger than its asymptotic value of 2^–33. An evaluation procedure is presented which can identify polynomials with good transient characteristics. Some recommended feedback polynomials are given.