• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.8
• /
• pp.1-10
• /
• 2001

This paper describes new line code algorithm, called NIDI(Nibble Inversion mock Inversion) which is well suited for interconnection and transmission technology, The proposed line code which includes only one redundancy bit serves primary features of line code and synchronization patterns for byte or frame synchronization in interconnection, Also, this line code provides in-band signals and speciaI characters.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1513-1516
• /
• 2001

본 논문은 기가비트 네트워크 테스트베드인 JGN상에서 대표적인 스트림형 트래픽인 DV와 MPEG2에 대한 전송 품질의 주관적 평가를 통하여 전송지연과 패킷 손실에 따른 영향이 최종 사용자에게 어떤 영향을 미치는 지를 조사한 것이다. 스트림형 데이터에 대해 음질 측정은 ITU-R BS.1116-1을 기반으로 하고 화질 측정은 ITU-R BT.500-1 을 기반으로 하여 측정하였다, 또한 최종 사용자의 주관적 평가를 얻기 위한 방법으로는 DSCQS 5 단계 평가 방법을 채택하였다. 그 결과 MPEG2 스트림의 경우 네트워크 트래픽 파라미터가 급증하는 54%의 부하율에서 화질과 음질의 평가 등급이 급격히 하강한다는 것을 알 수 있었고 DV의 경우 화질은 MPEG2 와 마찬가지로 54%의 부하율에서 평가 등급이 감소하기 시작하였으나 그 변화정도가 MPEG2 에 비하여 완만한 변화를 보였다. DV 음질의 경우 트래픽 파라미터(RTT, 패킷 손실)와는 큰 연관성을 보이지 않았고 대부분의 측정자들이 보통 수준의 평가등급을 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.223-225
• /
• 2004

이동통신의 지속적인 발달은 사용자들에게 많은 편리성을 제공해주고 있다. 이와 반면에, 이동통신의 개방성은 무선공격에 심각하게 노출되어 있으며, 안전한 통신을 위해 이동통신망의 보안은 필수적이다. 본 논문서는 이동통신상에 전송되는 데이터를 보다 안전하게 보호하기 위한 메커니즘으로서 스트림 암호알고리즘에 두개의 S박스를 사용하고, 두 개의 S박스 사용에 따른 메커니즘을 제안한다. 먼저, DES의 각 S박스에 대한 랜덤성을 테스트하여 랜덤특성이 좋은 두개의 S박스를 고찰한다. 두 개의 S박스는 제안하는 메커니즘에 따라 스트림 암호알고리즘에 적용하며, 이 때 두개의 S박스는 비트가 0이면 S박스를 통과하고, 1이면 통과하지 않는 메커니즘을 사용한다. 이에 대한 실험은 기존 모델과의 비교분석을 통해 제안한 모델의 효율성을 증명한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.229-231
• /
• 2003

본 고에서는 지속적으로 증가하는 이동통신 사용자들에게 이동통신의 편리성뿐만 아니라 안전한 통신을 제공하기 위해 기존의 스트림 암호알고리즘의 비도 향상을 위한 메커니즘을 제안한다. 본 논문에서는 이동통신상의 데이터를 보다 안전하게 암호화하기 위한 메커니즘으로서 블록암호 알고리즘에서 주로 사용하는 S 박스를 이중으로 사용하는 메커니즘과 이중으로 사용되는 S 박스를 위한 행ㆍ열 메커니즘을 제안한다. 본 고에서 사용하는 S 박스는 DES의 S 박스의 일부를 사용하며, 사용되는 S 박스는 스트림 암호 알고리즘의 모든 비트에 대해 통과되는 것이 아니라 0인 경우에만 제안하는 이중 S 박스를 통과하는 방법을 사용한다. 제안한 모델은 4장의 실험에서 기존모델과 비교ㆍ분석하여 제안한 모델의 효율성을 증명한다.

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

H.264 adopts new coding tools such as intra-prediction, loop filter, etc. The adoption of these tools enables an H.264-coded bitstream to have more information compared with previous standards. In this paper we proposed an effective spatial error concealment method for H.264. Among the information included in an H.264-coded bitstream, we use intra-mode for recovering a damaged block. This is because prediction direction in intra-mode is highly correlated to the edge direction of a lost macroblock. We first estimate the edge direction using intra-modes of blocks adjacent to a lost macroblock, and classify the area in a damaged macroblock into the edge and the flat area. And then our method recovers pixel values in the edge area using edge-directed interpolation, and recovers pixel values in the flat area using weighted interpolation. Simulation results show the proposed method yields better video quality than conventional approaches by 0.35 to 5.48 dB.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.471-479
• /
• 2008

