• Title/Summary/Keyword: Zero-error probability

Search Result 43, Processing Time 0.024 seconds

A Study on the Efficient Interference Cancellation for Multi-hop Relay Systems (다중 홉 중계 시스템에서 효과적인 간섭 제거에 관한 연구)

  • Kim, Eun-Cheol;Cha, Jae-Sang;Kim, Seong-Kweon;Lee, Jong-Joo;Kim, Jin-Young;Kang, Jeong-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.47-52
    • /
    • 2009
  • The transmitted signal from a source is transmitted to a destination through wireless channels. But if the mobile destination is out of the coverage of the source or exists in the shady side of the coverage, the destination can not receiver the signal from the source and they can not maintain communication. In order to overcome these problems, we adopt relays. A system employing relays is a multi-hop relay system. In the multi-hop relay system, coverages of each relay that is used for different systems can overlap each other in some place. When there is a destination in this place, interference occurs at the destination. In this paper, we study on the efficient co-channel interference (CCI) cancellation algorithm. In the proposed strategy, CCI is mitigated by zero forcing (ZF) or minimum mean square error (MMSE) receivers. Moreover, successive interference cancellation (SIC) with optimal ordering algorithm is applied for rejecting CCI efficiently. And we analyzed and simulated the proposed system performance in Rayleigh fading channel. In order to justify the benefit of the proposed strategy, the overall system performance is illustrated in terms of bit error probability.

  • PDF

Variable selection and prediction performance of penalized two-part regression with community-based crime data application

  • Seong-Tae Kim;Man Sik Park
    • Communications for Statistical Applications and Methods
    • /
    • v.31 no.4
    • /
    • pp.441-457
    • /
    • 2024
  • Semicontinuous data are characterized by a mixture of a point probability mass at zero and a continuous distribution of positive values. This type of data is often modeled using a two-part model where the first part models the probability of dichotomous outcomes -zero or positive- and the second part models the distribution of positive values. Despite the two-part model's popularity, variable selection in this model has not been fully addressed, especially, in high dimensional data. The objective of this study is to investigate variable selection and prediction performance of penalized regression methods in two-part models. The performance of the selected techniques in the two-part model is evaluated via simulation studies. Our findings show that LASSO and ENET tend to select more predictors in the model than SCAD and MCP. Consequently, MCP and SCAD outperform LASSO and ENET for β-specificity, and LASSO and ENET perform better than MCP and SCAD with respect to the mean squared error. We find similar results when applying the penalized regression methods to the prediction of crime incidents using community-based data.

Multiple Description Coding using Unequal MDSQ in Wavelet Domain

  • Yoon, Eung-Sik;Park, Kwang-Pyo;Lee, Keun-Young
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.281-284
    • /
    • 2002
  • Error resilience for image coding is an important component of multimedia communication system. Error resilience schemes address loss recovery from the compression perspective. Multiple description coding (MDC) is one of the error resilience techniques promising for robust video transmission. It is the way to achieve tradeoff description such as scalar quantization, correlating transform and the quantized frame expansion. In this paper, we consider Multiple Description Scalar Quantization (MDSQ) to wavelet domain. Conventional MDSQ schemes considered description with equal weights in each sub-bands. But, we can see that the each sub-bands is unequal contribution to whole image quality. Therefore, we experiment the multiple design MDSQ table to make probability of zero index high, which gives high efficiency in arithmetic symbol coder. We also compare our proposed method with the conventional methods and show improved performance in terms of redundancy-rate-distortion.

  • PDF

Detection Probability as a Symbol Synchronization Timing at the Lead of Each Received Delay OFDM Signal in Multipath Delay Profile (멀티패스 지연프로필의 각 수신지연파의 선두에서 OFDM 신호의 심벌 동기타이밍으로의 검출확률)

  • Joo, Chang-Bok;Park, Dong-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.2
    • /
    • pp.55-61
    • /
    • 2007
  • In this paper, we represent the maximum detection probability formulas of symbol synchronization timing at each received delay signal in multipath channel delay profile in the multiplied correlation and difference type correlated symbol synchronization timing detection method. The computer simulation results show that the correlation symbol timing detection method have maximum detection probability at the lead of received delay signal of highest amplitude, but the difference type of correlation symbol timing detection method always have maximum detection probability at the lead of first received delay signal in the multipath channel models. Using this results, we show the BER characteristics difference between the IEEE802.11a OFDM signals which is obtained in case of the symbol synchronization timing is taken at zero error(perfect) timing position and at -1 sample error symbol timing position from perfect timing position in the multipath channel models regardless the length of channel delay spread.

