• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.11a
• /
• pp.87-90
• /
• 2015

MPEG-2 TS(Transport Stream)는 DTV(Digital Television), IPTV(Internet Protocol Television), DMB(Digital Multimedia Broadcasting) 등 디지털 방송 분야에서 압축된 오디오 및 비디오 데이터를 다중화하는 데에 전 세계적으로 널리 사용되고 있다. MPEG-2 TS 표준이 제정된 것은 1990년대 초반으로서 20여 년이 지난 오늘날의 방송과 통신 환경에 적합하지 않은 부분이 많이 포함되어 있다. 이러한 상황을 고려하여, MPEG(Moving Picture Experts Group)에서는 2014년에 MPEG-2 TS를 대체하고자 차세대 멀티미디어 전송 표준으로서 MMT(MPEG Media Transport)를 표준화하였다. 특히 네트워크 환경의 발전에 따라, MMT 표준은 IP 친화적이고 여러 가지 다른 종류의 네트워크를 병용한 멀티미디어 전달이 쉽도록 설계되었다. 본 논문에서는 실시간 방송에 의해 수신되는 MPEG-2 TS로부터 실시간으로 MMTP(MMT Protocol) 스트림을 생성하여 UDP/IP로 유무선 인터넷을 통해 멀티미디어 스트리밍 서비스를 제공하는 시스템을 구현하였다. 이를 위해 MPEG-2 TS 실시간 변환 기능을 갖춘 MMT 스트리밍 서버와 이로부터 서비스를 받을 수 있는 MMT 클라이언트를 구현하고 그 동작을 실험을 통해 검증하였다.

• Journal of Information Technology Services
• /
• v.16 no.1
• /
• pp.73-82
• /
• 2017

Recently in-memory data stream processing has been actively applied to various subjects such as query processing, OLAP, data mining, i.e., frequent item sets, association rules, clustering. However, finding regular periodic patterns of events in an infinite data stream gets less attention. Most researches about finding periods use autocorrelation functions to find certain changes in periodic patterns, not period itself. And they usually find periodic patterns in time-series databases, not in data streams. Literally a period means the length or era of time that some phenomenon recur in a certain time interval. However in real applications a data set indeed evolves with tiny differences as time elapses. This kind of a period is called as a pseudo-period. This paper proposes a new scheme called FPMH (Finding Periods using Multiple Hash functions) algorithm to find such a set of pseudo-periods over a data stream based on multiple hash functions. According to the type of pseudo period, this paper categorizes FPMH into three, FPMH-E, FPMH-PC, FPMH-PP. To maximize the performance of the algorithm in the data stream environment and to keep most recent periodic patterns in memory, we applied decay mechanism to FPMH algorithms. FPMH algorithm minimizes the usage of memory as well as processing time with acceptable accuracy.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.209-212
• /
• 2003

본 논문에서는 PC 환경에서 지상파 디지털 멀티미디어 방송(Digital Multimedia Broadcasting, DMB)을 수신할 수 있는 PC 기반 지상파 DMB 수신기용 백엔드 시스템 개발에 대해 서술한다. 지상파 DMB는 기존의 지상파 아날로그 또는 디지털 TV에 비해 탁월한 이동 수신 성능을 보인다. 본 논문에서는 국내 지상파 DMB 표준안에 부합하는 수신기의 백엔드 (back-end)를 PC 환경에서 소프트웨어로 구현하였다. 지상파 DMB는 유럽의 디지털 오디오 방송(Digital Audio Broadcasting, DAB) 표준인 EUREKA-147을 기반으로 MPEG-4 표준에 의한 멀티미디어 서비스를 제공한다. 지상파 DMB의 멀티미디어 서비스는 MPEG-4 AVC(Advance Video Coding) 압축 비디오와 BSAC(Bit Slice Arithmetic Coding) 압축 오디오를 MPEG-4 시스템의 SL(Sync Layer) 표준으로 패킷화 후 MPEG-2 TS(Transport Stream)에 실어 DAB의 스티림 모드를 통해 전송하는 방식을 사용한다. 본 논문에서는, 지상파 DMB 수신을 위한 프론트엔드(front-end)는 외장형 기기를 이용하고, 이로부터 USB 인터페이스를 통해 기저대역 다중화 스트림을 PC 상으로 업로드한 뒤, 소프트웨어에 의해 역다중화하고 압축을 푼 후, 오디오와 비디오를 재생하는 지상파 DMB 백엔드 시스템을 구현하고 이를 검증하였다.

• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.141-144
• /
• 2008

