• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.422-428
• /
• 2009

NAND flash memory is widely used in embedded systems because of many attractive features, such as small size, light weight, low power consumption and fast access speed. However, it requires garbage collection, which includes erase operations. Erase operation is slower than other operations. Further, a block has a limited erase lifetime (typically 100,000) after which a block becomes unusable. The proposed garbage collection policy focuses on minimizing the total number of erase operations, the deviation value of each block and the garbage collection time. NAND flash memory consists of pages of three types, such as valid pages, invalid pages and free pages. In order to achieve above goals, we use a page ratio to decide when to do garbage collection and to select the target victimblock. Additionally, we implement allocating method and group management method. Simulation results show that the proposed policy performs better than Greedy or CAT with the maximum rate 85% of reduction in the deviation value of the erase operations and 6% reduction in garbage collection time.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.4
• /
• pp.313-322
• /
• 2003

In this paper, the reverse link performance of imperfect power controlled cdma2000 cellular system that using array at a base station is analyzed, when MCGM beamforming algorithm and power control error is considered in shadowing. The blocking probability of the cdma2000 cellular system based on array parameters, E$\_$b//N$\_$0/ and interference statistics is calculated, and then the system capacity is calculated at a specific blocking probability. When the blocking probability is set 1 %, PCE(power control error) is 2 dB, M=2, 4, 8, 10, the capacity of cdma2000 is increased 2.3 ∼ 2.5 times higher than IS-95.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.73-78
• /
• 2005

Images coded by DCT based compression contain several quality degradations by quantization process. Among them contrast distortion is the important one because human eyes are sensitive to contrast. In case of low bit-rate coded image, we can not get an image having good quality due to quantization error. In this paper, we suggest a new scheme to enhance image's contrast in DCT domain. Proposed method enhances only edge regions. Homogeneous regions are not considered in this method. $8{\times}8$ DCT coefficient blocks are decomposed to $4{\times}4$ sub-blocks for detail edge region discrimination. we could apply this scheme to real-time application because proposed scheme is DCT based method.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.91-102
• /
• 2006

We analyze the performance of MAC-layer Reed-Solomon error recovery in the cdma2000 1xEV-DO Broadcast and Multicast Services (BCMCSs) environment, with respect to the size of the ECB (Error Control Block) and the air-channel condition, and establish the relationship between ECB size, error recovery capacity and service latency. From this we propose an adaptive error recovery scheme which adjusts the size of the ECB to reflect the environment of the mobile nodes so as to meet the required service quality (target bit error-rate), while reducing the latency of real-time applications. Extensive simulation results show the effectiveness of our approach compared to the current static scheme. Proposed adaptive schemes achieves near optimal solution with respect to service latency while satisfying the required service quality.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.1-14
• /
• 2002

The most important issue in providing multimedia traffic on a mobile computing environments is to guarantee the mobile host(client) with consistent QoS(Quality of Service). However, the QoS negotiated between the client and network in one cell may not be honored due to client mobility, causing hand-offs between cells. In this paper, a call admission control mechanism is proposed to provide consistent QoS guarantees for multimedia traffics in a mobile computing environment. Each cell can reserve fractional bandwidths for hand-off calls to its adjacent cells. It is important to determine the right amount of reserved bandwidth for hand-off calls because the blocking probability of new calls may increase if the amount of reserved bandwidth is more than necessary. An adaptive bandwidth reservation based on an MPP(Mobility Pattern Profile) and a 2-tier cell structure has been proposed to determine the amount of bandwidth to be reserved in the cell and to control dynamically its amount based on its network condition. We also propose a call admission control based on this bandwidth reservation and "next-cell prediction" scheme using an MPP. In order to evaluate the performance of our call admission control mechanism, we measure the metrics such as the blocking probability of our call admission control mechanism, we measure the metrics such as the blocking probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The simulation results show that the performance of our mechanism is superior to that of the existing mechanisms such as NR-CAT1, FR-CAT1, and AR-CAT1.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.263-271
• /
• 2002

In this paper, we propose a new smoothing method for removing moire patterns using analysis of halftone patterns interference. The proposed method can determine a strength of moire patterns by using gray values of pixels and the size of smoothing mask for moire region is adjusted adaptively according to the strength of moire patterns. Therefore it can remove moire patterns effectively and preserve meaningful high frequencies well, such as edges and textures. The proposed method only refer to predefined lookup table to determine the strength of moire patterns, so it is more efficient than a previous work based on FFT of subblock. It could be applied to field of various multimedia applications that deal with color prints.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.378-380
• /
• 2011

스테레오스코픽(stereoscopic) 3D 비디오 서비스는 기존 2D 와의 호환성을 유지하면서 새로운 3D 비디오 서비스를 제공할 수 있는 것으로, 전송 대역이 제한된 지상파 방송에서 높은 부호화 효율을 갖는 스테레오스코픽 비디오 코덱이 요구된다. 따라서 3D 를 위한 부가영상의 부호화를 위해 H.264/AVC 등을 고려하고 있으며, 또한 부가영상을 비실시간으로 전송하는 비실시간(Non-Real Time: NRT) 3D 서비스도 고려되고 있다. 본 논문에서는 NRT 3D 서비스를 위한 스테레오스코픽 비디오 부호화에 있어서, HEVC 에서 고려중인 적응루프필터(ALF: Adaptive Loop Filter)를 전/후처리 필터로 적용하는 기법을 제시한다. 특히, 부가영상의 후처리에 ALF 를 적용하기 위하여 부호화 과정에 결정되는 CU(Coding Unit) 구조를 이용하는 HEVC 와 달리 H.264/MVC 로 부호화한 부가영상의 매크로블록(MB) 부호화 모드를 이용한 ALF 적용 기법을 제안한다. 부가영상 부호화에 있어서 전처리 및 후처리 과정으로 ALF 를 적용함으로써 최대 약 20.5%의 부가영상의 부호화 성능 향상을 확인하였다.

• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.162-165
• /
• 2010

In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. In the proposed algorithm, we can reduces only unnecessary computations efficiently by taking different search patterns and error criteria of block matching according to distribution probability of motion vectors. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2/4 AVC standards.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5C
• /
• pp.497-502
• /
• 2006

In this paper, we propose a digital image encryption method using adaptive interleaving and multiple random shuffling table to improve the existing encryption methods which use a fixed random shuffling table. In order to withstand the plaintext attack, at first, we propose a interleaving method that is adaptive to the local feature of image. Secondly, using the proposed interleaving only shuffling method and multiple shuffling method that is combined interleaving with existing random shuffling method, we encrypted image by shuffled the DPCM processed $8^*8$ blocks. Experimental results show that, the proposed algorithm is very robust to plaintext attack and there is no overhead bit.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.6
• /
• pp.492-503
• /
• 2013

H.264/AVC has shown high coding efficiency by using various coding tools, including intra and inter prediction. However, there are still many more redundancy components in intra prediction than in inter prediction. In this paper, a novel intra prediction method is proposed with adaptive mode selection. The combined intra prediction modes and simplified gradient modes are added in order to refine the directional feature and gradation region. Suitable modes are selected according to the neighboring blocks that provide a high compression rate and lower computational complexity. The improvement of the proposed method is 1.96% in terms of the bitrate, 0.25 dB in PSNR, and 1.72 times in terms of the computational complexity.