Gaussian function

Summary

In mathematics, a Gaussian function, often simply referred to as a Gaussian, is a function of the base form f(x) = \exp (-x^2) and with parametric extension f(x) = a \exp\left( -\frac{(x - b)^2}{2c^2} \right) for arbitrary real constants a, b and non-zero c. It is named after the mathematician Carl Friedrich Gauss. The graph of a Gaussian is a characteristic symmetric "bell curve" shape. The parameter a is the height of the curve's peak, b is the position of the center of the peak, and c (the standard deviation, sometimes called the Gaussian RMS width) controls the width of the "bell". Gaussian functions are often used to represent the probability density function of a normally distributed random variable with expected value μ = b and variance σ2 = c2. In this case, the Gaussian is of the form g(x) = \frac

Official source

https://en.wikipedia.org/wiki/Gaussian_function

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (100)

Related publications

Related people (25)

Related people

Related units (18)

Related units

Related concepts (38)

In physics and mathematics, the Fourier transform (FT) is a transform that converts a function into a form that describes the frequencies present in the original function. The output of the transfo

Scale-space theory is a framework for multi-scale signal representation developed by the computer vision, and signal processing communities with complementary motivations from physics and biological

In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence. The polynomials arise in:

signal processing as Hermitian wavelets for wavelet transform analysis
probabil

Related concepts

Related courses (103)

Related courses

Related lectures (212)

Related lectures

A new REM conjecture

Véronique Gayrard

We introduce here a new universality conjecture for levels of random Hamiltonians, in the same spirit, as the local REM conjecture made by S. Mertens and H. Bauke. We establish our conjecture for a wide class of Gaussian and non-Gaussian Hamiltonians, which include the P-spin models, the Sherrington-Kirkpatrick model and the number partitioning problem. We prove that our universality result is optimal for the last two models by showing when this universality breaks down.

Birkhauser Boston, C/O Springer-Verlag, Service Center, 44 Hartz Way, Secaucus, Nj 07096-2491 Usa2008

Secret Key Generation Over Wireless Channels Using Short Blocklength Multilevel Source Polar Coding

Yanina Yurina Shkel

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short block-length regime. Inspired by the state-of-the-art performance provided by polar codes in the short blocklength regime for channel coding, we propose an explicit protocol based on polar codes for generating the secret keys. This protocol differs from previously proposed key generation protocols based on polar coding in two main ways: (i) we consider a Gaussian source for the key generation; (ii) we focus on the short block-length regime. Simulation results show that the proposed protocol performs well even for very short blocklengths, especially if one can relax the BER requirements for the generated keys. They also demonstrate that the polar code based protocol outperforms a similar one using LDPC codes in place of polar codes, and that this advantage grows the shorter the blocklength becomes.

IEEE2021

Secret Key Generation Using Short Blocklength Polar Coding Over Wireless Channels

Yanina Yurina Shkel

This paper investigates the problem of secret key generation from correlated Gaussian random variables in the short blocklength regime. Short blocklengths are commonly employed in massively connected IoT sensor networks in 5G and beyond wireless systems. Polar codes have previously been shown to be applicable to the secret key generation problem, and are known to perform well for short blocklengths in the channel coding context. Inspired by these findings, we propose an explicit protocol based on polar codes for generating secret keys in the short blocklength regime. This protocol differs from previously proposed key generation protocols based on polar coding in two main ways: (i) we consider a Gaussian source for the key generation; (ii) we focus on the short blocklength regime. Simulation results show that the proposed protocol performs well even for very short blocklengths, especially if one can relax the BER/BLER requirements for the generated keys. They also demonstrate that the polar code based protocol outperforms a similar one using LDPC codes in place of polar codes, and that this advantage grows the shorter the blocklength becomes.

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022