• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.2
• /
• pp.333-340
• /
• 2018

This paper introduces a BCH code decoder using parallel CRC(: Cyclic Redundancy Check) generation. Using a conventional parallel syndrome generator with a LFSR(: Linear Feedback Shift Register), it takes up a lot of space for a short code. The proposed decoder uses the parallel CRC method that is widely used to compute the checksum. This scheme optimizes the a syndrome generator in the decoder by eliminating redundant xor operation compared with the parallel LFSR and thus minimizes chip area and propagation delay. In simulation results, the proposed decoder has accomplished propagation delay reduction of 2.01 ns as compared to the conventional scheme. The proposed decoder has been designed and synthesized in $0.35-{\mu}m$ CMOS process.

• Journal of Power Electronics
• /
• v.16 no.5
• /
• pp.1964-1980
• /
• 2016

This paper presents a new simplified harmonics extraction algorithm based on the synchronous reference frame (SRF) for an indirect current controlled (ICC) three-level neutral point diode clamped (NPC) inverter-based shunt active power filter (SAPF). The shunt APF is widely accepted as one of the most effective current harmonics mitigation tools due to its superior adaptability in dynamic state conditions. In its controller, the SRF algorithm which is derived based on the direct-quadrature (DQ) theory has played a significant role as a harmonics extraction algorithm due to its simple implementation features. However, it suffers from significant delays due to its dependency on a numerical filter and unnecessary computation workloads. Moreover, the algorithm is mostly implemented for the direct current controlled (DCC) based SAPF which operates based on a non-sinusoidal reference current. This degrades the mitigation performances since the DCC based operation does not possess exact information on the actual source current which suffers from switching ripples problems. Therefore, three major improvements are introduced which include the development of a mathematical based fundamental component identifier to replace the numerical filter, the removal of redundant features, and the generation of a sinusoidal reference current. The proposed algorithm is developed and evaluated in MATLAB / Simulink. A laboratory prototype utilizing a TMS320F28335 digital signal processor (DSP) is also implemented to validate effectiveness of the proposed algorithm. Both simulation and experimental results are presented. They show significant improvements in terms of total harmonic distortion (THD) and dynamic response when compared to a conventional SRF algorithm.

• Archives of Plastic Surgery
• /
• v.41 no.4
• /
• pp.398-402
• /
• 2014

Background Non-incisional blepharoplasty is a simple, less invasive method for creating a more natural-appearing double eyelid than classical incisional blepharoplasty. However, in aging patients, non-incisional blepharoplasty is not effective due to more severe blepharochalasis. Traditionally, incisional blepharoplasty is a common surgical method used for older patients, but blepharoplasty in elderly patients typically results in prolonged recovery times, and final blepharoplasty lines may be located in unintended or asymmetrical positions. Here, we introduce a new modified combination technique for geriatric blepharoplasty. Methods A total of ten patients were treated from July 2010 through July 2012 using the combination method. First, we performed non-incisional blepharoplasty using tarsodermal fixation. Then, incisional blepharoplasty with additional elliptical excision of the upper eyelid skin was performed. We removed pretarsal tissue, fat, the orbicularis oculi muscle, and orbital fat. Telephone surveys were administered to all patients for follow-up. The questionnaire was composed of eight questions that addressed recurrence and satisfaction with aesthetics and the procedure. Results A total of nine patients (90%) responded to the telephone survey. All cases of moderate to severe blepharochalasia were corrected and there were no major complications. Patients who underwent blepharoplasty had higher satisfaction scores. All patients were satisfied with the postoperative shapes of their eyelids. Conclusions The advantages of the proposed technique include: ease of obtaining a natural-looking fold with symmetry at the desired point; reproducible methods that require short operation times; fast postoperative recovery that results in a natural-appearing double-eyelid line; and high patient satisfaction.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.34 no.3
• /
• pp.81-86
• /
• 2006

This paper deals with a driving current fault monitor design methodology for a DDV actuation system which has a dual hydraulic power supply system, and triplex electric control capability. A fault existing among these redundant channels should be detected accurately and removed timely, and the remaining channels are to be reconfigured in order to compensate the role of a removed faulty channel. An integrated analysis on the aerodynamics, flight control laws, and DDV actuation system is essential for the design of an actuation system fault monitor. A method to define a fault transient boundary which specifies a maximum travel of an actuation system caused by the first faulty operation is proposed based on the top level requirement on the fault effect specified in MIL-F-8785C.

• Journal of the Korean association of regional geographers
• /
• v.3 no.2
• /
• pp.105-120
• /
• 1997

One of the most important issues of object-oriented geographical database system is to develop an indexing technique which enables more efficient I/O processing within aggregation hierarchy or inheritance hierarchy. Up to present, several indexing schemes have been developed for this purpose. However, they have separately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. A recent research is proposing a nested-inherited index which combines these two hierarchies simultaneously. However, this new index has some weak points. It has high storage costs related to its use of auxiliary index. Also, it cannot clearly represent the inheritance relationship among classes within its index structure. To solve these problems, this thesis proposes a pointer-chain index. Using pointer chain directory, this index composes a hierarchy-typed chain to show the hierarchical relationship among classes within inheritance hierarchy. By doing these, it could fetch the OID list of objects to be retrieved more easily than before. In addition, the pointer chain directory structure could accurately recognize target cases and subclasses and deal with "select-all" typed query without collection of schema semantic information. Also, it could avoid the redundant data storing, which usually happens in the process of using auxiliary index. This study evaluates the performance of pointer chain indexing technique by way of simulation method to compare nested-inherited index. According to this simulation, the pointer chain index is proved to be more efficient with regard to storage cost than nested-inherited index. Especially in terms of retrieval operation, it shows efficient performance to that of nested-inherited index.

