Test power and test time have been the major issues for current scenario of VLSI testing. The test data compression is the well known method used to reduce the test time. The don’t care bit filling method can be used for effective test data compression as well as reduction in scan power. In this paper we describe the algorithm for don’t care assignment like MT(Minimum Transition)-fill technique...

Low density parity checking codes (LDPC) are one of the most important issues in coding theory at present. LDPC-code a type linear-block LDPC-codes. Channel might be considered as finest conversant and potent components cellular communications systems, that was employed for transmitting errors corrections imposed by noise, fading interfering. LDPC-codes advanced gain, i.e., new area coding. per...

New generations of non-volatile random access memories will combine the best features memory (access times, byte addressability) with storage (non-volatility, low costs per byte). Some, like PCM, have a limited endurance. All only consume energy when accessed, but writes use much more than reads. These characteristics put cost on flipping bits in memory. Bit-flip aware data structures lower num...

A modified spatially adaptive denoising algorithm for a single image corrupted by Gaussian noise is proposed in this paper. The proposed algorithm use local statistics of a selected window i.e. by defining local weighted mean, local weighted activity and local maximum. These local statistics are used to detect the noise in the image then a modified Gaussian filter is used for noise suppression....

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

In the previous section we saw how we could use LP duality theory to develop an algorithm for the weighted matching problem in bipartite graphs. In this section, we’ll see how to extend that algorithm to handle general graphs. As in the unweighted case, blossom-shrinking plays a central role. However, in weighted graphs we will handle blossoms a bit differently. In particular, we will maintain ...

Data security is one of the most vigorous fields of study in Informatics and Computer Forensic. Author right for intellectual stuff is a real challenge, particularly when information is processed and transmitted. One of the electronic methods of digital data is images. They are widely used in organizations, research institutions, and in environments where speedy, secured and minimized distortio...

In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arithmetic using an interleaved serial multiplication and reduction to calculate the product P=AB mod M. It can be shown that the maximum average reduction rate is theoretically limited to 3 bit/operation. In this paper we pr...