• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.186-193
• /
• 2008

A two-hop multiple-input multiple-output (MIMO) relay network which comprises a multiple antenna source, an amplify-and-forward MIMO relay and many potential users are studied in this paper. Consider the achievable sum rate as the performance metric, a joint design method for the processing units of the BS and relay node is proposed. The optimal structures are given, which decompose the multiuser MIMO relay channel into several parallel single-input single-output relay channels. With these structures, the signal-to-noise ratio at the destination users is derived; and the power allocation is proved to be a convex problem. We also show that high sum rate can be achieved by pairing each link according to its magnitude. The sum rate of three broadcast strategies, time division multiple access (TDMA) to the strongest user, dirty paper coding (DPC), and beamforming (BF) are investigated. The sum rate bounds of these strategies and the sum capacity (achieved by DPC) gain over TDMA and BF are given. With these results, it can be easily obtained that how far away TDMA and BF are from being optimal in terms of the achievable sum rate.

• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.912-920
• /
• 2015

Unlike general texture-based feature description algorithms, Locally Likely Arrangement Hashing (LLAH) algorithm describes a feature based on the geometric relationship between its neighbors. Thus, even in poor-textured scenes or large camera pose changes, it can successfully describe and track features and enables to implement augmented reality. This paper aims to optimize the performance of LLAH algorithm for tracking random dots (= features) with Gaussian noise. For this purpose, images with different number of features and magnitude of Gaussian noise are prepared. Then, the performance of LLAH algorithm according to the conditions: the number of neighbors, the type of geometric invariants, and the distance between features, is analyzed, and the optimal conditions are determined. With the optimal conditions, each feature could be matched and tracked in real-time with a matching rate of more than 80%.

• Journal of Broadcast Engineering
• /
• v.8 no.2
• /
• pp.146-152
• /
• 2003

ATSC DTV receivers use repetitive data segment syncs or Gardner algorithm as a tuning recovery circuit. Many multipath signals can induce timing-offset in the symbol timing recovery circuit using Gardner algorithm and this timing-offset shifts sampling instant to the wrong points, causing the performance of the equalizer to become nr. When many echoes exist, the optimal sampling instant will be the Point at which the main-path has a peak value. In this paper, by using channel correlation techniques, we find the optimal sampling instant, thereby compensating the timing offset and improving DTV reception performance. We analyzed the Performance enhancement of DTV receivers using the timing offset compensator.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.11-16
• /
• 2004

Recently, collaborative works are increased more and more over the distributed heterogeneous computing environments. The availability of high-speed wide-area networks has also enabled collaborative multimedia applications such as video conferencing, distributed interactive simulation and collaborative visualization. Distributed high performance computing and collaborative multimedia applications, it is extremely important to efficiently perform group communication over a heterogeneous network. Typical group communication patterns are broadcast and Multicast. Heuristic algorithms such as FEF, ECEF, look-ahead make up the message transmission tree for the broadcast and multicast over the distributed heterogeneous systems. But, there are some shortcomings because these select the optimal solution at each step, it may not be reached to the global optimum In this paper, we propose a new heuristic algerian that constructs tree for efficiently collective communication over the previous heterogeneous communication model which has heterogenity in both node and network. The previous heuristic algorithms my result in a locally optimal solution, so we present more reasonable and available criterion for choosing edge. Through the performance evaluation over the various communication cost, improved heuristic algorithm we proposed have less completion time than previous algorithms have, especially less time complexity than look-ahead approach.

• Journal of Broadcast Engineering
• /
• v.15 no.4
• /
• pp.555-562
• /
• 2010

After starting digital terrestrial broadcasting, there have been a number oftrials to provide new services like data broadcasting on a spare bandwidth of a DTV channel. Recently, the Push-VOD service, which provides A/V contents on that bandwidth, gets more attention and is being standardized as NRT(Non-Real-Time) by ATSC. However, it is highly probable that the contents transmitted in this way contain many errors due to the DTV receiving environment. Thus, in order to improve the reliability of transmission, the contents should be transmitted repeatedly several times, considering the unidirectional property of DTV terrestrial network. In this paper, we propose a method to calculate the optimal number of repetitions to transmit each contents in a way that minimizes the number of errors occured, when trying to transmit several contents to the receiver in a restricted time, using Markov-chain modeling and dynamic programming approach.