• The Journal of Korea Robotics Society
• /
• v.12 no.4
• /
• pp.441-447
• /
• 2017

Robot arms are being increasingly used in various fields with special attention given to unmanned systems. In this research, we developed a high payload dual-arm robot, in which the forearm module is replaceable to meet the assigned task, such as object handling or lifting humans in a rescue operation. With each forearm module specialized for an assigned task (e.g. safety for rescue and redundant joints for object handling task), the robot can conduct various tasks more effectively than could be done previously. In this paper, the design of the high payload dual-arm robot with replaceable forearm function is described in detail. Two forearms are developed here. Each of forearm has quite a different goal. One of the forearms is specialized for human rescue in human familiar flat aspect and compliance parts. Other is for general heavy objects, more than 30 kg, handling with high degree of freedom more than 7.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4389-4411
• /
• 2018

High dynamic range (HDR) images are becoming pervasive due to capturing or rendering of a wider range of luminance, but their special display equipment is difficult to be popularized because of high cost and technological problem. Thus, HDR images must be adapted to the conventional display devices by applying tone mapping (TM) operation, which puts forward higher requirements for intellectual property protection of HDR images. As the robustness presents regional diversity in the low dynamic range (LDR) watermarked image after TM, which is different from the traditional watermarking technologies, a concept of watermarking activity is defined and used to distinguish the essential distinction of watermarking between LDR image and HDR image in this paper. Then, a novel robust HDR image watermarking algorithm is proposed against TM operations. Firstly, based on the hybrid processing of redundant discrete wavelet transform and singular value decomposition, the watermark is embedded by modifying the structure information of the HDR image. Distinguished from LDR image watermarking, the high embedding strength can cause more obvious distortion in the high brightness regions of HDR image than the low brightness regions. Thus, a perceptual brightness mask with low complexity is designed to improve the imperceptibility further. Experimental results show that the proposed algorithm is robust to the existing TM operations, with taking into account the imperceptibility and embedded capacity, which is superior to the current state-of-art HDR image watermarking algorithms.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.3
• /
• pp.9-19
• /
• 2011

Computing triangle-triangle intersections has been a fundamental task required for many 3D geometric problems. We propose a novel robust GPU algorithm to efficiently compute intersections in a large triangle set. The algorithm has three stages:k-d tree construction, triangle pair generation, and exact intersection computation. All three stages are executed on GPU except, for unsafe triangle pairs. Unsafe triangle pairs are robustly handled by CLP(controlled linear perturbation) on a CPU thread. They are identified by floating-point filtering while exact intersection is computed on GPU. Many triangles crossing a split plane are duplicated in k-d tree construction, which form a lot of redundant triangle pairs later. To eliminate them efficiently, we use a split index which can determine redundancy of a pair by a simple bitwise operation. We applied the proposed algorithm to computing 3D Minkowski sum boundaries to verify its efficiency and robustness.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.218-226
• /
• 2016

Coordination among users is an inevitable but time-consuming operation in wireless networks. It severely limit the system performance when the data rate is high. We present FC-MAC, a novel MAC protocol that can complete a contention within one contention slot over a joint frequency-code domain. When a node takes part in the contention, it generates randomly a contention vector (CV), which is a binary sequence of length equal to the number of available orthogonal frequency division multiplexing (OFDM) subcarriers. In FC-MAC, different user is assigned with a distinct signature (i.e., PN sequence). A node sends the signature at specific subcarriers and uses the sequence of the ON/OFF states of all subcarriers to indicate the chosen CV. Meanwhile, every node uses the redundant antennas to detect the CVs of other nodes. The node with the minimum CV becomes the winner. The experimental results show that, the collision probability of FC-MAC is as low as 0.05% when the network has 100 nodes. In comparison with IEEE 802.11, contention time is reduced by 50-80% and the throughput gain is up to 200%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.643-650
• /
• 2014

A hardware implementation of phase calculator for extracting 3D depth image from TOF(Time-Of-Flight) sensor is described. The designed phase calculator adopts redundant binary number systems and a pipelined architecture to improve throughput and speed. It performs arctangent operation using vectoring mode of DCORDIC(Differential COordinate Rotation DIgital Computer) algorithm. Fixed-point MATLAB simulations are carried out to determine the optimal bit-widths and number of iteration. The phase calculator has ben verified by FPGA-in-the-loop verification using MATLAB/Simulink. A test chip has been fabricated using a TSMC $0.18-{\mu}m$ CMOS process, and test results show that the chip functions correctly. It has 82,000 gates and the estimated throughput is 400 MS/s at 400Mhz@1.8V.