• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.2
• /
• pp.118-124
• /
• 2008

For forward error correction, DVB-S2, which is the digital video broadcasting forward error coding and modulation standard for satellite television, uses a system based the concatenation of BCH with LDPC inner coding. In DVB-S2 the LDPC codes are defined for 11 different code rates, which means that a DVB-S2 LDPC decoder should support multiple code rates. Seven of the 11 code rates, 3/5, 2/3, 3/4, 4/5, 5/6, 8/9, and 9/10, are regular and the rest four code rates, 1/4, 1/3, 2/5, and 1/2, are irregular. In this paper we propose a flexible decoder for the regular LDPC codes. We combined the partially parallel decoding architecture that has the advantages in the chip size, the memory efficiency, and the processing rate with Benes network to implement a DVB-S2 LDPC decoder that can support multiple code rates with a block size of 64,800 and can configure the interconnection between the variable nodes and the check nodes according to the parity-check matrix. The proposed decoder runs correctly at the frequency of 200MHz enabling 193.2Mbps decoding throughput. The area of the proposed decoder is $16.261m^2$ and the power dissipation is 198mW at a power supply voltage of 1.5V.

• The Journal of the Korea Contents Association
• /
• v.7 no.12
• /
• pp.262-272
• /
• 2007

SAD (Sum of Absolute Difference) algorithm is the most frequently executing routine in motion estimation, which is the most demanding process in motion picture encoding. To enhance the performance of motion picture encoding on a VLIW processor, an optimal implementation of SAD algorithm on VLIW processor should be accomplished. In this paper, we propose an implementation of optimal scheduling of SAD algorithm with conditional branch on a VLIW-based high performance DSP. We first transform the nested loop with conditional branch of SAD algorithm into a single loop with conditional branch which has a large enough loop body to utilize fully the ILP capability of VLIW DSP and has a conditional branch to make the escape from loop to be achieved as soon as possible. And then we apply a modulo scheduling technique to the transformed single loop. We test the proposed implementation on TMS320C6713, and analyze the code size and performance with respect to processing time. Through experiments, it is shown that the SAD implementation proposed in this paper has small code size appropriate for embedded applications, and the H.263 encoder with the proposed SAD implementation performs better than other H.263 encoder with other SAD implementations.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.4
• /
• pp.135-140
• /
• 2015

The WDSS improves defensive capacity against web application layer DDoS attack by using web cache server and L7 switch which are added on the DDoS shelter system. When web DDoS attack occurs, security agents divert traffic from backbone network to sub-network of the WDSS and then DDoS protection device and L7 switch block abnormal packets. In the meantime, web cache server responds only to requests of normal clients and maintains stable web service. In this way, the WDSS can counteract the web DDoS attack which generates small traffic and depletes server-client session resource. Furthermore, the WDSS does not require IP tunneling because it is not necessary to retransfer the normal requests to original web server. In this paper, we validate operation of the WDSS and verify defensive capability against web application layer DDoS attacks. In order to do this, we built the WDSS on backbone network of an ISP. And we performed web DDoS tests by using a testing system that consists of zombie PCs. The tests were performed by three types and various amounts of web DDoS attacks. Test results suggest that the WDSS can detect small traffic of the web DDoS attacks which do not have repeat flow whereas the formal DDoS shelter system cannot.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.3
• /
• pp.24-31
• /
• 2020

Centralized systems in computing environments have various problems, such as privacy infringement due to hacking, and the possibility of privacy violations in case of system failure. Blockchain, one of the core technologies for the next generation of converged information, is expected to be an alternative to the existing centralized system, which has had various problems. This paper proposes a blockchain-based user authentication system that can identify users using EID in an online environment. Existing identification (ID)/password (PW) authentication methods require users to store personal information in multiple sites, and receive and use their respective IDs. However, the proposed system can be used without users signing up at various sites after the issuing of an EID. The proposed system issues an EID with a minimum of information, such as an e-mail address and a telephone number. By comparing the stability and efficiency of a centralized system, the proposed integrated authentication system proved to be excellent. In order to compare stability against existing systems, we chose attack methods and encroachments on the computing environment. To verify efficiency, the total throughput between the user's app, the issuance and certification-authority's servers, and the service provider's servers was compared and analyzed based on processing time per transaction.

