• Journal of Communications and Networks
• /
• v.5 no.4
• /
• pp.354-364
• /
• 2003

A general method for the evaluation of the symbol error probability (SER) of ultra wideband (UWB) systems with various kind of modulation schemes (N-PAM, M-PPM, Bi-Orthogonal), in presence of multipath channel, multiuser and strong narrowband interference, is presented. This method is shown to be able to include all the principal multiaccess techniques proposed so far for UWB, time hopping (TH), direct sequence (DS) and optical orthogonal codes (OOC). A comparison between the performance of these multiple access and modulation techniques is given, for both ideal Rake receiver and minimum mean square error (MMSE) equalizer. It is shown that for all the analyzed multiple access schemes, a Rake receiver exhibits a high error floor in presence of narrowband interference (NBI) and that the value of the error floor is in-fluenced by the spectral characteristics of the spreading code. As expected, an MMSE receiver offers better performance, representing a promising candidate for UWB systems. When the multiuser interference is dominant, all multiple access techniques exhibit similar performance under high-load conditions. If the number of users is significantly lower than the spreading factor, then DS outperforms both TH and OOC. Finally 2PPM is shown to offer better performance than the other modulation schemes in presence of multiuser interference; increasing the spreading factor is proposed as a more effective strategy for SER reduction than the use of time diversity.

• Journal of Advanced Navigation Technology
• /
• v.9 no.1
• /
• pp.56-60
• /
• 2005

To calculate the probability of bit error of UWB communication systems, the exact expression of multiple access interference is essential. So far, in many researches, MAI has been modeled by the Gaussian Approximation, which leads to the huge errors. And there are some tries to obtain the exact model fot the MAI but they have some problems such as long calculation time. We introduce the simple expression to calculate the probability of error of an UWB-TH system with BPSK. The multiple access interference is explained by the characteristic function method combined with the Gaussian approximation. It allows us to easily and fast calculate the bit error rate of an UWB-TH system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.95-100
• /
• 2011

This paper analyzes the interference effect of WLAN(Wireless Local Area Network) service on WiBro(Wireless Broadband) service in adjacent frequency band by using Monte Carlo method. For the analysis, we make scenario that WLAN service operates on frequency band of 2401 MHz ~ 2423 MHz and WiBro service operates on frequency band of 698 MHz ~ 704 MHz. In case of WiBro receiver is close to WLAN AP(Access Point), the interference will be increased. So, we calculate the protection distance between WiBro receiver and WLAN AP to meet interference probability of 5 % below and required interference power of WLAN AP to meet interference probability of 5 % below in the case of fixed protection distance. As a result, the protection distance of 60 m and -9.5 dBm of required interference power of WLAN AP at 10 m of the fixed protection distance are analyzed.

• Journal of Satellite, Information and Communications
• /
• v.9 no.3
• /
• pp.98-103
• /
• 2014

In this paper, we propose and analyze a novel interference cancellation scheme in cooperation communication environment in which a large number of users exist. In cooperative communication system consisting a source, destination, and relay, ad-hoc groups undergo a rapid degradation because of interference data form adjacent ad-hoc groups. To solve these problems, we propose Zero Forcing (FC) and Minimum Mean Square Error (MMSE) and make a dent in the magnitude of interference. Finally, we can obtain orignal data using Successive Interference Cancellation (SIC). The performance of proposed scheme is analyzed in terms of a bit error probability. The results of the paper can be applied to design of various ad-hoc networks for cooperation communication systems.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.40-49
• /
• 1989

A variable-state block interference channel model is presented which matches asynchronous multiple-access slow frequency-hopped spread-spectrum systems which suffer from bursts of interference of variable duration. For variable-state block interference channels test pattern techniques combined with interleaving are presented from which the decoder obtain side information about channel states. By examining test patterns the decoder estimates which parts of data blocks are affected by interference and regards the parts of blocks affected by interference as erasures. Since the presence of test patterns reduces the number of bits for data transmission, test patterns are not useful for variable-state block interference channels for small hit probability, It is shown that test patterns increase the capacities of variable-state block interference channels for large hit probability. It is also shown that test patterns provide a almost full side information about channel states for certain values of parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.2
• /
• pp.115-121
• /
• 2013

LED-ID (Light Emitting Diode-Identification) network is envisioned to be the next generation indoor wireless communication medium by which simultaneously high speed data transmission, identification, and illumination are possible. In spite of being extremely promising, it suffers from much impairment. Signals having different propagation paths can suffer from delays, and phase shifts which will eventually result interference. The probability of interference is also increased when communication links are established between a tag and several readers. Therefore it is necessary to reduce the interference in LED-ID network to ensure quality of service. It is possible to avoid interference by knowing the information about readers prior to assign the available spectrum. In this paper, we have proposed dynamic spectrum decision using cognitive radio concept. The simulation results justify that the proposed scheme is better than the conventional scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.39-50
• /
• 2010

In this paper, we analyze and simulate the performance of a tactics mobile communication system based on ultra wide band (UWB) in multi-user interference (MUI) environments. This system adopts a double binary turbo code for forward error correction (FEC). Wireless channel is modeled a modified Saleh and Valenzuela (SV) model. We employ a space time block coding (STBC) scheme for enhancing system performance. System performance is evaluated in terms of bit error probability. From the simulation results, it is confirmed that the tactics mobile communication system based on UWB, which is encoded with the double binary turbo code, can achieve a remarkable coding gain with reasonable encoding and decoding complexity in multi-user interference environments. It is also known that the bit error probability performance of the tactics mobile communication system based on UWB can be substantially improved by increasing the number of iterations in the decoding process for a fixed cod rate. Besides, we can demonstrate that the double binary turbo coding scheme is very effective for increasing the number of simultaneous users for a given bit error probability requirement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.469-476
• /
• 2008

In this paper we analyze the packet interference probability and the aggregated throughput of a WPAN in which a number of Bluetooth piconets share the ISM band with WLANS. Using an Adaptive Frequency Hopping algorithm, when the AFH is employed, the number of hops available to the Bluetooth piconets varies depending on the number of independent WLANs within the piconet's radio range. Using a packet collision model in a piconet cluster, we give an analysis of the packet interference probability and the aggregated throughput as a function of the available hops for the AFH algorithm. We also present an analytical model of packet interference with multi-path fading channel in a cluster of piconets. Through analysis, we obtain the packet collision probability and aggregated throughput assuming capture effect. Numerical examples are given to demonstrate the effect of various Parameters such as capture ratio, Rice factor and cluster size on the system performance.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.8
• /
• pp.1242-1249
• /
• 2017

In this paper, we propose a new algorithm for the performance analysis of the sidelobe blanker (SLB) in radar system, which is based on the matrix pencil method (MPM). In general, the SLB in radar is composed of the main antenna, the auxiliary antenna, and the processing unit. The auxiliary antenna with wide beamwidth receives interference signals such as jamming or clutter signals. The main antenna with high gain receives the target signal in the main beam and the interference signals in the sidelobe. In this paper the Swerling model is used as the target echo signal by considering a probabilistic radar cross section (RCS) of the target. To estimate the SLB performance it needs to calculate the probability of target detection and the probability of blanking the interference by using the signals received from the main and auxiliary antennas. The detection probability and the blanking probability include multiple summations of infinite series with infinite integrations, of which convergence rate is very slow. Increase of summation range to improve the calculation accuracy may lead to an overflow error in computer simulations. In this paper, to resolve the above problems, we used the MPM to calculate a summation of infinite series and improved the calculation accuracy and the convergence rate.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.