• Journal of Satellite, Information and Communications
• /
• v.6 no.1
• /
• pp.19-27
• /
• 2011

In this paper, we propose the data stream allocation algorithms for maximizing sum capacity of downlink multiuser MIMO (Multiple-input Multiple-output) systems with BD (Block Diagonalization). The conventional BD precoding algorithms maximize the capacity by controlling power against channel gain of each user. In multiuser MIMO systems, however, the number of data streams for each user can be used to as another control parameter, which determines the capacity. This paper proposes the data stream allocation algorithm of BD for increasing capacity in multiuser MIMO systems. The proposed algorithm allocates unequal bit stream to each user based on channel matrix of each user for maximizing sum capacity. It is proved that proposed algorithm can achieve the significantly improved sum capacity by computer simulation.

• 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.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.5
• /
• pp.295-302
• /
• 2010

This paper proposes a multiple access method based on Time Reversal Mirror (TRM) technique when the multiple sensor nodes exist. Proposed method increases system sum capacity using energy focusing effects of the TRM. Simulation results show that proposed algorithm obtains higher system sum capacity than Orthogonal Frequency Division Multiple Access (OFDMA), e.g., 27 bps/Hz higher than the OFDMA method when the number of sensor node is 30, the number of transducer is 8, and is SINR 16 dB.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.79-85
• /
• 2008

Dirty Paper Coding(DPC) can achieve the sum capacity of a multiuser multiple-input multiple-output(MU MIMO) broadcast channels. However, due to the high computational complexity of the successive encoding and decoding, deploying DPC in real systems is impractical. As one of practical alternatives to DPC, Block Diagonalization(BD) was researched. BD is an extension of the zero-forcing preceding technique that eliminates interuser interference(IUI) in downlink MIMO systems. Though BD has lower complexity than DPC, BD shows poor sum capacity performance. We show that sum capacity performance of BD is degraded due to no IUI constraint. Then, we modify BD to improve its sum capacity performance with relaxing the constraint and sub optimal channel set searching. With simulation results, it can be verified that our modification in BD induces some improvement in sum capacity performance.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.137-140
• /
• 2011

A precoding strategy is one of the representative interference management techniques in cognitive radio (CR) network which is a typical interference-limited environment. The interference minimization approach to precoding is an appropriate scheme to mitigate the interference efficiently while it may cause the capacity loss of the desired channel. The precoding scheme for the maximal capacity of the desired channel improves the capacity of the desired channel while it increases the interference power and finally causes the capacity loss of the interfered users. Therefore, we propose a precoding scheme which satisfies these two conflicting goals and manages the interference signal in such an interference-limited environment. The proposed scheme consists of two steps. First, the precoder nulls out the largest singular value of the interference channel to mitigate the dominant interference signal based on the interference minimization approach. Second, the transmitter calculates the sum capacities per mode and selects a mode to maximize the sum capacity. In the second step, each mode consists of the right singular vectors corresponding to the singular values except the largest singular value eliminated in the first step. Simulation results show that the proposed precoding scheme not only efficiently mitigate the interference signal, but also has the best performance in terms of the sum capacity in a MIMO-based CR network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10C
• /
• pp.936-941
• /
• 2003

Density evolution was developed as a method for computing the capacity of low-density parity-check(LDPC) codes under the sum-product algorithm [1]. Based on the assumption that the passed messages on the belief propagation model can be approximated well by Gaussian random variables, a modified and simplified version of density evolution technique was introduced in [2]. Recently, the min-sum algorithm was applied to the density evolution of LDPC codes as an alternative decoding algorithm in [3]. Next question is how the min-sum algorithm is combined with a Gaussian approximation. In this paper, the capacity of various rate LDPC codes is obtained using the min-sum algorithm combined with the Gaussian approximation, which gives a simplest way of LDPC code analysis. Unlike the sum-product algorithm, the symmetry condition [4] is not maintained in the min-sum algorithm. Therefore, the variance as well as the mean of Gaussian distribution are recursively computed in this analysis. It is also shown that the min-sum threshold under a gaussian approximation is well matched to the simulation results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.23-28
• /
• 2010

We propose a reference vector diversity method in multi-cell multi-user uplink system with the subspace interference alignment to obtain higher sum rate capacity. The proposed method transmits several reference vectors before the data transmission, and selects the best reference vector to maximize the cell sum rate. The proposed method provides higher sum-rate capacity compared with the previous interferenc alignment. Simulation result exhibits the proposed method improves the sum-rate capacity by 60%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12A
• /
• pp.1006-1013
• /
• 2009

This paper proposes a data stream allocation technique for fair capacity performance in multiuser multiple-input multiple-output (MIMO) systems using block diagonalization (BD) algorithm. Conventional studies have been focused on maximum sum capacity. Thus, there is a very large difference of capacity among users, since user capacity unfairly distributed according to each user channel environment. In additional, poor channel user has very small capacity, since base station allocates the power by using water-filling technique. Also, almost studies limited itself to obtain the additional gain by using the same number of data streams for all users. In this paper, we propose the technique for maximizing sum capacity under the fair performance constraint by allocating data stream according to user channel environment. Also, proposed algorithm has more gain of sum capacity and transmit power than conventional equal allocation via computer simulation.

• Tuberculosis and Respiratory Diseases
• /
• v.61 no.3
• /
• pp.218-226
• /
• 2006

Background: The lung volume and diffusing capacity are influenced by ethnicity. However, there are no equations for predicting the normal lung volume in the adult Korean population, and there is only one equation for diffusing capacity. The aim of this study is to select the most suitable reference equation for the Korean population. Method: 30 men and 33 women at Hanyang University Guri Hospital, and 27 men and 34 women at Asan Medical Center in healthy nonsmoking adults were enrolled in this study. The subject's age, gender, height, weight, lung volume by plethysmography, and diffusing capacity by a single breathing method were obtained. The most suitable equation with the lowest sum of residuals between the observed and predicted values for lung volume and diffusing capacity was selected. Result: At Hanyang University Guri Hospital, the equations with the lowest sum of residuals in the total lung capacity were ECSC's equation in males (sum of residual: 0.04 L) and Crapo/Morris's equation (-1.04) in women. At the Asan Medical Center, the equations with the lowest sum of residuals in the total lung capacity were Goldman/Becklake's equation in males (sum of residual: -2.35) and the ECSC's equation -4.49) in women. The equations with the lowest sum of residuals in the Diffusing capacity were Roca's equation in males (sum of residual: -13.66 ml/min/mmHg) and Park's in women (25.08) in Hanyang University Guri hospital and Park's equation in all cases in the Asan Medical Center (male: -1.65, female: -6.46). Conclusions: Until a reference equstion can be made for healthy Koreans by sampling, ECSC's equation can be used for estimating the lung volume and Park's can be used for estimating the diffusing capacity.

• Journal of the Korean Society for Railway
• /
• v.5 no.2
• /
• pp.77-83
• /
• 2002

In this paper we present a nonlinear programming model for the train seat capacity distribution with a numerical example. The model finds the optimal capacity distribution methods which minimize the sum of the differences between the demands and the seat capacities. Also the model provides the information on the degree of the discrepancy between the demand and the seat capacities. One can use the model as a tool for planning train seat capacity planning.