• Journal of Integrative Natural Science
• /
• v.2 no.4
• /
• pp.285-288
• /
• 2009

A synthetic route for 12 metal thiocarboxylate complex, $Cd(SOCCH_3)_2Lut_2$ [Lut = 3,5-dimethylpyridine (lutidine)], were investigated for their potential to act as precursors for the formation of cadmium sulfide nanoparticles. $Cd(SOCCH_3)_2Lut_2$ were characterized by 1H-NMR spectroscopy. Thermal decomposition of $Cd(SOCCH_3)_2Lut_2$ is expected to undergo thiocarboxylic anhydride elimination to give stoichiometric cadmium sulfide nanoparticles and removes the organic supporting ligands cleanly. Prepared cadmium sulfide nanoparticles were characterized by fluorescence and UV-vis absorption spectroscopy and displayed an emission band at 500 nm with an excitation wavelength of 360 nm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.10
• /
• pp.859-869
• /
• 2012

In this paper, a new method to efficiently generate the 3-D(three-dimensional) video holograms for 3-D moving scenes, which is called here the TSR-N-LUT method, is proposed by the combined use of temporal-spatial redundancy(TSR) of 3-D video images and novel look-up table(N-LUT) technique. That is, in the proposed scheme, with the differential pulse code modulation (DPCM) algorithm, temporally redundancy redundant data in the inter-frame of a 3-D video images are removed between the frames, and then inter-line redundant data in the inter-frame of 3-D video images are also removed by using the DPCM method between the lines. Experimental results show that the proposed method could reduced the number of calculated object points and the calculation time of one object point by 23.72% and 19.55%, respectively on the average compared to the conventional method. Good experimental results with 3-D test moving pictures finally confirmed the feasibility of the proposed method to the fast generation of CGH patterns of the 3-D video images.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.10
• /
• pp.73-81
• /
• 2000

This paper presents the design and simulation of a power and area efficient interpolation FIR filter with partitioned look up table (LUT) structure. Using the symmetry of the filters coefficients and the contents of the LUT, the area of the proposed filter is minimized. The two filters share the partitioned LUT and activate the LUT selectively to realize the low power operation. The proposed filter has been designed in a 5.0 Volts 0.6${\mu}m$ CMOS technology. Power consumption results have been obtained from Powermill simulations. Experimental results suggest that the proposed filter reduces both the power consumption by 28% and simultaneously the gate area by 5% simultaneously compared to the previously proposed filters.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.605-608
• /
• 2001

This paper proposes LUT based predistorter using interpolater to reduce nonlinear distortion which was generated by HPA. We minimized performance degradation from the reduced LUT size with linear interpolation. We updated LUT using LMS algorithm using input data as reference data. As a result, it is shown that when the size of the LUT is 8, linear interpolation is the most outstanding performance in the view of performance and H/W complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.9-18
• /
• 2005

This paper proposes the color decomposition method for multi-primary display (MPD) using a 3-dimensional look-up-table (3D-LUT) in a linearized LAB space. The proposed method decomposes conventional three-primary colors into the multi-primary control values of a display device under constraints of tristimulus match. To reproduce images on the MPD, the color signals should be estimated from a device-independent color space, such as CIEXYZ and CIELAB. In this paper, the linearized LAB space is used due to its linearity and additivity in color conversion. The proposed method constructs the 3-D LUT, which contain gamut boundary information to calculate color signals of the MPD. For the image reproduction, standard RGB or CIEXYZ is transformed to the linearized LAB and then hue and chroma are computed to refer to the 3D-LUT. In the linearlized LAB space, the color signals of a gamut boundary point with the same lightness and hue of an input point are calculated. Also, color signals of a point on gray axis are calculated with the same lightness of an input. With gamut boundary points and input point, color signals of the input points are obtained with the chroma ratio divided by the chroma of the gamut boundary point. Specially, for the hue change, neighboring boundary points are employed. As a result the proposed method guarantees the continuity of color signals and computational efficiency, and requires less amount of memory.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2355-2364
• /
• 2012

