• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2006.11a
• /
• pp.111-115
• /
• 2006

스케일러블 비디오 코딩(SVC, Scalable Video Coding)은 MPEG(Moving Picture Expert Group)과 VCEG (Video Coding Expert Group)의 JVT(Joint VIdeo Team)에 의해 현재 표준화 되고 있는 새로운 압축 표준 기술이며 시간, 공간 및 화질의 스케일러빌리티를 지원하기 위해 계층 구조를 가지고 있다. 특히 시간적 스케일러빌리티를 위해 계층적 B-픽처 구조를 채택하고 있다. 스케일러블 비디오 코딩의 기본 계층은 H.264|AVC와 호환적이므로, 모션 예측과 모드 결정과정에서 $16{\times}16,\;16{\times}8,\;8{\times}16,\;8{\times}8,\;8{\times}4,\;4{\times}8$ 그리고 $4{\times}4$와 같은 7개의 서로 다른 크기를 갖는 블록을 사용한다. 스케일러블 비디오 코딩에서 사용되고있는 계층적 B-픽처 구조는 키 픽처인 I와 P 픽처를 제외하고는 한 GOP (Group of Picture)내에서 모두 B-픽처를 사용하므로 H.264|AVC와 비교했을 때 연산량 증가와 함께 부호화 지연도 급격히 증가한다. B-픽처는 양방향 모션 벡터인 LIST0와 LIST1을 사용하고 양방향 모두에서 다중 참조 픽처를 사용하기 때문이다. 본 논문에서는 통계적 가선 검증을 이용하여 스케일러블 비디오 부호화에 적용 가능한 고속 프레임간 모드 결정 알고리듬 대해 소개한다. 제안된 방법은 $16{\times}16$ 매크로 블록과 $8{\times}8$ 서브 매크로 블록에 통계적 가설 감증 기법을 적용하여 실행되며, 현재 블록과 복원된 참조 블록간의 픽셀 값을 비교하여 RD(Rate Distortion) 최적화 기반 모드 결정을 빨리 완료함으로써 고속 프레임간 모드 결정을 가능하게 한다. 제안된 방법은 프레임 간 모드 결정을 고속화함으로써 스케일러블 비디오 부호화기의 연산량과 복잡도를 최대 57%감소시킨다. 그러나 연산량 감소에 따른 비트율의 증가나 화질의 열화는 최대 1.74% 비트율 증가 및 0.08dB PSNR 감소로 무시할 정도로 작다.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.398-408
• /
• 1994

It is true color that is allocated 1 byte to three basic colors, red, green, and blue in order to represent a pixel of an image. It is a merit that almost all colors are representable by using the true color. However, it requires a lot of storages. An efficient image compression method is necessary. Most of the existing compression methods have not considered the characteristics of the true color images. Therefore, the efficient compression has been almost impossible. The differences of each pixel and its adjacent pixels in the true color images are few. Only a few bits in 3 bytes data which represent a pixel have different values. But the different bits are scattered in 3 bytes, so efficient compression results are not achieved. Therefore, in the study it is shown that the similarities of data are increased by relocating the data structures of true color images. And an efficient compression strategy which uses the similarities of data is proposed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.9
• /
• pp.728-737
• /
• 2012

An analytical method for identifying terrestrial broadcasting coverages is proposed for a terrestrial broadcasting transmission system adopting a hierarchical modulation technique. Bit Error Rates(BERs) are derived for hierarchically modulated non-uniform QAM constellations based on the Q-function analysis in AWGN environments. The derived BERs depend on the hierarchical modulation factor ${\alpha}$(HMF) and could be mapped to the broadcasting coverages according to the link budget analysis based on the log-distance path loss model. Finally the broadcasting coverage ratios for high priority(HP) streams and low priority(LP) streams are calculated and presented for the determination of the HMF.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7A
• /
• pp.689-695
• /
• 2006

This paper focuses on the accurate performance evaluation of cooperative diversity technique with imperfect channel estimates. The channel environment for simulations and performance evaluation is supposed to be the slowly time-varying Rayleigh fading channel. The framework of the performance evaluation is based on the Moment Generating Function(MGF) approach. To apply the effect of this channel estimation error into the performance evaluation, we import an useful Gaussian approximation in formulating the effective noise component and the additive noise. The average BER performance of cooperative diversity with M-PSK and M-QAM is computed as a function of the ratio of the signal to the effective noise based on the approximation. The verification of computed performance is provided with simulations. The evaluated performance matches up to simulation results even in a low SNR region.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.293-298
• /
• 2006

Many data are stored in database. For getting any information from many data, we use the query sentences. These information is basic and simple. Data mining method is various. In this paper, we manage clustering and association rules. We present a method for finding the better association rules, and we solve a problem of the existing association rules. We propose and apply a new clustering method to fit for association rules. It is not clustering of the existing distance basis or category basis. If we find association rules of each clusters, we can get not only existing rules found in all transaction but also rules that will be characteristics of clusters. Through this study, we can expect that we will reduce the number of many transaction access in large databases and find association of small group.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3138-3147
• /
• 2000