• The Journal of Engineering Geology
• /
• v.24 no.4
• /
• pp.525-534
• /
• 2014

Environmental problems typically occurring in abandoned mine lands (AML) include: contaminated and acidic surface water and groundwater; stockpiled waste rock and mill tailings; and ground subsidences due to mining operations. This study examines the effectiveness of various geophysical techniques for mapping potential hazard and contaminated zones. Four AML sites with sedimentation contamination problems, acid mine drainage (AMD) channels, ground subsidence, manmade liner leakage, and buried mine tailings, were selected to examine the applicability of various geophysical methods to the identification of the different types of mine hazards. Geophysical results were correlated to borehole data (core samples, well logs, tomographic profiles, etc.) and water sample data (pH, electrical conductivity (EC), and heavy metal contents). Zones of low electrical resistivity (ER) corresponded to areas contaminated by heavy metals, especially contamination by Cu, Pb, and Zn. The main pathways of AMD leachate were successfully mapped using ER methods (low anomaly peaks), self-potential (SP) curves (negative peaks), and ground penetrating radar (GPR) at shallow penetration depths. Mine cavities were well located based on composite interpretations of ER, seismic tomography, and well-log records; mine cavity locations were also observed in drill core data and using borehole image processing systems (BIPS). Damaged zones in buried manmade liners (used to block descending leachate) were precisely detected by ER mapping, and buried rock waste and tailings piles were characterized by low-velocity zones in seismic refraction data and high-resistivity zones in the ER data.

• Food Science of Animal Resources
• /
• v.32 no.5
• /
• pp.669-677
• /
• 2012

The objective of this study was to analyze the flavor pattern of different varieties of cheeses. Four of the each following cheese varieties such as shred type pizza cheese, Cheddar cheese, Mozzarella block cheese, and white mold-ripened cheeses, stored at $4^{\circ}C$ during 2 wks were examined before and after cooking at $70^{\circ}C$ and $160^{\circ}C$. Flavor patterns of these cheeses were analyzed using an electronic nose system based on mass spectrometer. All data were treated by multivariate data processing based on discriminant function analysis (DFA). The results showed the discriminant model by DFA method. Data revealed that flavor patterns of pizza cheeses were well separated as storage prolonged and obviously discriminated as the higher the cooking temperature. The result of pattern recognition analysis based on discriminant function analysis showed that new brand of pizza cheese produced by Imsil Cheese Cooperative was located at middle between the flavors of the imported brands of pizza cheese and those of domestic brand of pizza cheeses. Imsil cheese has a unique flavor pattern among other variety of cheeses. Application of pattern recognition analysis by electronic nose might be useful and advanced technology for characterizing in flavor pattern of cheese products from different origins and different categories of cheeses.

• Proceedings of the PSK Conference
• /
• 2001.10a
• /
• pp.109-113
• /
• 2001

Oxidized low-density lipoprotein (oxLDL) has been shown to modulate transactivations by the peroxisome proliferator activated receptor (PPAR)$\gamma$ and nuclear factor-kappa B (NF$\kappa$B). In this study, the oxLDL signaling pathways involved with the NF$\kappa$B transactivation were investigated by utilizing a reporter construct driven by three upstream NF$\kappa$B binding sites, and various pharmacological inhibitors. OxLDL and its constituent lysophophatidylcholine (lysoPC) induced a rapid and transient increase of intracellular calcium and stimulated the NF-KB transactivation in resting RAW264.7 macrophage cells in an oxidation-dependent manner. The NF$\kappa$B activation by oxLDL or lysoPC was inhibited by protein kinase C inhibitors or an intracellular calcium chelator. Tyrosine kinase or PI3 kinase inhibitors did not block the NF$\kappa$B transactivation. Furthermore, the oxLDL-induced NF$\kappa$B activity was abolished by the PPAR$\gamma$ ligands. When the endocytosis of oxLDL was blocked by cytochalasin B, the NF$\kappa$B transactivation by oxLDL was synergistically increased, while PPAR transactivation was blocked. These results suggest that oxLDL activates NF-$\kappa$B in resting macrophages via protein kinase C- and/or calcium-dependent pathways, which does not involve the endocytic processing of oxLDL. The endocytosis-dependent PPAR$\gamma$ activation by oxLDL may function as an inactivation route of the oxLDL induced NF$\kappa$B signal. Short heterodimer partner (SHP), specifically expressed in liver and a limited number of other tissues, is an unusual orphan nuclear receptor that lacks the conventional DNA-binding domain. In this work, we found that SHP expression is abundant in murine macrophage cell line RAW 264.7 but suppressed by oxLDL and its constituent I3-HODE, a ligand for peroxisome proliferator-activated receptor y. Furthermore, SHP acted as a transcription coactivator of nuclear factor-$\kappa$B (NF$\kappa$B) and was essential for the previously described NF$\kappa$B transactivation by lysoPC, one of the oxLDL constituents. Accordingly, NF$\kappa$B, transcriptionally active in the beginning, became progressively inert in oxLDL-treated RAW 264.7 cells, as oxLDL decreased the SHP expression. Thus, SHP appears to be an important modulatory component to regulate the transcriptional activities of NF$\kappa$B in oxLDL-treated, resting macrophage cells.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.20-29
• /
• 2014