IPTV, VOD와 같은 스트리밍 서비스와 유료 케이블 TV 방송 채널, 유료 위성방송 채널 등에는 반드시 제한 수신 시스템(Conditional Access System, CAS)이 필요하다. CAS시스템은 인증 받은 사용자에게는 깨끗한 화면을 보여주어야 하고 인증 받지 않은 사용자에게는 정상적으로 화면을 즐길 수 없도록 하여야 한다. 이러한 환경을 만들기 위하여 추가비용이 적은 알고리즘이 필요한데 그 방법으로 암호화를 제안한다. 본 논문에서는 CAS 등의 인증시스템을 위하여 H.264 영상의 선택적 암호화를 구현하였다. 제안하는 방법은 여러 가지 포맷으로 된 콘텐츠를 트랜스코딩하여 YUV 형식으로 변환한 뒤, 이것을 H.264 코덱을 이용하여 압축한 다음 필요에 따라 특정한 부분을 암호화하는 것이다. 실험을 통하여 암호화 키가 없는 미 인증 사용자는 영상을 제대로 볼 수 없었고 암호화의 강도를 강하게 할 경우 재생은 되지만 영상의 확인이 불가능함을 확인하였다. 또한 300프레임의 영상을 암호화 하는데 평균 71.3초가 걸려 속도 역시 빠름을 확인하였다. 제안하는 내용은 IPTV, VOD와 같은 스트리밍 서비스에서의 사용자 인증 및 저작권 보호 등의 분야에 유용하게 사용될 것이다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.109-112
• /
• 2007

Currently was Convergence time of broadcasting and communication with development of information communication technology and internet infra environment. The superhigh speed internet about under using there is IPTV where it provides the broadcasting contents with broadcasting and communication Convergence service. Digital broadcasting it makes various broadcasting in one stream and it transmits, and about under analyzing it uses Channel information which is included in broadcasting and broadcasting information from the terminal. But, IPTV transmits each broadcasting in multicast methods, therefore the possibility of knowing all Channel information and broadcasting information from the terminal it is not there is a problem point. This paper hereupon it searched IPTV broadcasting information from the terminal and in order to support a channel selection from IPTV broadcasting streams SI about under extracting SD&S XML documents it created and it transmits with the distant multicast the system which plan and it embodied.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2421-2429
• /
• 2000

With the advance of wireless communications technology, mobile communications have become more convenient than ever. Nowadays, people can communicate with each other on any place at any time. However, because of the openness of wireless communications, the way to protect the privacy between communicating parties is becoming a very important issue. In this paper, we present a study on the authentication and message encryption algorithm to support roaming service to the GSM network. To propose an authentication and message encryption algorithm applicable to the GSM system, the security architecture of the GSM outlined in the GSM standard is briefly introduced. In the proposed cryptosystems we use a new hash function for user authentication and a stream cipher based on Linear Feedback Shift Register(LFSR) for message encryption and decryption. Moreover, each algorithm is programmed with C language and simulated on IBM-PC system and we analyze the randomness properties of the proposed algorithms by using statistical tests.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.495-507
• /
• 2006

In wireless local area networks (WLANs), the successful design of scheduling algorithm is a key factor in guaranteeing the various quality of service (QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a multipolling-based dynamic scheduling algorithm for providing delay guarantees to multimedia traffics such as MPEG streams. The dynamic algorithm exploits the characteristics of MPEG stream, and uses mini frames for feedback control in order to deliver dynamic parameters for channel requests from stations to the point coordinator (PC) operating at the access point (AP). In this scheme, the duration of channel time allocated to a station during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to conventional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.1
• /
• pp.75-84
• /
• 2017

It becomes more and more more important for the storage that supports high speed recording and stable access from network environment. As one field of basic science which produces massive astronomical data, VLBI(: Very Long Baseline Interferometer) is now demanding more data writing performance and which is directly related to astronomical observation with high resolution and sensitivity. But most of existing storage are cloud model based for the high throughput of general IT, finance, and administrative service, and therefore it not the best choice for recording of big stream data. Therefore, in this study, we design storage system optimized for high performance of I/O and concurrency. To solve this problem, we implement packet read and writing module through the use of libpcap and pf_ring API on the multi core CPU environment, and build a scalable storage based on software RAID(: Redundant Array of Inexpensive Disks) for the efficient process of incoming data from external network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.11
• /
• pp.1-12
• /
• 2005

In wireless personal area networks(PANs), the successful design of channel time allocation algorithm is a key factor in guaranteeing the various quality of service(QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a dynamic channel time allocation algerian for providing delay guarantees to multimedia traffics such as MPEG streams in the IEEE 802.15.3 high-rate WPANs. The dynamic algorithm exploits the characteristics of MPEG stream, wherein the devices (DEVs) send their channel time requests only at the end of superframe boundaries. The algerian uses mini packets for feedback control in order to deliver dynamic parameters for channel time requests from the DEVs to the piconet coordinator (PNC). In this scheme, the duration of channel time allocated to a DEV during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to traditional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.87-93
• /
• 2015

Recently, an idea has been suggested in which members construct the network by sharing their surplus bandwidth of their own access point. This kind of network is called public-shared network. As an application, SVC video streaming delivery system on public-shared network has been proposed. To send video stream from the stream server to clients, a tree structure is constructed where the root is a stream server, internal nodes are sharable access points, and leafs are clients. The previous researches have focused on constructing the minimal sharable-bandwidth tree which can serve all video streaming requests using the minimal sharable bandwidth. In this paper, we have shown that the problem of constructing a tree structure with given sharable access points to serve maximal video streaming requests is NP-hard. We also have developed an efficient heuristic algorithm for this problem and evaluated experimentally our algorithm.