This paper presents analysis of a congestion control scheme in which a multiplexer notifies upstream traffic sources when its buffer level crosses a preset threshold. Upon notification, the traffic streams are reshaped to a form less likely to cause overflow through rate or burstiness restrictions, or a combination of the two. For the analysis, the traffic is modeled by two Markov Modulated Rate Processes (MMRP's), one for above and one for below the threshold, and an iterative fluid approximation technique is used to determine the buffer occupancy distribution. Simulation results verify the accuracy of the approach, and the analysis is used to study the effect of varying the threshold and shaping function.

Fair queueing is a service scheduling discipline to pursue the fairness among users in packet communication networks. Many fair queueing algorithms, however, have problems of computational overhead since the central scheduler has to maintain a certain performance counter for each flow of user packets based on the global virtual time. Moreover, they are not suitable for wireless networks with high probability of input channel errors due to the lack or complexity in the compensation mechanism for the recovery from the error state. In this paper, we propose a new, computationally efficient, distributed fair queueing scheme, which we call Channel-Aware Throughput Fair Queueing (CATFQ), that is applicable to both wired and wireless packet networks. In our CATFQ scheme, each flow is equipped with a counter that measures the weighted throughput achievement while it has a backlog of packets. At the end of every service to a packet, the scheduler simply selects a flow with the minimum counter value as the one from which a packet is served next. We show that the difference between any two throughput counters is bounded. Our scheme significantly reduces the scheduler's computational overhead and guarantees fair throughput for all flows. For wireless networks with error-prone channels, the service chance lost in bad channel condition is compensated quickly as the channel recovers. Our scheme suppresses the service for leading flows, brings short-term fairness for flows without channel errors, and achieves long-term fairness for all flows. These merits are verified by simulation.

When orignal signals are contaminated by both additive and signal-dependent noise components, the test statistics of locally optimum detector are obtained for detection of weak composite signals based on the generalized Neyman-Pearson lemma. In order to consider the non-additive noise as well as purely-additive noise, a generalized observation model is used in this paper. The locally optimum detector test statisics are derived for all different cases according to the relative strengths of the known signal, random signal, and signal-dependent noise components. Schematic diagrams of the structures of the locally optimum detector are also included. The finite sample-size performance characteristics of the locally optimum detector are compared with those of other common detectors.

This paper proposes a new detection ordering scheme, which minimizes average error rate of the MIMO system with per antenna rate control. This paper shows an optimal scheme minimizing average error rate expressed by the Q function, and simplifies the optimal scheme by using the minimum equivalent SINR scaled by modulation indices, based on approximated error rate. In spite of reduced complexity, the simplified scheme demonstrates the almost same performance as the optimal scheme. Owing to the diversity of detection ordering, the proposed scheme has over 2 dB higher SNR gain at the BER of 10-3 than the existing ordering schemes in balanced array size systems.

In femto/macro cellular networks, the stability and fairness problems caused by the unplanned and random characteristic of femtocells must be solved. By applying queueing theory in IP based femto/macro cellular networks, we found the stability condition, and described two kinds of cell section policies of users. As a main contribution, we provided the adaptive channel distribution algorithm which minimizes the average packet sojourn time at transmitting systems and keeps the whole systems stable and fair among cells. Through experiments in various environments, we analyzed the influence of channel reuse factor, cell selection policies, and the number of femtocells on system performance.

A neutralization line is internally added to a 770 MHz LTE-band miniature dual-antenna system to improve its antenna efficiency. The odd-mode antenna impedance simulations indicate that the position of the neutralization line along the radiating structure determines the operation frequency. Measurement results show that the line reduces the antenna coupling loss from -6 to -17 dB while improving the individual antenna efficiency from 42 to 65 percent at 770 MHz.

In order to provide an efficient test method for PLL which is a mixed-signal circuit widely used in most of SoCs, a novel BIST method is developed. The new BIST uses the change of phase differences generated by selectively alternating the feedback frequency. It provides an efficient structural test, reduces an area overhead and improves the test accessibility.

In this paper, we propose an adaptive data transmission scheme for DS/CDMA packet radio communication systems in bandlimited indoor multipath fading channels. We first analyze the relationship between the code rate and the processing gain (defined as the number of chips per coded bit) in maximizing the normalized throughput in connection with the channel state of the indoor multipath fading channels. One observation made is that the maximum throughput with BPSK modulation is attained when the code rate is chosen as low as possible irrespective of the channel state, and the processing gain is increased (decreased) as the channel becomes worse (better). The other observation made is that when DPSK modulation is employed, there exists an optimal combination of the code rate and the processing gain in maximizing the normalized throughput for each channel state. Based on these observations, we propose to adapt the processing gain and/or code rate according to the fading conditions in order to maximize the normalized throughput. We analyze the performance of the proposed scheme and compare it with the non-adaptive data transmission scheme. Our results show that the adaptive transmission scheme yields a significant performance improvement over the nonadaptive scheme, and increasing the adaptation level is more effective as the channel gets worse, but the 3-state adaptation seems to be practically optimum.

This paper presents a Fault-Tolerant Object Group (FTOG) model that provides the group management service and the fault-tolerance service for consistency maintenance and state transparency. Through Intelligent Home Network Simulator, we verify that FTOG model supports both of reliability and the stability of the distributed system.

Atmospheric radio ducts can trap VHF/UHF radio waves and propagate them over long distances. 284.4625 MHz Japanese radio wave signal measurements show that the radio waves are propagated to Korea coastal regions when ground temperatures exceed 10C. This paper discusses the reasons for the existence of this critical temperature threshold.

The two-sample locally optimum rank detector test statistics for composite signals in additive, multiplicative, and signal-dependent noise are obtained in this letter. Compared with the structure of the one-sample locally optimum rank detector, that of the two-sample locally optimum rank detector is shown to be simpler, although it needs more computations. It is known that there is a trade-off of computational complexity and structural simplicity between the one- and two-sample detectors.

Recently, there has been extensive research on resource allocation schemes for multicast services that would satisfy the requirements of multimedia traffic. Although several schemes have been proposed to improve the performance of individual multicast groups, it is not easy to achieve both throughput efficiency and user fairness. In this study, we propose a new multicast scheduling scheme for achieving proportional fair (PF) allocation in wireless cellular systems. The basic idea of PF is to schedule the user whose corresponding instantaneous channel quality is the highest relative to the average channel condition over a given time scale. We first extend the PF metric to the extent that the scheduler can reflect the user's varying channel gain, and fairness, not only in the unicast case, but also in multicast transmissions. A multicast PF scheme maximizes the summation of the logarithmic average rate of all multicasting users. Thus, it improves the fairness to mobile users when compared to max-rate allocation, because the logarithmic rate gives more weight to lower rate users, while achieving high throughput. Moreover, the proposed scheme is less complex than max-rate allocation.

This letter investigates the effects of spatial correlation on several multiple antenna schemes in multiuser environments. Using an order statistics upper bound on achievable capacity, we quantify the interaction among spatial correlation, spatial diversity, spatial multiplexing and multiuser diversity. Also, it is verified that the upper bound is tighter than asymptotic capacity when the number of users is relatively small.

We propose a new call admission control (CAC) scheme for voice calls in cellular mobile communication networks. It is assumed that the rejection of a hand-off call is less desirable than that of a new call, for a hand-off call loss would cause a severe mental pain to a user. We consider the pains of rejecting new and hand-off calls as different costs. The key idea of our CAC is to restrict the admission of new calls in order to minimize the total expected costs per unit time over the long term. An optimal policy is derived from a semi-Markov decision process in which the intervals between successive decision epochs are exponentially distributed. Based on this optimal policy, we calculate the steady state probability for the number of established voice connections in a cell. We then evaluate the probability of blocking new calls and the probability of forced termination of hand-off calls. In the numerical experiments, it is found that the forced termination probability of hand-off calls is reduced significantly by our CAC scheme at the slight expense of the blocking probability of new calls and the channel utilization. Comparison with the static guard channel scheme is made.

Two main characteristics of VBR MPEG video traffic are the different statistics according to different picture types and the periodic traffic pattern due to GOP structure. Especially, the I-pictures at the beginning of each GOP generate much more traffic than other pictures. Therefore, when several VBR MPEG video sources are superposed, the multiplexing performance can vary according to the variations of their I-picture start times. In this paper, we show how the start time arrangement of the superposed VBR MPEG videos can significantly affect the cell loss ratio characteristics at the multiplexers, by using U-NDPP/D/1/B queueing model. It is also shown that the Lognormal distribution is more suitable for modeling VBR MPEG video traffic than the Normal and Gamma distributions, in the queueing application's view points.

The downlink beamforming weights which can suppress interfering signals toward out-of-cell mobile stations for a TDD-based OFDMA system are introduced. First, the downlink beamforming weights are optimally designed based on iteration. Then, the downlink beamforming weights are designed in a sub-optimal way. It is shown that the sub-optimally designed downlink beamforming weights have the same structure as that of the uplink beamforming weights which are derived based on MMSE. The performance of these schemes is compared based on the average receive SINR. The performance of a heuristic scheme which exploits uplink beamforming weights for downlink beamforming weights is also investigated.

In this paper there suggested is a bifurcated (or multiple) input-queued ATM switch in which a buffer for each input port is divided into multiple (m) buffer blocks, i. e. , bifurcated buffers, for enhancement of the limited throughput of the ordinary input-queued switch using a single FIFO. As the contention/arbitration rule for the bifurcated input-queued switching scheme, free and restricted contention rules are come up with and discussed. The free rule allows an input port to switch up to m cells at the cost of internal speedup. With the restricted rule, on the other hand, an input port can switch no more than one cell in a time slot so that the switch operates at the same speed as the external link speed. The throughput bound for the bifurcated input-queued switch is analyzed for both rules through the generalization of the analysis by Karol et al. The throughput bound approaches to 1.0 as m becomes large enough, irrespective of the contention/arbitration rule.

We consider power and rate adaptations in multicarrier (MC) direct-sequence code-division multiple-access (DS/CDMA) communications under the assumption that channel state information is provided at both the transmitter and the receiver. We propose, as a power allocation strategy in the frequency domain, to transmit each user's DS waveforms over the user's sub-band with the largest channel gain, rather than transmitting identical DS waveforms over all sub-bands. We then adopt channel inversion power adaptation in the time domain, where the target user's received power level maintains at a fixed value. We also investigate rate adaptation in the time domain, where the data rate is adapted such that a desired transmission quality is maintained. We analyze the BER performance of the proposed power and rate adaptations with fixed average transmission power, and show that power adaptation in both the frequency and the time domains or combined power adaptation in the frequency domain and rate adaptation in the time domain make significant performance improvement over the power adaptation in the frequency domain only. We also compare the performance of the proposed power and rate adaptation schemes in MC-DS/CDMA systems to that of power and rate adapted single carrier DS/CDMA systems with RAKE receiver.

In this paper, an improved B-picture coding algorithm based on the symmetric bi-directional motion estimation (ME) is proposed. In addition to the block match error between blocks in the forward and backward reference frames, the proposed method exploits the previously-reconstructed template regions in the current and reference frames for bi-directional ME. The side match error between the predicted target block and its template is also employed in order to alleviate block discontinuities. To efficiently perform ME, an initial motion vector (MV) is adaptively derived by exploiting temporal correlations. Experimental results show that the number of generated bits is reduced by up to 9.31% when the proposed algorithm is employed as a new macroblock (MB) coding mode for the H.264/AVC standard.

In this letter, the diversity-multiplexing tradeoff (DMT) function for a special half-duplex dynamic decode and forward (DDF) relay protocol using two source-antennas, two destination-antennas, and more than two relay-antennas is derived. It is shown that the performance of the DDF relay protocol can be substantially improved by increasing the relay-antenna number, but only for low multiplexing gains.