Linear Unequal Error Protection Codes based on Terminated Convolutional Codes

  • Bredtmann, Oliver;Czylwik, Andreas
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.12-20
    • /
    • 2015
  • Convolutional codes which are terminated by direct truncation (DT) and zero tail termination provide unequal error protection. When DT terminated convolutional codes are used to encode short messages, they have interesting error protection properties. Such codes match the significance of the output bits of common quantizers and therefore lead to a low mean square error (MSE) when they are used to encode quantizer outputs which are transmitted via a noisy digital communication system. A code construction method that allows adapting the code to the channel is introduced, which is based on time-varying convolutional codes. We can show by simulations that DT terminated convolutional codes lead to a lower MSE than standard block codes for all channel conditions. Furthermore, we develop an MSE approximation which is based on an upper bound on the error probability per information bit. By means of this MSE approximation, we compare the convolutional codes to linear unequal error protection code construction methods from the literature for code dimensions which are relevant in analog to digital conversion systems. In numerous situations, the DT terminated convolutional codes have the lowest MSE among all codes.

Performance analysis of asynchronous DS-CDMA system with MRC diversity in fading channels

  • Seo, Seok;Lee, Chan-kil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11A
    • /
    • pp.1237-1243
    • /
    • 2004
  • This paper presents and analyses the closed-form expression of the average bit error rate (BER) for an asynchronous direct-sequence code division multiple access (DS-CDMA) system with coherent binary phase shift keying (BPSK) modulation scheme using a maximal ratio combining (MRC) diversity over a Rician fading channel. In addition to the average BER, outage probability, and user capacity of system are estimated as performance measures. The results are general enough so that it includes Rayleigh fading and nonfading channel with zero and infinite Rician factor, respectively, as special cases. The effects of various channel models, processing gains, and diversity orders on the system performances are also considered for the typical multipath delay profiles characterized by Rician fading channel.

Enhanced watermarking scheme based on removal of local means (지역 평균값 제거를 통한 개선된 워터마킹 방법)

  • 강현수;홍진우;김광용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1106-1111
    • /
    • 2002
  • This paper presents a new watermarking scheme to reduce the detection error probability through removal of local mean values of an original signal equivalently. At first, we show that the error probability is reduced by the removal of the local mean values. In the removal process, we are in need of a method that equivalently removes the local mean values without modification of the original signal since the process changes the original signal. The method is based on the principle that as the watermark with zero local mean values is embedded, the local mean values of the original signal is equivalently removed in detection of the watermark. The principle are analytically proven, and the superiority of the proposed method is verified by experiments for variety of watermarks.

An enhanced Spread Spectrum Watermarking Algorithm based on Ordering Map (순서 맵에 기반한 개선된 주파수 확산 워터마킹)

  • 서동완;최윤식
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.118-122
    • /
    • 2000
  • Nowadays, it is popular to use the spread spectrum watermarking algorithm for still image. But there is high error probability of the retrieved watermark in the spread spectrum owing to the correlation between image and spreaded watermark sequence. In this paper, two methods are proposed. One is Ordering Map Method and the other is Alteration of Image. Based on pixel value, the order by which the spreaded watermark bits is embedded is created in Ordering Map Method. By the covariance function between image and the spreaded sequence, image is altered in Alteration of Image. Hence, bit error of retrieved watermark is clearly reduced to zero by this two method.

  • PDF

Optimization of the construction scheme of the cable-strut tensile structure based on error sensitivity analysis

  • Chen, Lian-meng;Hu, Dong;Deng, Hua;Cui, Yu-hong;Zhou, Yi-yi
    • Steel and Composite Structures
    • /
    • v.21 no.5
    • /
    • pp.1031-1043
    • /
    • 2016
  • Optimization of the construction scheme of the cable-strut tensile structure based on error sensitivity analysis is studied in this paper. First, the element length was extracted as a fundamental variable, and the relationship between element length change and element internal force was established. By setting all pre-stresses in active cables to zero, the equation between the pre-stress deviation in the passive cables and the element length error was obtained to analyze and evaluate the error effects under different construction schemes. Afterwards, based on the probability statistics theory, the mathematical model of element length error is set up. The statistical features of the pre-stress deviation were achieved. Finally, a cable-strut tensile structure model with a diameter of 5.0 m was fabricated. The element length errors are simulated by adjusting the element length, and each member in one symmetrical unit was elongated by 3 mm to explore the error sensitivity of each type of element. The numerical analysis of error sensitivity was also carried out by the FEA model in ANSYS software, where the element length change was simulated by implementing appropriate temperature changes. The theoretical analysis and experimental results both indicated that different elements had different error sensitivities. Likewise, different construction schemes had different construction precisions, and the optimal construction scheme should be chosen for the real construction projects to achieve lower error effects, lower cost and greater convenience.

Novel Interference Cancellation Scheme in Cooperation Communication Environment (협력통신 환경에서의 새로운 간섭제거 기법)

  • Kim, Yoon Hyun;Park, Young Sik;Shin, Dong Soo;Hwang, Yu Min;Kim, Jin Young;Rho, Jung Kyu
    • 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.