• 디지털콘텐츠학회 논문지
• /
• 제5권2호
• /
• pp.101-105
• /
• 2004

The block error probabilities of noncoherent frequency shift keying in a Nakagami fading channel are presented in this papaer. The channel fading speed, show or fast. is consider in evaluating block error probabilities. The effectiveness of diversity combing and error correction coding in improving block error performance is examined. The effect of cochannel interference on block error performance is also studied in this paper.

• Journal of information and communication convergence engineering
• /
• 제4권4호
• /
• pp.131-135
• /
• 2006

In this paper, we discusses that the theoretical analysis is made for the performance of FS MC-CDMA by the aid of the Nakagami fading channels and the block error probabilities of the FS MC-CDMA in Nakagami fading channel are presented. The channel fading speed, slow or fast, is considered in evaluating block error probabilities. The effectiveness of diversity combining in improving block error performance is examined.

• Journal of information and communication convergence engineering
• /
• 제1권3호
• /
• pp.119-122
• /
• 2003

In this paper presents equations which describe an average weighted spectrum of errors and average block error probabilities for noncoherent frequency shift keying (NCFSK) used in D-branch maximal ratio combining (MRC) diversity in independent very slow nonselective Nakagami fading channels. The average is formed over the instantaneous receiver signal to noise ratio (SNR) after combining. the analysis is limited to additive Gaussian noise.

• Journal of Communications and Networks
• /
• 제5권2호
• /
• pp.124-134
• /
• 2003

In this paper, we investigate the error probability performance of noncoherently detected orthogonal modulation combined with Alamouti space-time block coding. We find that there are two types of pair-wise error probabilities that characterize the performance. We employ methods that allow a direct evaluation of exact, closed-form expressions for these error probabilities. Theoretical as well as numerical results show that noncoherent orthogonal modulation combined with space-time block coding (STBC) achieves full spatial diversity. We derive an expression for approximate average bit error probability for-ary orthogonal signaling that allows one to show the tradeoff between increased rate and performance degradation.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.466-472
• /
• 2007

Single carrier block transmission with frequency domain equalization(SC-FDE) has been shown to be a promising candidate in ultra-wideband(UWB) communications. In this paper, we analyze the performance of SC-FDE over UWB communications with channel estimation error. The probability density functions of the frequency domain minimum mean-squared error(MMSE) equalizer taps are derived in closed form. The error probabilities of single carrier block transmission with frequency domain MMSE equalization under imperfect channel estimation are presented and evaluated numerically. Compared with the simulation results, our semi-analytical analysis yields fairly accurate bit error rate performance, thus validating the use of the Gaussian approximation method in the performance analysis of the SC-FDE system with channel estimation error.

• 한국항행학회논문지
• /
• 제12권2호
• /
• pp.115-121
• /
• 2008

본 논문에서는 DS-CDMA 시스템 구현 시 복잡성을 감소시키는 다중접속간섭 등의 여러 감쇠 요인을 고려하여 이를 개선시킬 수 있는 FS MC-CDMA 시스템의 성능을 분석하고 열악한 무선 모바일 환경에서 성능 개선기법인 BCH 부호화기법을 채용하여 FS MC-CDMA 시스템의 성능을 개선하였다. 또한 차세대 무선 모바일 통신 채널 환경으로는 나카가미 페이딩을 적용하여 FS MC-CDMA 시스템의 성능을 분석하여 검토하였다.

• 한국정보처리학회논문지
• /
• 제2권5호
• /
• pp.677-690
• /
• 1995

본 논문에서는 블럭정렬과 선두 이동법에 의해 처리된 계열을 VF(Variable to Fixed)형 산술부호로 압축하는 방법을 제시한다. 길이 N으로 분해된 부분열을 1기호씩 순회시킨 후 사전식 순서로 정렬한다. 순회정렬된 부분열은 국소적으로 유사기호가 밀 집되기 때문에 이 성질을 활용하기 위하여 선두 이동법을 적용한다. 이와 같이 전처리 된 계열에 대해 오류전파를 1 부호어 이내로 제한할 수 있는 VF형 산술부호 로 엔트 로피 부호화한다. VF형 산술부호의 효율은 고정 크기의 부호어 집합을 어떻게 분할하 는가가 관건이다. 제안하는 VFAC(VF Arithmetic Code)는 새로 설정되는 정보원 기호에 대하여 완전분할을 이루게 하고, 반복적인 그레이 변환을 이용하여 발생기호의 확률을 효과적으로 나타낸다. 제안 방식의 성능을 컴퓨터 시뮬레이션을 통하여 엔트로피, 압 축율 및 처리속도의 측면에서 기존의 방식과 비교 분석한다.

• Ocean Systems Engineering
• /
• 제9권3호
• /
• pp.287-328
• /
• 2019

Comprehensive understanding of the flood risk assessments via frequency analysis often demands multivariate designs under the different notations of return periods. Flood is a tri-variate random consequence, which often pointing the unreliability of univariate return period and demands for the joint dependency construction by accounting its multiple intercorrelated flood vectors i.e., flood peak, volume & durations. Selecting the most parsimonious probability functions for demonstrating univariate flood marginals distributions is often a mandatory pre-processing desire before the establishment of joint dependency. Especially under copulas methodology, which often allows the practitioner to model univariate marginals separately from their joint constructions. Parametric density approximations often hypothesized that the random samples must follow some specific or predefine probability density functions, which usually defines different estimates especially in the tail of distributions. Concentrations of the upper tail often seem interesting during flood modelling also, no evidence exhibited in favours of any fixed distributions, which often characterized through the trial and error procedure based on goodness-of-fit measures. On another side, model performance evaluations and selections of best-fitted distributions often demand precise investigations via comparing the relative sample reproducing capabilities otherwise, inconsistencies might reveal uncertainty. Also, the strength & weakness of different fitness statistics usually vary and having different extent during demonstrating gaps and dispensary among fitted distributions. In this literature, selections efforts of marginal distributions of flood variables are incorporated by employing an interactive set of parametric functions for event-based (or Block annual maxima) samples over the 50-years continuously-distributed streamflow characteristics for the Kelantan River basin at Gulliemard Bridge, Malaysia. Model fitness criteria are examined based on the degree of agreements between cumulative empirical and theoretical probabilities. Both the analytical as well as graphically visual inspections are undertaken to strengthen much decisive evidence in favour of best-fitted probability density.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.