• Convergence Security Journal
• /
• v.15 no.4
• /
• pp.91-97
• /
• 2015

General companies consider saving the information after enciphering as law. However, if the actual information is saved as enciphered, the decoding process must be conducted when the information is searched or edited in the ser ver. Therefore, process delay time occurs and is less efficient. This kind of work gives burden to the server, so the companies or managers handling the server do not save the information after enciphering. In this paper, the Networ k constructs and realizes an efficient security data management system that ensures safety and haste in operating u sing the homomorphic encryption technology, which collects information and decides quickly, and enables editing the encryption without a decoding process. To ensure the security of the embodied system, the existing encryption algo rithm can be used. Search method to use the keyword search. Additionally, by using a trapdoor, the keyword is not expose and it is changed whenever it is searched, and the formation of the keyword does not get exposed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.149-157
• /
• 2006

Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations is increased in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using variance values of LLR in turbo decoder, the proposed algerian can largely reduce the average number of iterations without BER performance degradation in all SNR regions. As a result of simulation, the average number of iterations in the upper SNR region is reduced by about $34.66%{\sim}41.33%$ compared to method using variance values of extrinsic information. the average number of iterations in the lower SNR region is reduced by about $13.93%{\sim}14.45%$ compared to CE algorithm and about $13.23%{\sim}14.26%$ compared to SDR algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.143-149
• /
• 2006

Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations is increased in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using sign changed ratio of extrinsic information values in turbo decoder, the proposed algorithm can largely reduce the average number of iterations without BER performance degradation. As a result of simulations, the average number of iterations is reduced by about $12.48%{\sim}22.22%$ compared to CE algorithm and about $20.43%{\sim}54.02%$ compared to SDR algorithm.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.1069-1072
• /
• 2011

This paper proposes the method which reduces complexity and improves coding efficiency by solving a problem of HEVC bi-prediction. In current HM 3.0, it is frequently occurred that L0 motion information and L1 motion information are identical in blocks which are bi-predicted. In this case, L1 motion vector is replaced by non-zero motion vector which belongs to first available neighbor block of current block. If they are still identical, prediction mode is replaced by uni-prediction. As an experimental result, in LD(Low-Delay) case, decoding time is reduced roughly 2%~5% and coding gain is roughly 0.3%~0.5% compared with the HM 3.0 anchor.

• Journal of Digital Contents Society
• /
• v.16 no.5
• /
• pp.775-781
• /
• 2015

EBS started 2HD MMS experimental broadcasting for the first time in Korea on Feb. 11, 2015. It uses the picture compression technique based on MPEG-2 CODEC, and applies the result of the experiment about variable bit rates and changes according to the scanning types, 1080i and 720p. But when changing channels, the delay in displaying picture occurs because of the operation of the variable GOP on MMS broadcasting, which optimizes image quality by application variable bit rates. In this study, verified the relationship between the decoding time of I frames and the GOP set in the encoding step by experimenting and analyzing ON-AIR TS. By using the verification data and adjusts the Encoder GOP parameters, improved the different video display time delays according to the scanning mode 1080i and 720p.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.122-128
• /
• 2012

Because of the system delay caused by the number of feedback retransmission in Distributed Video Coding (DVC) scheme, it is difficult to realize practical DVC in many cases. In this paper low feedback retransmission Distributed Source Coding (DSC) scheme is proposed for practical DVC scheme based on Low-Density Parity-Check (LDPC) codes because DVC system is an specific application of DSC system. This DSC scheme is achieved by using different LDPC codes optimized in each different compression rate and using source revealing scheme. Optimized LDPC codes provide us much better decoding performance which causes the 57% reduced number of iteration. Consequently, the number of feedback retransmission is decreased by 50%.

• Journal of the Korea Convergence Society
• /
• v.13 no.3
• /
• pp.43-54
• /
• 2022

Simultaneous translation is online decoding to translates with only subsentence. The goal of simultaneous translation research is to improve translation performance against delay. For this reason, most studies find trade-off performance between delays. We studied the experiments of the fixed policy-based simultaneous translation in Korean. Our experiments suggest that Korean tokenization causes many fragments, resulting in delay compared to other languages. We suggest follow-up studies such as n-gram tokenization to solve the problems.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.9
• /
• pp.57-64
• /
• 2004

In this paper, we propose a RZ/HRZ mixture data transmission method for the asynchronous circuit design to reduce Power consumption. The dual-rail data with Rf decoding scheme is used to design asynchronous circuit, and it is easy to get a completion signal of the data validity from the native data as contrasted with sin91e-rail. However, the dual-rail scheme suffers from large chip area and increasing of Power consumption from all signals by the switching of the return-to-zero. We need to diminish number of circuit switching. The proposed RZ/HRZ data transmission reduces a switching activity to about 50% and it shows 23% lower power consumption than the conventional dual-rail coding with RZ's.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9C
• /
• pp.877-886
• /
• 2005

Various frame recovery algorithms have been suggested to overcome the communication quality degradation problem due to Internet-typical impairments on Voice over IP(VoIP) communications. In this paper, we propose a new receiver-based recovery method which is able to enhance recovered speech quality with almost free computational cost and without an additional increment of delay and bandwidth consumption. Most conventional recovery algorithms try to recover the lost or erroneous speech frames by reconstructing missing coefficients or speech signal during speech decoding process. Thus they eventually need to modify the decoder software. The proposed frame recovery algorithm tries to reconstruct the missing frame itself, and does not require the computational burden of modifying the decoder. In the proposed scheme, the Vector Quantization(VQ) codebook indices of the erased frame are directly estimated by referring the pre-computed VQ Codebook Index Interpolation Tables(VCIIT) using the VQ indices from the adjacent(previous and next) frames. We applied the proposed scheme to the ITU-T G.723.1 speech coder and found that it improved reconstructed speech quality and outperforms conventional G.723.1 loss recovery algorithm. Moreover, the suggested simple scheme can be easily applicable to practical VoIP systems because it requires a very small amount of additional computational cost and memory space.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9C
• /
• pp.843-850
• /
• 2003

Turbo coding and turbo processing have been known as methods close to Shannon limit in the aspect of wireless MIMO communications similarly to wireless single antenna communication. The iterative processing can maximize the mutual effect of coding and interference cancellation, but turbo coding has not been used for turbo processing because of the inherent decoding process delay. This paper proposes a turbo coded MIMO system with adaptive turbo parallel space-time (Turbo-PAST) processing for high-speed wireless communications and a enhanced cyclic redundancy check (E-CRC) scheme as an efficient and simple priori stopping criterion. Simulation results show that the Turbo-PAST outperforms conventional system with 1.3dB and the proposed E-CRC scheme effectively reduces the amount of turbo processing iterations from the point of average number of iterations.