• ETRI Journal
• /
• v.30 no.6
• /
• pp.765-773
• /
• 2008

Spatial correlation is a result of insufficient antenna spacing among multiple antenna elements, while temporal correlation is caused by Doppler spread. This paper compares the effect of spatial and temporal correlation in order to investigate the performance of multiuser scheduling algorithms in multiple-input multiple-output (MIMO) broadcast channels. This comparison includes the effect on the ergodic capacity, on fairness among users, and on the sum-rate capacity of a multiuser scheduling algorithm utilizing statistical channel state information in spatio-temporally correlated MIMO broadcast channels. Numerical results demonstrate that temporal correlation is more meaningful than spatial correlation in view of the multiuser scheduling algorithm in MIMO broadcast channels. Indeed, the multiuser scheduling algorithm can reduce the effect of the Doppler spread if it exploits the information of temporal correlation appropriately. However, the effect of spatial correlation can be minimized if the antenna spacing is sufficient in rich scattering MIMO channels regardless of the multiuser scheduling algorithm used.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.37-52
• /
• 2004

Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile units over a single or multiple channels. Since the mobile units have limited battery power, the minimization of the access time for the broadcast data is an important problem. There have been many research efforts that focus on the improvement if the broadcast techniques by providing indexes on the broadcast data. In this paper, we studied an efficient index allocation method for the broadcast data over multiple physical channels, which cannot be coalesced into a single high bandwidth channel. Previously proposed index allocation techniques either require the equal size of index and data or have a performance degradation problem when the number of given physical channels is not enough. These two problems will result in the increased average access time for the broadcast data. To cope with these problems, we propose an efficient tree- structured index allocation method for the broadcast data with different access frequencies over multiple physical channels. Our method minimizes the average access time for the broadcast data by broadcasting the hot data and their indexes more often than the less hot data and their indexes. We present an in-0e0th experimental and theoretical analysis of our method by comparing it with other similar techniques. Our performance analysis shows that it significantly decrease the average access time for the broadcast data over existing methods.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.86-101
• /
• 2006

The bandwidth of channel and the power of the mobile devices are limited on a wireless environment. In this case, data broadcast has become an excellent technique for efficient data dissemination. A significant amount of researches have been done on generating an efficient broadcast program of a set of data items with different access frequencies over multiple wireless broadcast channels as well as single wireless broadcast channel. In this paper, an efficient data allocation method over multiple wireless broadcasting channels is explored. In the traditional approaches, a set of data items are partitioned into a number of channel based on their access probabilities. However, these approaches ignore a variation of access probabilities of data items allocated in each channel. In practice, it is difficult to have many broadcast channels and thus each channel need to broadcast many data items. Therefore, if a set of data items broadcast in each channel have different repetition frequencies based on their access frequencies, it will give much better performance than the traditional approaches. In this paper, we propose an adaptive data allocation technique based on data access probabilities over multiple broadcast channels. Our proposed technique allows the adaptation of repetition frequency of each data item within each channel by taking its access probabilities into at count.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.411-432
• /
• 2010

We consider three different secure broadcasting scenarios: i) Broadcast channels with common and confidential messages (BCC), ii) multi-receiver wiretap channels with public and confidential messages, and iii) compound wiretap channels. The BCC is a broadcast channel with two users, where in addition to the common message sent to both users, a private message, which needs to be kept hidden as much as possible from the other user, is sent to each user. In this model, each user treats the other user as an eavesdropper. The multi-receiver wiretap channel is a broadcast channel with two legitimate users and an external eavesdropper, where the transmitter sends a pair of public and confidential messages to each legitimate user. Although there is no secrecy concern about the public messages, the confidential messages need to be kept perfectly secret from the eavesdropper. The compound wiretap channel is a compound broadcast channel with a group of legitimate users and a group of eavesdroppers. In this model, the transmitter sends a common confidential message to the legitimate users, and this confidential message needs to be kept perfectly secret from all eavesdroppers. In this paper, we provide a survey of the existing information-theoretic results for these three forms of secure broadcasting problems, with a closer look at the Gaussian multiple-input multiple-output (MIMO) channel models. We also present the existing results for the more general discrete memoryless channel models, as they are often the first step in obtaining the capacity results for the corresponding Gaussian MIMO channel models.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.272-285
• /
• 2008

