• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.1-6
• /
• 2016

As IPTV has become one of the major Internet services, IPTV users and channels increase rapidly. However, the increased number of channels makes users difficult to find their desired channels. Along with this, the channel switching time of IPTV incurs serious user-perceived delay. To alleviate these problems, this paper presents hybrid schemes that combine channel prefetching and reordering schemes. Simulation experiments show that combining adjacency based prefetching and popular channel reordering reduces the channel seek time by up to 44.7% in comparison with the conventional channel seeking interfaces.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.750-758
• /
• 2013

In this paper, we introduce the low-density parity-check (LDPC) coded orthogonal frequency division multiplexing (OFDM) subframe reordering scheme for achieving equal combined power allocation in type I hybrid automatic repeat request (H-ARQ) systems and analyze the performance improvement by using the channel capacity. Also, it is confirmed that the layered decoding for subframe reordering scheme in H-ARQ systems gives faster convergence speed. It is verified from numerical analysis that a subframe reordering pattern having larger channel capacity shows better bit error rate (BER) performance. Therefore the subframe reordering pattern achieving equal combined power allocation for each subframe maximizes the channel capacity and outperforms other subframe reordering patterns. Also, it is shown that the subframe reordering scheme for achieving equal combined power allocation gives better performance than the conventional Chase combining scheme without increasing the decoding complexity.

• ETRI Journal
• /
• v.37 no.1
• /
• pp.147-156
• /
• 2015

A typical solid-state drive contains several independent channels that can be operated in parallel. To exploit this channel-level parallelism, a variety of works proposed to split consecutive write sequences into small segments and schedule them to different channels. This scheme exploits the parallelism but breaks the spatial locality of write traffic; thus, it is able to significantly degrade the efficiency of garbage collection. This paper proposes a channel-aware write reordering (CAWR) mechanism to schedule write requests to different channels more intelligently. The novel mechanism encapsulates correlated pages into a cluster beforehand. All pages belonging to a cluster are scheduled to the same channels to exploit spatial locality, while different clusters are scheduled to different channels to exploit the parallelism. As CAWR covers both garbage collection and I/O performance, it outperforms existing schemes significantly. Trace-driven simulation results demonstrate that the CAWR mechanism reduces the average response time by 26% on average and decreases the valid page copies by 10% on average, while achieving a similar hit ratio to that of existing mechanisms.

• Journal of Korea Multimedia Society
• /
• v.7 no.6
• /
• pp.781-790
• /
• 2004

This paper presents a fourth-order cumulants based iterative algorithm for blind channel equalization. It is robust with respect to the existence of heavy Gaussian noise in a channel and does not require the minimum phase characteristic of the channel. In this approach, the transmitted signals at the receiver are over-sampled to ensure the channel described by a full-column rank matrix. It changes a single-input/single-output (SISO) finite-impulse response (FIR) channel to a single-input/multi-output (SIMO) channel. Based on the properties of the fourth-order cumulants of the over-sampled channel outputs, the iterative algorithm is derived to estimate the deconvolution matrix which makes the overall transfer matrix transparent, i.e., it can be reduced to the identity matrix by simple reordering and scaling. Both a closed-form and a stochastic version of the proposed algorithm are tested with three-ray multi-path channels in simulation studies, and their performances are compared with a method based on conventional second-order cumulants. Relatively good results are achieved, even when the transmitted symbols are significantly corrupted with Gaussian noise.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.422-431
• /
• 2004

In recent years, different models in data delivery have been explored in mobile computing systems. Particularly, there were a lot of research efforts in the periodic push model where the server repetitively disseminates information without explicit request. However, average waiting time per data operation highly depends on the length of a broadcast cycle and different access pattern among clients may deteriorate the response time considerably. In this case, clients are preferably willing to send a data request to the server explicitly through backchannel in order to obtain optimal response time. We call the broadcast model supporting backchannel as hybrid broadcast. In this paper, we devise a new transaction processing algorithm(O-PreH) in hybrid broadcast environments. The data objects which the server maintains are divided into Push_Data for periodic broadcasting and Pull_Data for on-demand processing. Clients tune in broadcast channel or demand the data of interests according to the data type. Periodic invalidation reports from the server support maintaining transactional consistency. If one or more conflicts are found, conflict orders are determined not to violate the consistency(pre-reordering) and then the remaining operations have to be executed pessimistically. Through extensive simulations, we demonstrate the improved throughput of the proposed algorithm.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.206-218
• /
• 2000

Retransmissions on the DLC layer are essential to ABR service providing the low CLR (cell loss ratio) over the unreliable wireless channel with high bit error rate. In the wireless ATM, the DLC layer below ATM layer performs the retransmission and reordering of the cells to recover the cell loss over the wireless channel and by doing so, the effect of the wireless channel characteristics with high bit error rate can be minimized on the ATM layer which is designed under the assumption of the low bit error rate. We propose, in this paper, the schemes to reflect the changes of the transmission rate over the wireless channel on the ABR rate control. Proposed scheme can control the source rate to the changes of the transmission rate over the wireless channel and reduce the required buffer size in the AP (access point). In the simulation, we assume that the DLC layer can inform the ATM layer of the wireless channel quality as good or bad. Our simulation results show that the proposed schemes require the smaller buffer size compared with the existing scheme, enhanced dynamic max rate control algorithm (EDMRCA). It is also shown that the scheme with the intelligent DLC which adjusts the rate to the wireless channel quality not only provides the low CLR with smaller buffer requirement but also improves the throughput by utilizing the wireless bandwidth more efficiently.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2021.06a
• /
• pp.39-42
• /
• 2021

최근 영상 혹은 비디오를 이용한 신경망 기반 기술들이 활발히 응용되고 있으며, 신경망이 처리하는 임무도 다양하고 복잡해지고 있다. 이러한 신경망 임무의 다양성과 복잡성은 더욱 많은 비디오 데이터를 요구하기 때문에 비디오 데이터를 효과적으로 전송할 방법이 필요하다. 이에 따라 국제 표준화 단체인 MPEG 에서는 신경망 기계 소비에 적합한 비디오 부호화 표준 개발을 위해서 Video Coding for Machines 표준화를 진행하고 있다. 본 논문에서는 신경망의 특징 맵 부호화 효율을 개선하기 위해 특징 맵 채널 간의 유사도가 높도록 특징맵 채널을 재배열하여 압축하는 방법을 제안한다. 제안 방법으로 VCM 의 OpenImages 데이터셋의 5000 개 검증 영상 중 임의 선택된 360 개 영상에 대해 부호화 효율을 평가한 결과, 객체 검출 임무의 정확도가 유지되면서 모든 양자화 값에 대해 화소당 비트수가 감소했으며, BD-rate 측면에서 2.07%의 부호화 이득을 얻었다.