Recently, the novel loop-up table(N-LUT) method to solve the tremendous memory problem of the conventional look-up table (LUT) method as well as to increase the generation speed of hologram patterns has been proposed. But, as the resolution of an input 3-D object is enhanced, the number of object points to be calculated for generation of its hologram pattern also increases, which results in a sharp increase of the computation time. Therefore, in this paper, a new approach for fast generation of the hologram pattern of 3-D object images is proposed by using the block redundancy feature of 3-D object images and the N-LUT method. Experimental results show that in the proposed method the number of object points and the overall computation time have been reduced by 43.3 % and 47.9 %, respectively compared to those of the conventional method for the case of the $5{\times}5$ block size. These good experimental results finally confirm the feasibility of the proposed method.

• Proceedings of the KIPE Conference
• /
• 2014.07a
• /
• pp.126-127
• /
• 2014

기존 IPMSM (Interior Permanent Magnet Synchronous Motor) 제어를 위한 LUT (Look Up Table)방식은 입력한 일정 간격의 데이터를 이용한 선형 보간 방법이 주로 사용되었다. 하지만, 이러한 방식은 LUT 구성을 위해 많은 데이터를 요구하므로, DSP 메모리 용량에 LUT 구성의 한계가 존재한다. 또한, 많은 양의 데이터를 관리해야하는 단점을 가지고 있다. 본 논문에서는 이러한 단점을 보완하기 위하여 영역 분할을 이용한 다항식 곡면 적합 LUT 구성을 제안하였다. 다항식 곡면 적합을 이용한 LUT 구성 방법은, 관리해야하는 데이터양을 비약적으로 줄일 수 있는 장점을 가지고 있다. 제안한 방법의 효용성은 실험을 통하여 증명하였다.

• BMB Reports
• /
• v.46 no.12
• /
• pp.611-616
• /
• 2013

Luteolin-7-O-glucoside (LUT7G), a flavone subclass of flavonoids, has been found to increase anti-oxidant and anti-inflammatory activity, as well as cytotoxic effects. However, the mechanism of how LUT7G induces apoptosis and regulates cell cycles remains poorly understood. In this study, we examined the effects of LUT7G on the growth inhibition of tumors, cell cycle arrest, induction of ROS generation, and the involved signaling pathway in human hepatocarcinoma HepG2 cells. The proliferation of HepG2 cells was decreased by LUT7G in a dose-dependent manner. The growth inhibition was due primarily to the G2/M phase arrest and ROS generation. Moreover, the phosphorylation of JNK was increased by LUT7G. These results suggest that the anti-proliferative effect of LUT7G on HepG2 is associated with G2/M phase cell cycle arrest by JNK activation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.422-430
• /
• 2002

For a time-multiplexed FPGA, a circuit is partitioned into several subcircuits, so that they temporally share the same physical FPGA device by hardware reconfiguration. In these architectures, all the hardware reconfiguration information called contexts are generated and downloaded into the chip, and then the pre-scheduled context switches occur properly and timely. Since the maximum number of the LUT's required in the same time determines the size of the chip used in the synthesis, it needs to be minimized, if possible. Many previous work use their own approaches, which are very similar to either scheduling method in high level synthesis or multi-way circuit partitioning method, to solve the problem. In this paper, we propose a method which estimates the lower bound on the number of LUT's without performing any actual synthesis. The estimated lower bounds help to evaluate the results of the previous work. If the estimated lower bound on the number of LUT's exactly matches the number of LUT's of the result from the previous work, the result must be optimal. In contrast, if they do not match, the following two cases are expected : the more exact lower bound may exist, or we might find the new synthesis result better than the result from the previous work. Experimental results show that our lower bound estimation method is very accurate. In almost al] cases experimented, the estimated lower bounds on the number of LUT's exactly match those of the previous synthesis results respectively, implying that the best results from the previous work are optimal as well as our method predicted the exact lower bound for those examples.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6A
• /
• pp.551-557
• /
• 2011

We investigate lattice-reduction-aided precoding techniques using Look-Up table (LUT) for multi-user multiple-input multiple-output(MIMO) systems. Lattice-reduction-aided vector perturbation (VP) gives large sum capacity with low encoding complexity. Nevertheless lattice-reduction process based on the LLL-Algorithm still requires high computational complexity since it involves several iterations of size reduction and column vector exchange. In this paper, we apply the LUT-aided lattice reduction on VP and propose a scheme to generate the LUT efficiently. Simulation results show that a proposed scheme has similar orthogonality defect and Bit-Error-Rate(BER) even with lower memory size.