• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.88-94
• /
• 2009

We propose a scheme which reduce the computational complexity of the lattice reduction (LR) aided detector in MIMO system. The performance of the ML detection algorithm is good but the computational complexity grows exponentially with the number of antenna elements and constellation points. LR aided detector shows the same diversity with the ML scheme with relatively less complexity. But the LR scheme still requires many computations since it involves several iterations of size reduction and column vector exchange. We notice that the LR process depends not on the received signal but only on the channel matrix so we can apply LR process offline and store the results in Look-Up Table (LUT). In this paper we propose an algorithm to generate the LUT which require less memory requirement and we evaluate the performance and complexity of the proposed system. We show that the proposed system requires less computational complexity with similar detection performance compared with the conventional LR aided detector.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.244-253
• /
• 2000

Since no single routing-switching combination performs the best under various different types of applications, a flexible network is required to support a range of polices. This paper introduces an implementation of a look-up table routing engine offering flexible routing and switching polices without performance degradation unlike those based on microprocessors. By deciding contents of look-up tables, the engine can implement wormhole routing, virtual cut-through routing, and packet switching, as well as hybrid switching, under a variety of routing algorithms. Since the routing engine has a piplelined look-up table architecture, the routing delay is as small as one flit, and thus it can overlap multiple routing actions without performance degradation in comparison with hardwired routers dedicated to a specific policy. Because four pipeline stages do not induce a hazard, expensive forwarding logic is not required. The routing engine can accommodate four physical links with a time shared cut-through bus or single link with a cross-bar switch. It is implemented using Xilinx 4000 series FPGA.

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

A cost effective three-dimensional color gamut mapping architecture is described. The conventional three-dimensional reduced resolution look-up table is considered and the concept of three-dimensional reduced resolution difference look-up table is introduced for cost effective and real-time color gamut mapping. The overall architecture uses one-dimensional memory decomposition of three-dimensional gamut mapping look-up table, three-dimensional interpolation and simple addition operation for generating the final gamut mapped colors. The required computational cost is greatly reduced by look-up table resolution adjustment and further reduced by the gamut mapping rule modification. The proposed architecture greatly reduces the required memory size and hardware complexity compared to the conventional method and it is suitable for real-time applications. The proposed hardware is suitable for FPGA and ASIC implementation and could be applied to the real-time display quality enhancement purposes.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.198-207
• /
• 1996

Electro sensitive traffic system can't consider passenger car unit, so, it causes start up delay time and passenger waiting time. In this paper, it antecedently creates optimal traffic cycle of passenger car unit at the bottom traffic intersection. But, sometimes it can make mistakes due to changes in car weight, car speed, and control of feed-back data. Moreover, to prevent spillback, it can adapt control even though upper traffic intersection has a different saturation rate, road length, road slope and road width.

• Journal of Fashion Business
• /
• v.14 no.5
• /
• pp.66-77
• /
• 2010

This study aimed at examining the pattern and detailed formation of corset look which has established itself as a sort of fashion look as people began to wear underwear as part of outer garment. The study tried to present basic materials helpful for developing and creating the design and pattern of corset look. First, the collected corset look of each brand was copied and then developed. According to the result, corset look's representative silhouette turned out to be hourglass silhouette that tightened up the waist with an emphasis on expressing the beauty of the body. However, unlike corsets of the past, corsets today are being created with focus on the design rather than using lots of incision lines. Second, The bust girth of corset look items turned out to have little function to compress and deform the body like the corset of the past that was far smaller than the body. In addition, the corset style that used the lines of corset alone as motive turned out to have the larger waist girth. Third, the dismantling of collected corset look showed that the materials and formation features of corset look have become simple and that the simplification of corset look has made the items of corset look everyday clothes which can be worn practically and universally.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.11
• /
• pp.167-173
• /
• 2002

The look up table method conventionally applied to control the inner temperature and humidity of a laver drying machine has repeatedly occurred not only laver's damage but also inferior goods since the reaching time at the optimum state takes a long time. In this paper, a fuzzy control theory instead of the look up table was proposed to reduce the reaching time at the optimum state. The proposed method used six input variables and four output variables for the fuzzy control, and a triangle rule for a fuzzifier, The Mandani's min-max method was applied to a fuzzy inference. Also, the mean method of maximum was applied to a defuzzifier. The method applied to the fuzzy controller contributed to reduce the reaching time at the optimum state, and to minimize not only laver's damage but also inferior goods.

• Journal of Information Display
• /
• v.10 no.1
• /
• pp.6-15
• /
• 2009

In this paper, a new approach is proposed for the efficient generation of computer-generated holograms (CGHs) using the spatially redundant data on a 3D object and the novel look-up table (N-LUT) method. First, the pre-calculated N-point principle fringe patterns (PFPs) were calculated using the 1-point PFP of the N-LUT. Second, spatially redundant data on a 3D object were extracted and re-grouped into the N-point redundancy map using the run-length encoding (RLE) method. Then CGH patterns were generated using the spatial redundancy map and the N-LUT method. Finally, the generated hologram patterns were reconstructed. In this approach, the object points that were involved in the calculation of the CGH patterns were dramatically reduced, due to which the computational speed was increased. Some experiments with a test 3D object were carried out and the results were compared with those of conventional methods.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.5
• /
• pp.415-422
• /
• 2013

In this paper, we present Self-Checking look-up-table (LUT) based on Scalable Error Detection Coding (SEDC) scheme for use in fault-tolerant reconfigurable architectures. SEDC scheme has shorter latency than any other existing coding schemes for all unidirectional error detection and the LUT execution time remains unaffected with self-checking capabilities. SEDC scheme partitions the contents of LUT into combinations of 1-, 2-, 3- and 4-bit segments and generates corresponding check codes in parallel. We show that the proposed LUT with SEDC performs better than LUT with traditional Berger as well as Partitioned Berger Coding schemes. For 32-bit data, LUT with SEDC takes 39% less area and 6.6 times faster for self-checking than LUT with traditional Berger Coding scheme.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.18-21
• /
• 2007

Digital image watermarking is a technology used in copyrighting of digital images by embedding unremovable informations. In this paper, a pixel-domain look-up-table-based watermarking algorithm is presented. With this methodology, the watermark was embedded in the host image, but we did not observe any distortion at certain specific region of interest. This means the proposed method is preferred in case of satellite images. Then, the image manipulation tool which is called 'StirMark' will be used to perform many kinds of attacks such as rotation, scaling, filtering and compression on the watermarked image. Finally, the effectiveness of a watermarking technique in terms of 'robustness' and 'data integrity' criteria will be measured by calculating PSNR of watermark and watermarked image.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.12
• /
• pp.35-44
• /
• 1994

In this paper, we propose a new modification method of the look-up table in self-organizing fuzzy control using look-up table. This method has the property that look-up table is modified to have fast response property. Its principle is that the controller forces the trajectory to go into the fast respose region which the error change amount is larger than the error at initial time whenever the reference or disturbance change. Also we introduce the variable learning speed coefficient which is proportional to distance from switching curve. And to demonstrate the applicability of the proposed method, we had simulation study for some examples and esecuted pole balance experiments with inverted pendulum.