• Journal of Broadcast Engineering
• /
• v.19 no.1
• /
• pp.24-30
• /
• 2014

This study investigates computing offloading effect of cloud in real-time video personal broadcast service, whose server is mobile device. Mobile device does not have enough computing resource for encoding video. The computing burden is offloaded to cloud, which has abundant resources in terms of computing, power, and storage compared to mobile device. By reducing computing burden, computation energy can be saved while transmission data amount increases because of decreasing compression efficiency. This study shows that the optimal operation point can be found adaptively to time-varying LTE communication condition result of tradeoff analysis between offloaded computation burden and increase in amount of transmitted data.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.592-608
• /
• 2016

Recently, many researches on digital holograms, which retain almost perfect 3 dimensional image information, have been performed actively that it seems for them to be serviced soon. Accordingly, this paper proposes a data compression technique for a digital hologram video for this service. It uses H.265/HEVC, the most recent international 2 dimensional video compression standard, for which we consider various domain transform methods to increase the correlation among the pixels in a digital hologram. Also we consider the various parameters on H.265/HEVC. The purpose of this paper is to find empirically the optimal condition for the domain transform method, the size of transform unit, and the H.265/HEVC parameters. The proposed method satisfying the optimal parameter set found is compared to the existing methods to prove that ours shows better performance.

• Journal of Broadcast Engineering
• /
• v.15 no.5
• /
• pp.617-630
• /
• 2010

At 37th VCEG meeting in Jan. 2009, Toshiba proposed Quadtree-based Adaptive Loop Filter (QALF). The basic concept of QALF is to apply Wiener filter to decoded image after the conventional deblocking filter and to represent the filter on/off flag data for each basic filtering unit in a more efficient way of quadtree structure. QALF could enhance the compression performance of around more than 9%, but the structure of one filter for a decoded frame leaves room for further improvement in the sense that optimal filter for one region of a frame could quite different from the optimal filter for other parts of a picture. This paper proposes multiple adaptive loop filters for better utilization of local characteristics of decoded frame to optimize the region-based Wiener filters. Additional filters, proposed in this paper, cover separate spatial area of each decoded frame according to the performance of previously designed filter(s) to provide the flexibility of rate-distortion based selection of the number of filters.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.164-175
• /
• 1999

Based on the performance analyses for transmission channel and signal characteristics in digital satellite broadcasting system. the optimal design parameter values for system using QPSK modulation technique were proposed in this paper. The proper performance degradation were of 2.0dB for channel characteristics. O.4dB for transmission signal characteristics and 0.2dB for receiver characteristics. respectively. In this case. the design objectives for system parameters were within ${\pm}\;0.5dB$ for gain flatness in 27MHz bandwidth. and O.1nsec/MHz and $0.2sec/MHz^2$ for linear and parabolic group delay. respectively. Also. the optimal parameter values that provide the maximum availability were of OdB OBO for satellite transponder TWTA. and the optimal bandwidth for PLL circuit was of 40kHz with 0.707 damping factor. These analyses and design values can be available for high data rate transmission system via satellite.

• Journal of Broadcast Engineering
• /
• v.8 no.4
• /
• pp.481-491
• /
• 2003

We present a near-optimal blind decision feedback equalizer (DFE) for Advanced Television Systems Committee digital television (DTV) receivers. By adopting a modified trellis decoder (MTD) with trace back depth of 1 for the decision device In the DFE, we obtain a hardware-efficient near-optimal blind DFE approaching to the optimal DFE which has no error propagation. The MTD uses absolute distance instead of Euclidean distance for computation of a path metric, resulting. In reduced computational complexity. Comparing to the conventional slicer, the MTD shows outstanding performance improvement of decision error probability and is comparable to the original trellis decoder using Euclidean distance. Reducing error propagation in the DFE leads to the improvement of convergence performance in terms of convergence speed and residual error. Simulation results show that the proposed blind DFE performs much better than the blind DFE with the slicer.