• Title/Summary/Keyword: Theoretical Performance Bound

Search Result 33, Processing Time 0.023 seconds

Analysis of TDOA and TDOA/SS Based Geolocation Techniques in a Non-Line-of-Sight Environment

  • Huang, Jiyan;Wan, Qun
    • Journal of Communications and Networks
    • /
    • v.14 no.5
    • /
    • pp.533-539
    • /
    • 2012
  • The performance analysis of wireless geolocation in a non-line-of-sight (NLOS) environment is a very important issue. Since Cramer-Rao lower bound (CRLB) determines the physical impossibility of the variance of an unbiased estimator being less than the bound, many studies presented the performance analysis in terms of CRLB. Several CRLBs for time-of-arrival (TOA), pseudo-range TOA, angle-of-arrival (AOA), and signal strength (SS) based positioning methods have been derived for NLOS environment. However, the performance analysis of time difference of arrival (TDOA) and TDOA/SS based geolocation techniques in a NLOS environment is still an opening issue. This paper derives the CRLBs of TDOA and TDOA/SS based positioning methods for NLOS environment. In addition, theoretical analysis proves that the derived CRLB for TDOA is the same as that of pseudo-range TOA and the TDOA/SS scheme has a lower CRLB than the TDOA (or SS) scheme.

PAC-Learning a Decision Tree with Pruning (의사결정나무의 현실적인 상황에서의 팩(PAC) 추론 방법)

  • Kim, Hyeon-Su
    • Asia pacific journal of information systems
    • /
    • v.3 no.1
    • /
    • pp.155-189
    • /
    • 1993
  • Empirical studies have shown that the performance of decision tree induction usually improves when the trees are pruned. Whether these results hold in general and to what extent pruning improves the accuracy of a concept have not been investigated theoretically. This paper provides a theoretical study of pruning. We focus on a particular type of pruning and determine a bound on the error due to pruning. This is combined with PAC (Probably Approximately Correct) Learning theory to determine a sample size sufficient to guarantee a probabilistic bound on the concept error. We also discuss additional pruning rules and give an analysis for the pruning error.

  • PDF

Theoretical Performance Bounds and Parallelization of a Two-Dimensional Packing Algorithm (이차원 팩킹 알고리즘의 이론적 성능 분석과 병렬화)

  • Hwang, In-Jae;Hong, Dong-Kweon
    • The KIPS Transactions:PartA
    • /
    • v.10A no.1
    • /
    • pp.43-48
    • /
    • 2003
  • Two-dimensional packing algorithm can be used for allocating submeshes in mesh multiprocessor systems. Previously, we developed an efficient packing algorithm called TP heuristic, and showed how the results of the packing could be used for allocating submeshes. In this paper, we present theoretical performance bounds for TP heuristic. We also present a parallel version of the algorithm that consumes reduced time when it is executed by multiple processors in mesh multiprocessors.

MARGIN-BASED GENERALIZATION FOR CLASSIFICATIONS WITH INPUT NOISE

  • Choe, Hi Jun;Koh, Hayeong;Lee, Jimin
    • Journal of the Korean Mathematical Society
    • /
    • v.59 no.2
    • /
    • pp.217-233
    • /
    • 2022
  • Although machine learning shows state-of-the-art performance in a variety of fields, it is short a theoretical understanding of how machine learning works. Recently, theoretical approaches are actively being studied, and there are results for one of them, margin and its distribution. In this paper, especially we focused on the role of margin in the perturbations of inputs and parameters. We show a generalization bound for two cases, a linear model for binary classification and neural networks for multi-classification, when the inputs have normal distributed random noises. The additional generalization term caused by random noises is related to margin and exponentially inversely proportional to the noise level for binary classification. And in neural networks, the additional generalization term depends on (input dimension) × (norms of input and weights). For these results, we used the PAC-Bayesian framework. This paper is considering random noises and margin together, and it will be helpful to a better understanding of model sensitivity and the construction of robust generalization.

Doppler-shift estimation of flat underwater channel using data-aided least-square approach

  • Pan, Weiqiang;Liu, Ping;Chen, Fangjiong;Ji, Fei;Feng, Jing
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.7 no.2
    • /
    • pp.426-434
    • /
    • 2015
  • In this paper we proposed a dada-aided Doppler estimation method for underwater acoustic communication. The training sequence is non-dedicate, hence it can be designed for Doppler estimation as well as channel equalization. We assume the channel has been equalized and consider only flat-fading channel. First, based on the training symbols the theoretical received sequence is composed. Next the least square principle is applied to build the objective function, which minimizes the error between the composed and the actual received signal. Then an iterative approach is applied to solve the least square problem. The proposed approach involves an outer loop and inner loop, which resolve the channel gain and Doppler coefficient, respectively. The theoretical performance bound, i.e. the Cramer-Rao Lower Bound (CRLB) of estimation is also derived. Computer simulations results show that the proposed algorithm achieves the CRLB in medium to high SNR cases.

