• Journal of Korean Society of Archives and Records Management
• /
• v.19 no.4
• /
• pp.1-33
• /
• 2019

The key to the long-term preservation of electronic records is the long-term retention of the bitstream that contains the original functional attributes and appearances of the electronic records that were originally created and utilized. Considering economic and technical aspects, most of the major domestic and foreign archives have adopted a migration strategy that allows conversion to a new format depending on the stability and reliability of the format containing the original bitstream. However, as the type of electronic records varies and its scope continuously expands, several problems arise if a single migration strategy is observed. Therefore, the applicability of the emulation strategy is examined in this paper to reproduce the system and application environment where electronic records are created and utilized. As such, electronic records can be maintained without any changes in the bitstream by utilizing cloud computing technology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.628-637
• /
• 2003

This paper describes a novel multiplexing scheme for delay-sensitive multiple VBR-coded bit streams in live multimedia service offered to high-speed networks. The primary goal of multiplexing in this paper is to keep delay limits of each bit streams and to enhance network resource utilization when they no multiplexed and transmitted over network. For this aim, this paper presents a dynamical control scheme which does not cause violation of any delay constraints to each bit steam. The scheme is based on the assumption that recent behavior of the each bit scream has high correlation with near-term future behavior. Such property is used to make as flat as possible by both temporal averaging on a stream-by-stream and spatial averaging is introduced when multiple VBR-coded bit streams are multiplexed. The effectiveness of the scheme is evaluated by several simulation using an MPEG-coded video trace of Star_wars and it is shown that the proposed scheme can effectively reduce the feat rate md coefficient of variation of the multiplexed transmission rate.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.10 s.352
• /
• pp.54-60
• /
• 2006

In order to test the board with IEEE 1149.1 boundary scan design, the test sequence must be applied as the bit stream However it is very tedious job to generate the test bit sequence since it requires the complete hlowledge about the 1149.1. This fuper introduces a convenient PCI/USB interface controller, named as Test-Ready PCI (TRPCI) ard Test-Ready USB (TRUSB). Test Bus Controller has been developed by TI and Lucent aiming to generate the test bit stream as an instruction level, thus even the novice test engineer can easily generate the test sequence.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.954-961
• /
• 2010

Stream cipher was worse than block cipher in terms of security, but faster in execution speed as an advantage. However, since so far there have been many algorithm researches about the execution speed of block cipher, these days, there is almost no difference between them in the execution speed of AES. Therefore an secure and fast stream cipher development is urgently needed. In this paper, we propose a 32bit output fast stream cipher, AA32, which is composed of ASR(Arithmetic Shifter Register) and simple logical operation. Proposed algorithm is a cipher algorithm which has been designed to be implemented by software easily. AA32 supports 128bit key and executes operations by word and byte unit. As Linear Feedback Sequencer, ASR 151bit is applied to AA32 and the reduction function is a very simple structure stream cipher, which consists of two major parts, using simple logical operations, instead of S-Box for a non-linear operation. The proposed stream cipher AA32 shows the result that it is faster than SSC2 and Salsa20 and satisfied with the security required for these days. Proposed cipher algorithm is a fast stream cipher algorithm which can be used in the field which requires wireless internet environment such as mobile phone system and real-time processing such as DRM(Digital Right Management) and limited computational environments such as WSN(Wireless Sensor Network).

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1129-1132
• /
• 2004

이동통신기술의 지속적인 발전은 많은 사용자들에게 시간과 장소에 구애받지 않고 어디서든지 통신 서비스를 받을 수 있도록 제공해주고 있다. 하지만 이동통신기술의 개방성은 항상 심각한 보안 위협에 노출되어 있으며, 보안 안전성이 높은 통신채널 확보를 위해서는 암호화가 반드시 필요하다. 이동통신망의 보안을 위해서 사용하는 가장 일반적인 방법 중의 하나는 스트림 암호알고리즘이다. 본 논문에서는 전송되는 데이터를 보다 안전하게 암호화하기 위해 DES에서 사용하는 S박스중 실험을 통해 랜덤성이 좋은 두 개의 S박스를 조사하고, 비트가 0이면 통과하고 1이면 통과하지 않는 메커니즘을 제안한다. 실험을 통해 제안모델이 기존모델보다 향상된 랜덤성과 상관특성을 나타냄을 증명하며, 비트가 0인 경우에만 S박스를 사용하는 메커니즘과 0과 1의 모든 비트에 S박스를 통과시킨 모델을 비교하여 제안 메커니즘의 효율성을 증명한다.