Recently, LTE is preparing to make a new leap forward LTE-A all over the world. As LTE privides high speed service, the role of mobile phones seems to change from voice to data service. According to Cisco, global mobile data traffic will increase nearly 11-fold between 2013 and 2018. Mobile video traffic will reach 75% by 2018 from 66% in 2013 in Korea. However, voice service is still the most important role of mobile phones. Thus, controllability of throughput and low BLER is indispensable for high-quality VoIP service among various type of traffic. Although the maximum AMR-WB, 23.85 Kbps is sufficient to a VoIP call, it is difficult for the LTE which can provide tens to hundreds of MB/s may not keep the certain level VoIP QoS especially in the cell-edge area. This paper proposes a new scheduling algorithm in order to improve VoIP performance after analyzing various scheduling algorithms. The proposal is the technology which applies more priority processing for VoIP than other applications in cell-edge area based on two-tier scheduling algorithm. The simulation result shows the improvement of VoIP performance in the view point of throughput and BLER.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.1
• /
• pp.9-18
• /
• 2004

This paper presents an efficient image compression method for memory reduction in multimedia processor which can be simply implemented in hardware and provides high performance. The multimedia processor, which includes processing of high-resolution images and videos, requires large memories: they are external frame memories to store frames and internal line memories for implementing some linear filters. If we can reduce those memories by adopting a simple compression method in multimedia processor, it will strengthen its cost competitiveness. There exist many standards for efficiently compressing images and videos. However, those standards are too complex for our purpose and most of them are 2-D block-based methods, which do not support raster scanned input and output. In this paper, we propose a low-complexity compression method which has good performance, can be implemented with simple hardware logic, and supports raster scan. We have adopted 1${\times}$8 Hadamard transform for simple implementation in hardware and compression efficiency. After analyzing the coefficients, we applied an adaptive thresholding and quantization. We provide some simulation results to analyze its performance and compare with the existing methods. We also provide its hardware implementation results and discuss about cost reduction effects when applied in implementing a multimedia processor.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.2
• /
• pp.67-74
• /
• 2013

Approximate string matching problems have been studied in diverse fields. Recently, fast approximate string matching algorithms are being used to reduce the time and costs for the next generation sequencing. To measure the amounts of errors between two strings, we use a distance function such as the edit distance. Given two strings X(|X| = m) and Y(|Y| = n) over an alphabet ${\Sigma}$, the edit distance between X and Y is the minimum number of edit operations to convert X into Y. The edit distance between X and Y can be computed using the well-known dynamic programming technique in O(mn) time and space. The edit distance also can be computed using the Four-Russians' algorithm whose preprocessing step runs in $O((3{\mid}{\Sigma}{\mid})^{2t}t^2)$ time and $O((3{\mid}{\Sigma}{\mid})^{2t}t)$ space and the computation step runs in O(mn/t) time and O(mn) space where t represents the size of the block. In this paper, we present a parallelized version of the computation step of the Four-Russians' algorithm. Our algorithm computes the edit distance between X and Y in O(m+n) time using m/t threads. Then we implemented both the sequential version and our parallelized version of the Four-Russians' algorithm using CUDA to compare the execution times. When t = 1 and t = 2, our algorithm runs about 10 times and 3 times faster than the sequential algorithm, respectively.