Performance Bounds for MMSE Linear Macrodiversity Combining in Rayleigh Fading, Additive Interference Channels

  • Smith, Peter J.;Gao, Hongsheng;Clark, Martin V.
    • Journal of Communications and Networks
    • /
    • v.4 no.2
    • /
    • pp.102-107
    • /
    • 2002
  • The theoretical performance of MMSE linear microdiversity combining in Rayleigh fading, additive interference channels has already been derived exactly in the literature. In the macrodiversity case the fundamental difference is that any given source may well have different average received powers at the different antennas. This makes an exact analysis more difficult and hence for the macrodiversity case we derive a bound on the mean BER and a semi-analytic upper bound on outage probabilities. Hence we provide bounds on the performance of MMSE linear microdiversity combining in Rayleigh fading with additive noise and any number of interferers with arbitrary powers.

Performance evaluations of chip-spreading orthogonal code divisio moudlation system (칩확산 직교부호분할변조 방식의 성능 평가)

  • 김병훈;이병기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.9
    • /
    • pp.1998-2004
    • /
    • 1997
  • In this paper, we have analyzed the bit error performance ofthe chip-spreading OCDM system proposed in the previous papaer and compared the results, through computer simulations, with those of conventional DS/CDMA system which employs the maximal ration combining method. WE have shown, analytically, that the BER upper bound of the OCDM system coincides with that of the conventional DS/CDMA system and the lower bound exhibits much improved results. From the simulation results, we have confirmed that the BER curves of proposed OCDM system actually lie between the two theoretical bounds and its performance is superior to that of the DS/CDMA system.

  • PDF

Degrees of Freedom of Two-Cluster MIMO Multiway Relay Interference Channels Using Blind Interference Neutralization

  • Zhang, Bowei;Feng, Wenjiang;Dong, Tingting;Deng, Yina
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.168-186
    • /
    • 2016
  • In this paper, we investigate the degrees of freedom (DoF) of a two-cluster multiple-input multiple-output (MIMO) multiway relay interference channel (mRIC), where there are two relays and two users per cluster. In this channel, users within the same cluster exchange messages among themselves with the help of two relays.We first obtain the DoF upper bound of the considered MIMO mRIC based on cut-set bound. Then, we propose a novel transmission strategy, blind interference neutralization (BIN), to approach the DoF upper bound. This new method utilizes the overheard information at two relays and focuses on the beamforming matrix designs at two relays so that the channel state information (CSI) at users is not required. Through theoretical analysis and numerical simulations, we show that the DoF upper bound can be obtained by using the BIN scheme. From simulation results, we show that the proposed BIN scheme can provide significant performance gain over the conventional time division multiple access (TDMA) scheme in terms of DoF. In addition, we show that the BIN scheme is a superior approach to the existing signal space alignment (SSA) schemes for the considered mRIC.

A Comparative Study on Interference-Limited Two-Way Transmission Protocols

  • Xia, Xiaochen;Zhang, Dongmei;Xu, Kui;Xu, Youyun
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.351-363
    • /
    • 2016
  • This paper investigates the performance of interference-limited two-way transmission protocols in the Rayleigh fading channels. New lower bound of outage probability and approximate expression of bit error rate (BER) for three-phase two-way relaying (3P-TWR) protocol are derived in closed-form. These expressions are valid for arbitrary signal-to-noise ratio values, numbers of co-channel interferers and amajority of modulation formats employed in the practical system. Then a comparative study is developed for the performance of three two-way transmission protocols, i.e., direct transmission (DT) protocol, two-phase two-way relaying (2P-TWR) protocol and 3P-TWR protocol based on the asymptotic expressions of outage probability and BER. On the basis of the theoretical results, the thresholds on the strength (variance) of direct channel and target rate for the relative performance of different protocols are obtained and the effect of interferences at the terminal and relay on the relative performance is analyzed. The results present key insights on how to choose proper two-way transmission protocol with the knowledge of fading channels, required date rate and modulation format to optimize the system performance in the practical interference-limited scenarios. Simulation results are presented to validate the theoretical analysis.

Performance analysis of precoding-aided differential spatial modulation systems with transmit antenna selection

  • Kim, Sangchoon
    • ETRI Journal
    • /
    • v.44 no.1
    • /
    • pp.117-124
    • /
    • 2022
  • In this paper, the performance of precoding-aided differential spatial modulation (PDSM) systems with optimal transmit antenna subset (TAS) selection is examined analytically. The average bit error rate (ABER) performance of the optimal TAS selection-based PDSM systems using a zero-forcing (ZF) precoder is evaluated using theoretical upper bound and Monte Carlo simulations. Simulation results validate the analysis and demonstrate a performance penalty < 2.6 dB compared with precoding-aided spatial modulation (PSM) with optimal TAS selection. The performance analysis reveals a transmit diversity gain of (NT-NR+1) for the ZF-based PDSM (ZF-PDSM) systems that employ TAS selection with NT transmit antennas, NS selected transmit antennas, and NR receive antennas. It is also shown that reducing the number of activated transmit antennas via optimal TAS selection in the ZF-PDSM systems degrades ABER performance. In addition, the impacts of channel estimation errors on the performance of the ZF-PDSM system with TAS selection are evaluated, and the performance of this system is compared with that of ZF-based PSM with TAS selection.