• Journal of KIISE:Software and Applications
• /
• v.35 no.4
• /
• pp.207-218
• /
• 2008

With the growth of the Internet, multimedia streaming becomes an important means to deliver video contents over the Internet and the amount of the streaming multimedia contents is also getting increased. However, it becomes difficult to guarantee the quality of service in real-time over the IP network environment with instantaneously varying bandwidth. In this paper, we propose an optimal adaptation framework for streaming contents over the Internet in the sense that the perceptual quality of the multi-angie content with multiple visual objects is maximized given the constraints such as available bandwidth and transcoding cost. In the multi-angle video service framework, the user can select his/her preferred alternate views among the given multiple video streams captured at different view angles for a same event. This enhanced experience often entails streaming problems in real-time over the network, such as instantaneous bandwidth changes in the Internet. In order to cope with this problem, we assume that multi-angle video contents are encoded at different bitrates and the appropriate video streams are then selected or transcoded for delivery to meet such bandwidth constraints. For the user selective consumption of the various bitstreams in the multi-angle video service, the bitstream in each angle can be encoded in various bitrate, and the user can select a sub-bitrstream in the given bitrstreams or transcode the corresponding content in order to deliver the optimally adapted video contents to the instantaneously changing network condition. Therefore, we define the transcoding cost which means the time taken for transcoding the video stream and formulate a unified optimization framework which maximizes the perceptual quality of the multiple video objects in the given constraints such as the transcoding cost and the network bandwidth. Finally, we present plenty of the experimental results to show the effectiveness of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.994-1004
• /
• 2000

In this paper, bitstreams are composed of using H.263 for a moving picture coding in the band-limited and error-prone environment such as wireless environment. EREC sub-frames are implemented by applying the proposed EREC algorithm in order to be UEP for the real data parts of implemented bitstreams. Because those are able to do resynchronization with a block unit, propagation of the error can be minimized, and the position of the important bits such as INTRADC and MVD can be known. Class is separated using the position of these important bits, and variable puncturing tables are designed by the class informations and the code rates of turbo codes are differently designed in according to the class. Channel coding used the turbo codes, and an interleaver to be designed in the turbo codes does not eliminate redundancy bits of the important bits in applying variable code rates of EREC sub-frames unit and is always the same at the transmitter and the receiver although being variable frame size. As a result of simulation, UEP with the code rate similar to EEP is obtained a improved result in the side of bit error probability. And the result of applying it to image knows that the subjective and objective quality have been improved by the protection of important bits.

• Journal of Broadcast Engineering
• /
• v.7 no.3
• /
• pp.271-276
• /
• 2002

It is very important to find errors in broadcasted streams because it can help us to find where errors occur. Broadcasted streams may have errors in the RF(radio frequency) or baseband domain. It is very important to fix these errors because it can help to stabilize set-top boxes, provide stable receiving, and give comfortable environments to watch TV. Since 2001, major terrestrial broadcasters in Korea started the DTV broadcasting in Kwan-Ak over Seoul area. In this paper, we provide some analysis on errors in MPEG-based TS streams, PSIP packets, and RF area which may occur in DTV systems and compare this result with that of USA.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.937-942
• /
• 2003

In this paper, we measured and examined RTT delays and packet losses according to the changes of stationary loads for two typical stream-type traffics, a DV and a MPGE2 on the R＆D Gigabit Network testbed, JGN. As the result of our actual measurements, we realized that the packet size of stationary load have no effects on a DV and a MPGE2 stream on the very high-speed network(50Mbps, IP over ATM). When its bandwidth and stationary load exceeds 95％ of network bandwidth, packet losses appeared and RTT delay increased rapidly. Also we realized that the number and size of Receive ＆ Transmit buffer on the end systems have no effects on packet losses and RTT delays.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.3
• /
• pp.53-64
• /
• 1997

When we apply a synchronous stream cipher to the T1 carrier system, it can occur long consecutive 0's(or 1's) sequences in the received data. In this case, it is difficult to recover receiver clock and violates a communication protocol. This paper proposes block detection and serial detection method which suppress 0's sequences of more than k( $\geq$ 2) of the stream ciphertext in the T1 carrier system. These ZS methods keep security level and solve problems of stream synchronization.