Showing 1-25 of 37,566 resultsfor "Index Terms":Gaussian Approximation
"Index Terms":Gaussian Approximation
- Sort
Get notified when new research is published matching your search criteria.
Sort By
Results
An adaptive level of detail approach to nonlinear estimation
2010 IEEE International Conference on Acoustics, Speech and Signal Processing
Year: 2010 | Conference Paper |
Cited by: Papers (6)
In this work, we present a general method for approximating non-linear transformations of Gaussian mixture random variables. It is based on transforming the individual Gaussians with the unscented transform. The level of detail is adapted by iteratively splitting those components of the initial mixture that exhibited a high degree of nonlinearity during transformation. After each splitting operati...Show More
The non validity of the gaussian approximation for multi-user interference in ultra wide band impulse radio: from an inconvenience to an advantage - transactions papers
The huge potential of ultra wide band impulse radio (UWB IR) with multiple access was initially evaluated using the standard Gaussian approximation which assumed that multi user interference could be approximated as classical Gaussian noise. Later the standard Gaussian approximation has been proved to be invalid in several cases. Thus the performance of the classical UWB IR correlation receiver dr...Show More
Cognitive radio is an emerging technology which offers dynamic and opportunistic access to under utilized spectrum resources. Energy detection is the dominantly used spectrum sensing approach owing to its low computational complexity and ability to identify spectrum holes without requiring a priori knowledge of primary transmission characteristics. In this paper, we discuss the challenges in using...Show More
Eigenvalue ratio detection based on exact moments of smallest and largest eigenvalues
Muhammad Zeeshan Shakir;Wuchen Tang;Anlei Rao;Muhammad Ali Imran;Mohamed-Slim Alouini
2011 6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM)
Year: 2011 | Conference Paper |
Detection based on eigenvalues of received signal covariance matrix is currently one of the most effective solution for spectrum sensing problem in cognitive radios. However, the results of these schemes always depend on asymptotic assumptions since the close-formed expression of exact eigenvalues ratio distribution is exceptionally complex to compute in practice. In this paper, non-asymptotic spe...Show More
One-dimensional Gaussian Density Function Segmentation Based on Piecewise Linear Approximation
Nasrallah Tahir;Malika Boudraa;El-Sedik Lamini;Ahmed Amine El Ouchdi
2023 International Conference on Advances in Electronics, Control and Communication Systems (ICAECCS)
Year: 2023 | Conference Paper |
Cited by: Papers (1)
One of the main challenges in embedding popular audio-visual applications is the hardware implementation of one-dimensional Standard Gaussian density function. The aim of this work is to contribute with an approach to ease this implementation. The degree-l polynomial approximation has been used to segment the considered function. An interesting feature of the proposed approach is that the number o...Show More
Construction of Polar Codes Based on Piecewise Gaussian Approximation
2021 17th International Symposium on Wireless Communication Systems (ISWCS)
Year: 2021 | Conference Paper |
Cited by: Papers (1)
In this paper, we investigate the construction of polar codes by Gaussian approximation (GA) and develop an approach based on piecewise Gaussian approximation (PGA). In particular, with the piecewise approach we obtain a function that replaces the original GA function with a more accurate approximation, which results in significant gain in performance. The proposed PGA construction of polar codes ...Show More
Performance Analysis of Low Density Parity-Check Codes over the Bernoulli-Gaussian Channel
2019 16th Canadian Workshop on Information Theory (CWIT)
Year: 2019 | Conference Paper |
This paper investigates the performance of low density parity-check codes transmitted over the Bernoulli-Gaussian (BG) impulsive noise channel. First, the capacity of the BG channel is investigated. Next, the performance thresholds of regular low density parity-check codes are proposed based on the Gaussian approximation method. Finally, bit error rate performance based on Monte Carlo simulations ...Show More
Small Sample Size Performance of the Energy Detector
IEEE Communications Letters
Cited by: Papers (36)
We examine the small sample size performance of the energy detector for spectrum sensing in AWGN. By making use of the cube-of-Gaussian approximation of chi-squared random variables, we derive a novel, simple, and accurate analytical expression for the minimum number of samples required to achieve a desired probability of detection and false alarm. This way, the number of samples can be calculated...Show More
A simple polynomial approximation to the gaussian Q-function and its application
IEEE Communications Letters
Cited by: Papers (55)
A simple polynomial approximation to the Gaussian Q-function is proposed, based on the observation that a Gaussian random variable can be well approximated by a sum of uniform random variables. The approximation can be used to obtain accurate explicit approximations to problems that otherwise do not have explicit solutions or approximate explicit solutions. As an example, an explicit expression fo...Show More
An Improved Nonlinear Fitting Method and Its Application in Function Approximation Based on Particle Swarm Algorithm
2014 7th International Conference on Intelligent Computation Technology and Automation
Year: 2014 | Conference Paper |
Standard normal distribution is widely used in engineering. But it is not so convenient during application, because the analytic expression of the distribution function does not exist. In this paper, the Particle Swarm Algorithm is applied in the nonlinear fitting process of standard normal distribution, and different modified methods are used to obtain analytical expressions of standard normal di...Show More
Efficient Decoding of Low Density Lattice Codes
Shuiyin Liu;Yi Hong;Emanuele Viterbo;Alessia Marelli;Rino Micheloni
This letter describes a low complexity belief propagation decoder for low density lattice codes (LDLC). Compared with the fastest decoder in the literature, the memory usage and computational complexity at each variable node is reduced from O(2d) to O(d), where d is the degree of LDLC. The cost at each check node remains at O(d). The key idea is to compute each variable message based on 2d - 2 Gau...Show More
Does Vector Gaussian Approximation After LMMSE Filtering Improve the LLR Quality?
IEEE Signal Processing Letters
Cited by: Papers (5)
In this letter, we investigate the extrinsic log-likelihood ratio (LLR) computation of a soft-input soft-output equalizer used in a turbo equalization system. The optimum LLRs are obtained by a maximum a posteriori -based equalizer, which may be computationally expensive. Thus, several reduced-complexity equalizers have been proposed. The most promising approach first applies linear minimum mean s...Show More
Approximate state-space Gaussian processes via spectral transformation
2016 IEEE 26th International Workshop on Machine Learning for Signal Processing (MLSP)
Year: 2016 | Conference Paper |
Cited by: Papers (5)
State-space representations of Gaussian process regression use Kalman filtering and smoothing theory to downscale the computational complexity of the regression in the number of data points from cubic to linear. As their exact implementation requires the covariance function to possess rational spectral density, rational approximations to the spectral density must be often used. In this article we ...Show More
Error probability analysis of bit-interleaved coded modulation
This correspondence presents a simple method to accurately compute the error probability of bit-interleaved coded modulation (BICM). Thanks to the binary-input output-symmetric (BIOS) nature of the channel, the pairwise error probability (PEP) is equal to the tail probability of a sum of random variables with a particular distribution. This probability is in turn computed with a saddlepoint approx...Show More
Useful Mathematical Tools for Capacity Approaching Codes Design
IEEE Communications Letters
Cited by: Papers (18)
Focus of this letter is the oldest class of codes that can approach the Shannon limit quite closely, i.e., low-density parity-check (LDPC) codes, and two mathematical tools that can make their design an easier job under appropriate assumptions. In particular, we present a simple algorithmic method to estimate the threshold for regular and irregular LDPC codes on memoryless binary-input continuous-...Show More
A simplified Gaussian approximation algorithm for polar codes
2017 3rd IEEE International Conference on Computer and Communications (ICCC)
Year: 2017 | Conference Paper |
Cited by: Papers (4)
Gaussian approximation (GA) is widely used for constructing polar codes. However, due to the complex integration required in exact GA (EGA) algorithm, the computational complexity will increase exponentially with the polarization levels. Though the conventional approximate GA (AGA) succeeds in reducing the computational complexity, it results in a disastrous loss in the performance of frame error ...Show More
A Simple Method to Calculate Random-Coding Union Bounds for Ultra-Reliable Low-Latency Communications
Ultra-Reliable Low-Latency Communications are based on very short codes whose performances cannot be evaluated correctly by using the Shannon capacity formula holding for asymptotically large code lengths. The use of Random-Coding Union Bounds (RCUB’s) has been suggested in the literature as an alternative for this application. Unfortunately, their calculation is difficult and the Gaussian approxi...Show More
High-performance analog delays: surpassing Bessel-Thomson by Pade-approximated Gaussians
2006 IEEE International Symposium on Circuits and Systems
Year: 2006 | Conference Paper |
Cited by: Papers (11)
The frequency-domain exponential transfer function of a delay function cannot be realized with a finite number of lumped elements. Therefore an approximation of a rational quotient of polynomials has to be used. While the use of Bessel polynomials results in the well-known all-pole Bessel-Thomson approximation, a Taylor expansion of the exponential transfer function of a delay around one point res...Show More
Gaussian Approximation Optimized SC- Flip Decoding Algorithm of Polar Codes
2020 IEEE 4th Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)
Year: 2020 | Conference Paper |
Cited by: Papers (4)
The polar codes proposed by Arikan is the first channel code proved to achieve the symmetric capacity of any binary input discrete memoryless channel (BDMC). Besides, the polar codes have been chosen for the eMBB control channels in the 5th generation mobile communication system. However, the successive cancellation flip (SCF) decoding algorithm of polar codes has a high average complexity at low ...Show More
Performance Analysis of LDPC-BICM System Based on Gaussian Approximation
IEEE Transactions on Broadcasting
Cited by: Papers (4)
In this paper, we propose a performance analysis algorithm of low density parity check-bit interleaved coded modulation (LDPC-BICM) system. First, we introduce the Gaussian mixture approximation method of the LLR messages output from the demodulator over the AWGN channel. Then, we analyze the density evolution based on these Gaussian mixture approximation LLR messages. During the analysis, the Gau...Show More
Influence of fading on the Gaussian approximation for BPSK and QPSK with asynchronous cochannel interference
We investigate the performance of BPSK and QPSK with coherent detection and matched filtering in the presence of both time and phase asynchronous cochannel interfering signals. More precisely, we analyze the role played by different channel statistics on the distribution of the decision variable at the output of the matched filter. The results show that the Gaussian approximation is accurate not o...Show More
Alternative Gaussian spot size polynomial for use with doped fiber amplifiers
IEEE Photonics Technology Letters
Cited by: Papers (29)
The validity of the usual Marcuse-Gaussian approximation for fiber modes is discussed in the context of doped fiber amplifiers and an proposed: omega /a=(0.616+1.66/V/sup 1.5/+0.987/V/sup 6/). The polynomial's use is illustrated by extending the range of a simple Gaussian-based, numerical model of an erbium-doped fiber amplifier. Excellent agreement with a real-field-based model is demonstrated fo...Show More
Interpretation of polar codes with Plotkin construction based on Gaussian approximation
2017 Eighth International Workshop on Signal Design and Its Applications in Communications (IWSDA)
Year: 2017 | Conference Paper |
Cited by: Papers (2)
In this paper, we interpret the polar codes based on Plotkin construction perspective. We briefly review the rate allocation for component codes of Plotkin codes and the construction of polar codes based on Gaussian approximation. Then, we show that the recursively constructed Plotkin codes can be a class of polar codes. And also, the polar codes are a class of Plotkin code having minimum threshol...Show More
A Gaussian Symbol-Level Model for CDMA Forward Link Intracell Interference
This paper presents a Gaussian approximation for intracell interference on the forward link of a code division multiple access system with fast power control. A probability density function (PDF) is derived for the transmit power variations of each user due to power control adjustments. The PDF is then used to determine the variance of a Gaussian random variable that approximates intracell interfe...Show More
Variability in centred house-of-cards mutation models
Convergence of variability in phenotypic models with balance between selection and mutation is analysed. The mutation assumed occurs with weak probability and brings down the evolutionary process built up by selection around the mean in the population. Gaussian approximations are used.Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.