In this paper, we propose a novel algorithm to automatically generate an RTP timestamp value that is required for the RTP packetization in order to transmit SVC video over various If networks such as Internet. Unlike the conventional single layer coding algorithms such as H.263, MPEG-4 and H.264, SVC generates a multi-layered single bitstream which is composed of a base layer and one or more enhancement layers in order to simultaneously provide temporal, spatial, and SNR scalability. Especially, in order to provide temporal scalability based on hierarchical B-picture prediction structure, the encoding (or transmission) and display order of pictures in SVC coding is completely decoupled. Thus, the timestamp value to be specified at the header of each RTP packet in video transmission does not increase monotonically according to the display time instant of each picture. Until now, no method for automatically generating an RTP timestamp when SVC video is loaded in a RTP packet has teen introduced. In this paper, a novel automatic RTP timestamp generation method exploiting the TID (temporal ID) field of the SVC NAL unit header is proposed to accommodate the SVC video transmission.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.2
• /
• pp.181-186
• /
• 2012

Recently there has been many active researches on searching similar sequences from data generated with the passage of time. Those data are classified as time series data or sequence data and have different semantics from scalar data of traditional databases. In this paper similar sequence search retrieves sequences that have a similar trend of value changes. At first we have transformed the original sequences by applying DFT. The converted data are more suitable for trend analysis and they require less number of attributes for sequence comparisons. In addition we have developed a region-based query and we applied bitmap indexes which could show better performance in data warehouse. We have built bitmap indexes with varying number of attributes and we have found the least cost query plans for efficient similar sequence searches.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.2
• /
• pp.206-212
• /
• 2006

Many image and video compression algorithms work by splitting the input image into blocks and producing variable-length coded bits for each block data. If variable-length coded data are transmitted consecutively, then the resulting coder is highly sensitive to channel errors. Therefore, most image and video techniques for providing some protection to the stream against channel errors usually involve adding a controlled amount of redundancy back into the stream. Such redundancy might take the form of resynchronization markers, which enable the decoder to restart the decoding process from the known state, in the event of transmission errors. The Error Resilient Entropy Code (EREC) is a well known method which can regain synchronization without any redundant information to convert from variable-length code to fixed-length code. This paper proposes an enhancement to EREC, which greatly improves its transmission ability for the compressed image quality without any redundant bits in the event of errors. The simulation result shows that the both objective and subjective quality of transmitted image is enhanced compared with the existing EREC at the same BER(Bit Error Rate).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1173-1183
• /
• 2006

In this paper, we propose an efficient method for improving visual quality of AR-FGS (Adaptive Reference FGS) which is adopted as a key scheme for SVC (Scalable Video Coding) or H.264 scalable extension. The standard FGS (Fine Granularity Scalability) adopts AR-FGS that introduces temporal prediction into FGS layer by using a high quality reference signal which is constructed by the weighted average between the base layer reconstructed imageand enhancement reference to improve the coding efficiency in the FGS layer. However, when the enhancement stream is truncated at certain bitstream position in transmission, the rest of the data of the FGS layer will not be available at the FGS decoder. Thus the most noticeable problem of using the enhancement layer in prediction is the degraded visual quality caused by drifting because of the mismatch between the reference frame used by the FGS encoder and that by the decoder. To solve this problem, we exploit the principle of cyclical block coding that is used to encode quantized transform coefficients in a cyclical manner in the FGS layer. Encoding block coefficients in a cyclical manner places 'higher-value' bits earlier in the bitstream. The quantized transform coefficients included in the ealry coding cycle of cyclical block coding have higher probability to be correctly received and decoded than the others included in the later cycle of the cyclical block coding. Therefore, we can minimize visual quality degradation caused by bitstream truncation by adjusting weighting factor to control the contribution of the bitstream produced in each coding cycle of cyclical block coding when constructing the enhancement layer reference frame. It is shown by simulations that the improved AR-FGS scheme outperforms the standard AR-FGS by about 1 dB in maximum in the reconstructed visual quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.566-572
• /
• 2000

In the receiver of optical communication systems, a demultiplexer converts to a single data stream with a highbit rate into several parallel data streams with a low bit rate. In this paper, we design a 1:4 demultiplexer using SiGe HBT with emitter size of 2x8um² The operation speed is 10Gbps, the rise and fall times of 20-80% are37ps and 36ps, respectively and the dissipation of power is 1.40W.