• Journal of information and communication convergence engineering
• /
• v.15 no.1
• /
• pp.21-27
• /
• 2017

In this research, we study the outage probability for distributed space-time coding-based cooperative (DSTC) systems with amplify-and-forward relaying over Rayleigh fading channels with a high temporal correlation where the direct link between the source and the destination is available. In particular, we derive the upper and lower bounds of the outage probability as well as their corresponding asymptotic expressions. In addition, using only the average channel powers for the source-to-relay and relay-to-destination links, we propose an efficient power allocation scheme between the source and the relay to minimize the asymptotic upper bound of the outage probability. Through a numerical investigation, we verify the analytical expressions as well as the effectiveness of the proposed efficient power allocation. The numerical results show that the lower and upper bounds tightly correspond to the exact outage probability, and the proposed efficient power allocation scheme provides an outage probability similar to that of the optimal power allocation scheme that minimizes the exact outage probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12A
• /
• pp.1223-1228
• /
• 2006

Closed-form expressions for capacity bounds of multiuser diversity combined with maximum ratio transmission (MRT) and maximum ratio combining (MRC) at each link are presented under the assumption of independent and quasi-static flat multiple-input multiple-output (MIMO) Rayleigh fading channels. The analysis results precisely agree with the numerical verification results and clearly show the impact of MRT/MRC on multiuser diversity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.126-148
• /
• 2015

Different from the existing works on coverage problems in wireless sensor networks (WSNs), this paper considers the exposure-path prevention problem by using the percolation theory in three dimensional (3D) WSNs, which can be implemented in intruder detecting applications. In this paper, to avoid the loose bounds of critical density, a bond percolation-based scheme is proposed to put the exposure-path problem into a 3D uniform lattice. Within this scheme, the tighter bonds of critical density for omnidirectional and directional sensor networks under random sensor deployment-a 3D Poisson process are derived. Extensive simulation results show that our scheme generates tighter bounds of critical density with no exposure path in 3D WSNs.

• Communications of the Korean Mathematical Society
• /
• v.35 no.4
• /
• pp.1143-1158
• /
• 2020

In this paper, we are concerned with the blow-up phenomena for a class of pseudo-parabolic equations with weighted source u_t - △u - △u_t = a(x)f(u) subject to Dirichlet (or Neumann) boundary conditions in any smooth bounded domain Ω ⊂ ℝⁿ (n ≥ 1). Firstly, we obtain the upper and lower bounds for blow-up time of solutions to these problems. Moreover, we also give the estimates of blow-up rate of solutions under some suitable conditions. Finally, three models are presented to illustrate our main results. In some special cases, we can even get some exact values of blow-up time and blow-up rate.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.250-256
• /
• 2011

A two-way relaying (TWR) system is analyzed, where two source terminals with unequal numbers of antennas exchange data via an amplify-and-forward relay terminal with a single antenna. In the system considered herein, the link quality between the sources and relay can generally be asymmetric due to the nonidentical antenna configuration, power allocation, and relay location. In such a general setup, accurate bounds on the average sum rate (ASR) are derived when beamforming or orthogonal space time block coding is employed at the sources. We show that the proposed bounds are almost indistinguishable from the exact ASR under various system configurations. It is also observed that the ASR performance of the TWR system with unequal numbers of source antennas is more sensitive to the relay location than to the power allocation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1546-1553
• /
• 1996

The bit error probability of RS/trellis concatenated coded-modualtion system in the mobile radio channel is analyzed. A new upper bound to the symbol error probability of the inner TCM in the mobile radio channel is obtained by exploiting the unequal symbol error probability of the TCM. This bound is applied to the derivation of the upper bound to the bit error probability of the concatenated coded-modulation system. An efficient way of searching distance spectrum of the TCM in mobile radio channel is devised. Our new bounds are tighter than the earlier studied other bounds.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11C
• /
• pp.907-910
• /
• 2010

This paper presents the design of block lengths for irregular low-density parity-check (LDPC) codes based on the maximum variable degree $d_{{\upsilon},max}$. To design a block length, the performance degradation of belief-propagation (BP) decoding performance from upper bounds on the maximum likelihood (ML) decoding performance is used as an important factor. Since for large block lengths, the performance of irregular LDPC codes is very close to the Shannon limit, we focus on moderate block lengths ($5{\times}10^2\;{\leq}\;N\;{\leq}\;4{\times}10^3$). Given degree distributions, the purpose of our paper is to find proper block lengths based on the maximum variable degree $d_{{\upsilon},max}$. We also present some simulation results which show how a block length can be optimized.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.523-542
• /
• 2014

One-dimensional arrays with subscripts formed by induction variables in real programs appear quite frequently. For most famous data dependence testing methods, checking if integer-valued solutions exist for one-dimensional arrays with references created by induction variable is very difficult. The I test, which is a refined combination of the GCD and Banerjee tests, is an efficient and precise data dependence testing technique to compute if integer-valued solutions exist for one-dimensional arrays with constant bounds and single increments. In this paper, the non-continuous I test, which is an extension of the I test, is proposed to figure out whether there are integer-valued solutions for one-dimensional arrays with constant bounds and non-sing ularincrements or not. Experiments with the benchmarks that have been cited from Livermore and Vector Loop, reveal that there are definitive results for 67 pairs of one-dimensional arrays that were tested.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.67-80
• /
• 2014

Spectrum sensing is vital for secondary unlicensed nodes to coexist and avoid interference with the primary licensed users in cognitive wireless networks. In this paper, we develop models for bounding interference levels from secondary network to the primary nodes within a spectrum sensing framework. Instead of classical stochastic approaches where Poisson point processes are used to model transmitters, we consider a more practical model which takes into account the medium access control regulations and where the secondary Poisson process is judiciously thinned in two phases to avoid interference with the secondary as well as the primary nodes. The resulting process will be a modified version of the Mat$\acute{e}$rn point process. For this model, we obtain bounds for the complementary cumulative distribution function of interference and present simulation results which show the developed analytical bounds are quite tight. Moreover, we use these bounds to find the operation regions of the secondary network such that the interference constraint is satisfied on receiving primary nodes. We then obtain theoretical results on the primary and secondary throughputs and find the throughput limits under the interference constraint.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.231-240
• /
• 2015

To facilitate the base station planning in high speed railway communication systems, it is necessary to consider the functional relationships between the base station transmit power and space parameters such as train velocity and cell radius. Since these functions are able to present some inherent system properties determined by its spatial topology, they will be referred to as the power-space functions in this paper. In light of the fact that the line-of-sight path persists the most power of the received signal of each passing train, this paper considers the average transmission rate and bounds on power-space functions based on the additive white Gaussian noise channel (AWGN) model. As shown by Monte Carlo simulations, using AWGN channel instead of Rician channel introduces very small approximation errors, but a tractable mathematical framework and insightful results. Particularly, lower bounds and upper bounds on the average transmission rate, as well as transmit power as functions of train velocity and cell radius are presented in this paper. It is also proved that to maintain a fixed amount of service or a fixed average transmission rate, the transmit power of a base station needs to be increased exponentially, if the train velocity or cell radius is increased, respectively.