EC(Electronic Commerce) which is cone the virtual space through Internet, has the advantage of time and space. On the contrary, it also has weak point like security probelm because anybody can easily access to the system due to open network attribute of Internet. Theretore, we need the solutions that protect the EC security problem for safe and useful EC activity. One of these solution is the implemonlation of a strong cipher algorithm. YK2(YoungKu Kang) cipher algorithm proposed in this paper is advantage for the EC security and it overcomes the limit of the current 6/1 bits block cipher algorithm using 128 bits key length for input, output, encryption key and 32 rounds. Moreover, it is degigned for the increase of time complexity and probability calculation by adapting more complex design for key scheduling regarded as one of the important element effected to enciyption.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.11
• /
• pp.1976-1979
• /
• 2008

Studies on binary adder have been variously developed. According to those studies of critical worst delay and mean delay time of asynchronous binary adders, carry select adders (CSA) based on hybrid structure showed 17% better performance than ripple carry adders (RCA) in 32 bit asynchronous processors, and 23% better than in 64 bit microprocessor implemented. In the complicated signal processing systems such as RSA, it is essential to optimize the performance of binary adders which play fundamental roles. The researches which have been studied so far were subject mostly to addition algorithms or adder structures. In this study, we analyzed and designed adders in an asp;ect of synthesis method. We divided the ways of implementing adders into groups, each of which was synthesized with different synthesis options. Also, we analyzed the variously implemented adders to evaluate the performance and area so that we can propose a different approach of designing optimal binary adders.

• Journal of Broadcast Engineering
• /
• v.17 no.4
• /
• pp.640-658
• /
• 2012

One of the existing terrestrial multi-channel DTV service frameworks, called KoreaView, provides four programs, composed of MPEG-2 based one HD video and H.264/AVC based three SD videos within one single 6MHz frequency bandwidth. However the additional 3 SD videos can not provide enough quality due to its reduced spatial resolution and low target bitrates. In this paper, we propose a framework, which is called a terrestrial multi-channel high quality hybrid DTV service, to overcome such a weakness of KoreaView services. In the proposed framework, the three additional SD videos are encoded based on an H.264/SVC Spatial Base layer, which is compliant with H.264/AVC, and are delivered via broadcasting networks. On the other hand, and the corresponding three additional HD videos are encoded based on an H.264/SVC Spatial Enhancement layer, which are transmitted over broadband networks such as Internet, thus allowing the three additional videos for users with better quality of experience. In order to verify the effectiveness of the proposed framework, various experimental results are provided for real video contents being used for DTV services. First, the experimental results show that, when the SD sequences are encoded by the H.264/SVC Spatial Base layer at a target bitrate of 1.5Mbps, the resulting PSNR values are ranged from 34.5dB to 42.9dB, which is a sufficient level of service quality. Also it is noted that 690kbps-8,200kbps are needed for the HD test sequences when they are encoded in the H.264/SVC Spatial Enhancement layer at similar PSNR values for the same HD sequences encoded by MPEG-2 at a target bitrate of 12 Mbps.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.4
• /
• pp.160-167
• /
• 2005

Among finite filed arithmetic operations, division/inverse is known as a basic operation for public-key cryptosystems over $GF(2^{m})$ and it is computed by performing the repetitive $AB^{2}$ multiplication. This paper presents a digit-serial-in-serial-out systolic architecture for performing the $AB^2$ operation in GF$(2^{m})$. To obtain L×L digit-serial-in-serial-out architecture, new $AB^{2}$ algorithm is proposed and partitioning, index transformation and merging the cell of the architecture, which is derived from the algorithm, are proposed. Based on the area-time product, when the digit-size of digit-serial architecture, L, is selected to be less than about m, the proposed digit-serial architecture is efficient than bit-parallel architecture, and L is selected to be less than about $(1/5)log_{2}(m+1)$, the proposed is efficient than bit-serial. In addition, the area-time product complexity of pipelined digit-serial $AB^{2}$ systolic architecture is approximately $10.9\%$ lower than that of nonpipelined one, when it is assumed that m=160 and L=8. Additionally, since the proposed architecture can be utilized for the basic architecture of crypto-processor and it is well suited to VLSI implementation because of its simplicity, regularity and pipelinability.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.68-74
• /
• 2009

In this paper, we propose an effective memory reduction algorithm to reduce the amount of reference frame buffer and memory bandwidth in video encoder and decoder. In general video codecs, decoded previous frames should be stored and referred to reduce temporal redundancy. Recently, reference frames are recompressed for memory efficiency and bandwidth reduction between a main processor and external memory. However, these algorithms could hurt coding efficiency. Several algorithms have been proposed to reduce the amount of reference memory with minimum quality degradation. They still suffer from quality degradation with fixed-bit allocation. In this paper, we propose an adaptive block-based min-max quantization that considers local characteristics of image. In the proposed algorithm, basic process unit is $8{\times}8$ for memory alignment and apply an adaptive quantization to each $4{\times}4$ block for minimizing quality degradation. We found that the proposed algorithm can obtain around 1.7% BD-bitrate gain and 0.03dB BD-PSNR gain, compared with the conventional fixed-bit min-max algorithm with 37.5% memory saving.