• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.805-807
• /
• 2004

본 논문에서는 기존 MRMC와 다중후보와 인접블록을 이용한 시공간적 방법을 사용하여 MRMCS3와 MRMCS4를 구하여 나타내었다. 실험 결과 움직임 적은 영상에서는 4 레벨인 MRMCS4가 우수하고 움직임 큰 경우에는 3 레벨인 MRMCS3가 더 좋은 성능을 나타내었다. 제안한 다중해상도 방법이 기존방법에 비해 움직임이 적은 경우 PSNR에 있어서 0.01 - 0.35(㏈)정도 개선되었고, 또한 탐색 속도에 있어서도 10%정도 성능 향상을 나타내었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11A
• /
• pp.1027-1037
• /
• 2010

In this paper, we propose the linear interpolation-based BD (Block Diagonalization) precoding approximation algorithm for low complexity in downlink multiuser MIMO-OFDM (Multiple-input Multiple-output Orthogonal Frequency Division Multiplexing) systems. In the case of applying the general BD precoding algorithm to multiuser MIMO-OFDM systems, the computational complexity increases in proportional to the number of subcarriers. The proposed interpolation-based BD precoding approximation algorithm can be achieved similar SER performance with general BD algorithm and can decrease the computational complexity. It is proved that proposed algorithm can achieve the significantly decreased computational complexity by computer simulation.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.11
• /
• pp.30-36
• /
• 2010

In recent memories, repair is an unavoidable method to maintain its yield and quality. Although many word oriented memories as well as embedded memories in system-on-chip (SOC) consists of multiple local memory blocks with a global spare architecture, most of previous studies on built-in redundancy analysis (BIRA) algorithms have focused on single memory block with a local spare architecture. In this paper, a new BIRA algorithm for multiple blocks with a global spare architecture is proposed. The proposed BIRA is basd on CRESTA which is able to achieve optimal repair rate with almost zero analysis time. In the proposed BIRA, all repair solutions for local memory blocks are analyzed by local analyzers which belong to each local memory block and then compared sequentially and judged whether each solution can meet the limitation of the global spare architecture or not. Experimental results show that the proposed BIRA achieves much faster analysis speed compared to previous BIRAs with an optimal repair rate.

• Journal of Internet of Things and Convergence
• /
• v.7 no.2
• /
• pp.7-12
• /
• 2021

Wisdom Contents are created with experiences and ideas of multiple authors, and consumed in Internet based Social Network Services that are not subjected to regional restrictions. Existing copyright management systems are designed for the protection of professional authors' rights, and effective in domestic area. On the contrary, the blockchain protocol is subjected to the service and the block is added by the consensus of participating nodes. If the data is stored to the blockchain, it cannot be modified or deleted. In this paper, we propose the blockchain based undeniable multi-signature scheme for the protection of multiple authorship on Wizdom Contents. The proposed scheme is consisted of co-authors' common public key generation, multi-signature generation and verification protocols. In the undeniable signature scheme, the signature cannot be verified without help of the signer. The proposed scheme is best suited to the contents purchase protocol. All co-authors cannot deny the fairness of the automated profit distribution through the verification of multiple authorship on Wizdom Contents.

• Journal of the Korean Institute of Gas
• /
• v.28 no.2
• /
• pp.38-46
• /
• 2024

The city gas pipeline network is characterized by being widely distributed and hierarchically connected in a complex manner over a wide area. In order to monitor the status of the widely distributed network pressures with high precision, Multi-block PCA(MBPCA) is recommended. However, while MBPCA has excellent performance in identifying faulty sensors as the number of sensors increases, the fault detection performance deteriorates, and also there is a problem that the model needs to be updated entirely even if minor changes occur. In this study, we developed fault detectability index and fault identificability index to determine the effectiveness of MBPCA application block by block. Based on these indices, we distinguished MBPCA and PCA blocks and developed a fault detection and diagnostic system for the city gas pipeline network of Haean Energy Co., Ltd., and were able to solve the problems that arise when there are many sensors.

• Journal of Broadcast Engineering
• /
• v.18 no.4
• /
• pp.515-524
• /
• 2013

In this paper, we propose a novel face authentication method based on LBP matching of individual major blocks in mobile environment. In order to construct individual major blocks from photos, we find the blocks that have the highest similarity and use different numbers of blocks depending on the probability distribution by applying threshold. And, we use multi-radius LBP histograms in the determination of individual major blocks to improve performance of generic LBP histogram based approach. By using the multi-radius LBP histograms in face authentication, we can successfully reduce the false acceptance rate compare to the previous methods. Also, we can see that the proposed method shows low error rate about 7.72% compare to the pervious method in spite of use small number of blocks about 44.59% only.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.21-30
• /
• 2009

Fusion flash memory such as OneNAND$^{TM}$ is popular as a ubiquitous storage device for embedded systems because it has advantages of NAND and NOR flash memory that it can support large capacity, fast read/write performance and XIP(eXecute-In-Place). Besides, OneNAND$^{TM}$ provides not only advantages of hybrid structure but also multi-block erase function that improves slow erase performance by erasing the multiple blocks simultaneously. But traditional NAND Flash Translation Layer may not fully support it because the garbage collection of traditional FTL only considers a few block as victim block and erases them. In this paper, we propose an Erase Group Flash Translation Layer for improving multi-block erase function. EGFTL uses a superblock scheme for enhancing garbage collection performance and invalid block management to erase multiple blocks simultaneously. Also, it uses clustered hash table to improve the address translation performance of the superblock scheme. The experimental results show that the garbage collection performance of EGFTL is 30% higher than those of traditional FTLs, and the address translation performance of EGFTL is 5% higher than that of Superblock scheme.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.6
• /
• pp.11-18
• /
• 2007

Multiple linear cryptanalysis has been researched as a method building up the linear attack strength. We indicate that the lastest linear attack algorithm using multiple approximations, which was proposed by Biryukov et al. is hardly applicable to block ciphers with highly nonlinear key schedule, and propose a new multiple linear attack algorithm. Simulation of the new attack algorithm with a small block cipher shows that theory for the new multiple linear cryptanalysis works well in practice.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.1
• /
• pp.13-24
• /
• 2009

CLEFIA is a 128-bit block cipher which is proposed by SONY corporation and ARIA is a 128-bit block cipher which is selected as a standard cryptographic primitive. In this paper, we introduce new multiple impossible differential cryptanalysis and apply it to CLEFIA using 9-round impossible differentials proposed in [7], and apply it to ARIA using 4-round impossible differentials proposed in [11]. Our cryptanalytic results on CLEFIA and ARIA are better than previous impossible differential attacks.

• Journal of Satellite, Information and Communications
• /
• v.9 no.2
• /
• pp.114-118
• /
• 2014

In this paper, we analyze the performance of a concatenated code with two different inner decoding schemes. One is the error-detecting inner decoding, and the other is the error-detecting-and-correcting inner decoding scheme. We compare the performances of the two decoding schemes for finite and infinite block length cases when the concatenated code is applied to slow frequency-hopping spread-spectrum multiple access (FH-SSMA) communication systems.