In this paper, we concentrate on data allocation methods for multiple broadcast channels. When the server broadcasts data, the important issue is to let mobile clients access requested data rapidly. Previous works first sorted data by their access probabilities and allocate the sorted data to the multiple channels by partitioning them into multiple channels. However, they do not reflect the difference of access probabilities among data allocated in the same channel. This paper proposes ZGMD allocation method. ZGMD allocates data item on multiple channels so that the difference of access probability in the same channel is maximized. ZGMD allocates sorted data to each channels and applies Broadcast Disk in each channel. ZGMD requires a proper indexing scheme for the performance improvement. This is because in ZGMD method each channel got allocated both hot and cold data. As a result, the sequential search heuristic does not allow the mobile client to access hot data items quickly. The proposed index scheme is based on using dedicated index channels in order to search the data channel where the requested data is. We show that our method achieve the near-optimal performance in terms of the average access time and significantly outperforms the existing methods.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.15 no.3
• /
• pp.45-53
• /
• 2019

Moving image sharing technology has developed various servers and programs for personal broadcasting. In this paper, we propose the method of transmitting the multiple moving image, including the output channel of external streaming server. It also implements and tests multiple real-time broadcast channel automatic transmission systems that assign multiple output channels to automatic output channels. As a result of the experiment, it is easy to allocate moving image to broadcast channels that are output through the external streaming server's output channels regardless of the size of the streaming server, enabling the management of efficient output channels at the time of transmission of multiple moving image. The moving image can be provided through streaming method regardless of the type of moving image from the moving image provider terminal, and the moving image transmission can be controlled in various ways, including adding and changing channels for which the moving image is sent, and sending delayed to the moving image.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.128-135
• /
• 2017

In this paper, the changes of broadcasting loudness before and after are measured for the major broadcasting channels according to the amendment of broadcasting law and enforcement of digital television broadcasting loudness technology standards. Before the implementation of digital television broadcasting loudness technology standards. all the channels to be measured were broadcast at a higher volume level than the technical standards. However, after the implementation, most of the channels to be measured were maintained at a loudness level suitable for the technical standards. However, some programs are inadequate to meet technical standards, requiring corrective action, and the need for additional research to improve the measurement method.

• Journal of electromagnetic engineering and science
• /
• v.9 no.3
• /
• pp.124-129
• /
• 2009

Although the maximum sum-rate capacity of multiple-input multiple output(MIMO) broadcast channels(BCs) can be achieved by dirty-paper coding(DPC), the results were obtained without fairness considerations in uncorrelated MIMO channels. In this paper, we propose new multiuser scheduling algorithms, which find a best user set for approaching the maximum sum-rate capacity while maintaining fairness among users. We analyze the performance of the proposed algorithms using zero-forcing dirty paper coding(ZF-DPC) in the correlated MIMO BCs for throughput and delay fairness, respectively. Numerical results demonstrate that a large time window can reduce the average throughput difference between users, but it increases head-of-line(HOL) delay jitters in the case of delay fairness.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.175-176
• /
• 2008

Exploiting block diagonal geometric mean decomposition (BD-GMD) for the multi-user MIMO broadcast channels, each user can achieve identical received SNRs for its subchannels. Thus, equal rate modulation can be applied to each user. Using BD-GMD, we can apply an adaptive modulation to each user with the required bit error rate (BER). In this paper, we propose an adaptive modulation algorithm for the multi-user MIMO broadcast channels with BD-GMD to maximize the system throughput satisfying the required BER performance.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.490-500
• /
• 2011

The channels of domestic FM broadcast are needed to provide various kinds of new broadcasting services. However, available channels are limited and saturated. The channel interval of FM broadcast is changed from 200 kHz to 100 kHz to maximize utilization efficiency of scarce broadcast spectrum at all over the world. Also, there are many researches such as IBOC(In Band On Channel) and DRM+(Digital Radio Mondial+) that is to allocate the digital signal beside analog bandwidth. But output power is decrease to avoid interference between adjacent radio stations. In this paper, we analyzes the problems of the protection ratio which is decided in 1986 and we propose method to improve about 7~10dB significantly the protection ratio according to the recent DSP(Digital Signal Processing) techniques without loss of both transmission power and broadcast quality. In addition, we examined the possibility of securing two times available channels by reducing minimum frequency interval from 800 kHz to 400 kHz or 600 kHz in the equal site.