A new inverse halftoning algorithm based on reversible data hiding techniques for halftone images is proposed in this paper. The proposed scheme has the advantages of two commonly used methods, the lookup table (LUT) and Gaussian filtering methods. We embed a part of important LUT templates into a halftone image and restore the lossless image after these templates have been extracted. Then a hy...

PURPOSE Oxidative stress has been proposed as a major pathogenic factor in age-related macular degeneration (AMD), the leading cause of vision loss among elderly people of western European ancestry. Lutein (LUT) and zeaxanthin (ZEA), major components in macular pigment, are among the retinal antioxidants. Though xanthophyll intake may reduce the likelihood of having advanced AMD, direct evidenc...

Distributed arithmetic (DA)-based computation is well known for efficient memory-based implementation of Finite impulse response (FIR) filter where the filter outputs are computed as inner-product of input-sample vectors and filter-coefficient vector. In this paper, we show that the LUT multiplier based approach in which the memory elements store all the possible values of product of filter co-...

The antisymmetric product coding techniques for lookup-table design for memory-based multipliers used in digital circuits. By using this techniques it results in reduction of the LUT. We present a different form of APC for efficient optimization of memory based applications. The proposed combined approach provides a reduction in size compared to the conventional LUT. It is shown that the propos...

The ability to efficiently match completelyspecified logic functions to structures of K-input look-up tables (K-LUTs) is a central problem in FPGA resynthesis algorithms. We address the problem of matching completely-specified logic functions of 9 to 12 inputs in K-LUT structures. Our method is based on the off-line generation of libraries of LUT structures. During resynthesis, matching is perf...

A number of scientific applications are performance-limited by expressions that repeatedly call costly elementary functions. Lookup table (LUT) optimization accelerates the evaluation of such functions by reusing previously computed results. LUT methods can speed up applications that tolerate an approximation of function results, thereby achieving a high level of fuzzy reuse. One problem with L...

Scientific programmers can speed up function evaluation by precomputing and storing function results in lookup table (LUTs), thereby replacing costly evaluation code with an inexpensive memory access. A code transform that replaces computation with LUT code can improve performance, however, accuracy is reduced because of error inherent in reconstructing values from LUT data. LUT transforms are ...

OBJECTIVE Flavonoids are an important group of recognized antioxidants in plants. Luteolin (LUT) is a natural flavonoid in the plant kingdom. This study was aimed to investigate the effects of the LUT in the liver, kidney and brain of pentylentetrazol (PTZ)-induced seizure and the relationship between nitric oxide synthases (iNOS, eNOS) and matrix metalloproteinases (MMP2, MMP9). MATERIALS AN...

In this paper, we focus on the Look-up Table (LUT) technique for the compensation of HPA nonlinear distortion. An improved LUT method is proposed with better performance compared with conventional LUT technique in terms of convergence speeds, BER and total degradation (TD). It can get over 8 dB gain in out-of-band spectrum re-growth suppression and about 0.3 dB BER performance gain than convent...

Practically, any digital system includes sequential blocks. This article is devoted to a case when blocks are represented by models of Mealy finite state machines (FSMs). The performance (maximum operating frequency) one the most important characteristics an FSM circuit. In this article, method proposed which aims at increasing frequency LUT-based FSMs with twofold assignment. done using only e...