• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.111-113
• /
• 2010

본 논문에서는 SVC(Scalable Video Coding) 및 MVC(Multiview Video Coding) 등의 다계층 비디오의 효율적인 적응 HTTP 스트리밍을 위한 MPEG-2 TS(Transport Stream) 헤더의 확장을 제안한다. 먼저 TS로 다중화한 SVC/MVC를 HTTP를 통하여 스트리밍 할 경우 계층별 적응 스트리밍을 지원하기 위한 기존 TS의 한계점을 분석하고, TS 헤더의 확장을 통하여 TS 레벨에서 효율적인 적응을 제공하는 시그널링 기법을 제시한다. 본 논문의 제안 기법은 TS 헤더의 private_data를 추가적으로 정의하여 스케일러빌리티 및 뷰 정보를 기술함으로써 TS 단위로 스케일러블 계층 및 뷰 간 적응 스트리밍을 제공한다.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.65-67
• /
• 2009

We introduce an advanced terrestrial digital multimedia broadcasting (AT-DMB) system that overcomes the limitation of data transmission rates of T-DMB by doubling it with the same frequency bandwidth. In this letter, we propose an efficient algorithm which generates a scalable transport stream in AT-DMB by multiplexing certain types of elementary streams encoded using scalable video coding and an MPEG-surround audio coder for high-quality multimedia services.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.651-654
• /
• 2010

In this paper, we propose two power randomization schemes for the random beamforming (RBF) based MIMO systems in cellular downlink. In the proposed system, a BS randomizes not only the pre-coding matrix but also the power allocation matrix, while the conventional RBF system allocates an equal power to each transmit stream. The proposed water-filling based power randomization scheme (Scheme-I) is proper in the low SNR values and the proposed random-power based randomization scheme (Scheme-II) is proper in the high SNR values. The proposed system with the power randomization outperforms the conventional RBF system which allocates the same power for each data stream.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.9
• /
• pp.381-392
• /
• 2013

During the last decade, the multitude of advances attained in terminal computers, along with the introduction of mobile hand-held devices, and the deployment of high speed networks have led to a recent surge of interest in Quality of Service (QoS) for video applications. The main difficulty is that mobile devices experience disparate channel conditions, which results in different rates and patterns of packet loss. One way of making more efficient use of network resources in video services over wireless channels with heterogeneous characteristics to heterogeneous types of mobile device is to use a scalable video coding (SVC). An SVC divides a video stream into a base layer and a single or multiple enhancement layers. We have to ensure that the base layer of the video stream is successfully received and decoded by the subscribers, because it provides the basis for the subsequent decoding of the enhancement layer(s). At the same time, a system should be designed so that the enhancement layer(s) can be successfully decoded by as many users as possible, so that the average QoS is as high as possible. To accommodate these characteristics, we propose an efficient transmission scheme which incorporates SVC-aware dual-channel repetition to improve the perceived quality of services. We repeat the base-layer data over two channels, with different characteristics, to exploit transmission diversity. On the other hand, those channels are utilized to increase the data rate of enhancement layer data. This arrangement reduces service disruption under poor channel conditions by protecting the data that is more important to video decoding. Simulations show that our scheme safeguards the important packets and improves perceived video quality at a mobile device.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.7
• /
• pp.1425-1431
• /
• 2005

In this paper, we consider the ISR(Intelligence, Surveillance, and Reconnaissance) system which collects the imagery intelligence from an airplane and CDL(common data link) communication system which transports the information obtained by the ISR system. The IMINT(imagery intelligence) consists of MPEG-2 transport stream packets and they transmit through CDL. We have some simulations for communication performances of CDL and show performance improvements using convolutional coding. We have compared BER performances under AWGN channel and fading channel which is caused by the velocity of an airplane.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.4
• /
• pp.707-715
• /
• 2008

This paper proposes an algorithm for efficient compression gray-level images by entropy encoder. The issue of the proposed method is to replace original data of gray-level images with particular ranked data. For this, first, before encoding a stream of gray-level values in an image, the proposed method counts co-occurrence frequencies for neighboring pixel values. Then, it replaces each pay value with particularly ranked numbers based on the investigated co-occurrence frequencies. Finally, the ranked numbers are transmitted to an entropy encoder. The proposed method improves the performance of existing entropy coding by transforming original gray-level values into rank based images using statistical co-occurrence frequencies of gray-level images. The simulation results, using gray-level images with 8-bits, show that the proposed method can reduce bit rate by up to 37.85% compared to existing conventional entropy coders.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.2
• /
• pp.41-47
• /
• 2008

Most of media compression CODECs adopts the variable length coding method. This paper proposes special registers and instruction set for bit stream process in order to accelerate the decoding process of the variable length code. The instruction set shares the conventional data path to minimize additional costs. And bit stream is read from the memory instead of the special port. Therefore the instruction set minimizes the change of the processor, and is adopted without any additional input controller and buffer, and accelerate decoding process of variable length code. The data path of the instruction set needs additional 65 bits memory and 344 equivalent gates, 0.19 ns delay under TSMC $0.25{\mu}m$ technology. The instruction set reduced the execution time of the variable length code decoding process in H.264/AVC by about 55%.

• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.75-82
• /
• 2009

In this paper, we propose a robust preprocessing scheme for entropy coding in gray-level image. The issue of this paper is to reduce additional information needed when bit stream is transmitted. The proposed scheme uses the preprocessing method of co-occurrence count about gray-levels in neighboring pixels. That is, gray-levels are substituted by their ranked numbers without additional information. From the results of computer simulation, it is verified that the proposed scheme could be reduced the compression bit rate by up to 44.1%, 37.5% comparing to the entropy coding and conventional preprocessing scheme respectively. So our scheme can be successfully applied to the application areas that require of losslessness and data compaction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5A
• /
• pp.492-501
• /
• 2004

The performance of mobile communication systems depends on the state of the time-varying multi-path fading channel. To effectively prevent the corruption of video stream and its propagation in spatial and temporal domain, proactive error controls are widely being deployed. Among possible candidates, the rate compatible punctured convolutional (RCPC) code has been widely used for multimedia data, since its rate can be determined flexibly. In this paper, the adaptive channel estimation and the adaptive error correction techniques over the time-varying mobile channel have been proposed. Extensive computer simulations show that the proposed techniques yield the superior performance than the fixed rate system.