Method for estimating a channel impulse response between a source and a receiver, data transmitted by the source being coded and organized as data symbols, data symbols being converted from serial to parallel and spread in the frequency domain by a Discrete Fourier Transform, the data symbols spread by the Discrete Fourier Transform being mapped on P sub-carriers allocated for transmission among N sub-carriers of a frequency band, transformed back in the time domain by an Inverse Discrete Fourier Transform module, parallel to serial converted and transferred to the receiver under the form of signals representative of data symbols, the method comprising the steps, executed by the receiver of: - determining a first matrix with size PxL, L being the number of taps assumed in the channel impulse response and determining a Discrete Fourier Transform matrix of size PxP the first matrix being constituted of the first L columns of a PxP non-normalized Discrete Fourier Transform matrix, - demodulating the receiving the signals representative of data symbols, - serial to parallel converting, executing a Discrete Fourier Transform and demapping the parallel converted Discrete Fourier Transformed received signals, from N subcarriers to P subcarriers in order to produce demapped received data symbols, characterized in that the method comprises the step of: - estimating (S503 to S510) iteratively the channel impulse response from the demapped received data symbols, the channel estimation being dependent of the first matrix, the Discrete Fourier Transform matrix and of a second matrix which is defined according to a posteriori probabilities that the transferred data symbols are equal to possible modulation symbols of the modulation scheme, the denominator of the impulse channel response being at next iteration the trace of the second matrix which is a diagonal matrix, the elements of which being diagonal elements of a third matrix obtained from the Discrete Fourier Transform matrix and from a fourth matrix, the elements of the fourth matrix being equal to: R k, k = ∑ l = 0 M − 1 APP i X k = α l α l 2 and R l, j = ∑ y = 0 M − 1 ∑ x = 0 M − 1 APP i X l = α x ⋅ APP i X j = α y + α x α y * for l ≠ j where APP i ( X k = α l) is the a posteriori probability that data symbol X k is equal to α l, α l is the l -th modulation symbol of the possible modulation symbols, M is the total number of possible modulation symbols and (.) * denotes the conjugate of (.) and the the second matrix is equal to: R FX = diag diagM FRF † where diag (.) denotes a diagonal matrix, in which vector (.) is the diagonal, diagM (.) denotes a vector made of the elements of the diagonal of the matrix (.), F is the Discrete Fourier Transform matrix and (.) † denotes the transpose conjugate of (.). - determining a first matrix with size PxL, L being the number of taps assumed in the channel impulse response and determining a Discrete Fourier Transform matrix of size PxP the first matrix being constituted of the first L columns of a PxP non-normalized Discrete Fourier Transform matrix, - demodulating the receiving the signals representative of data symbols, - serial to parallel converting, executing a Discrete Fourier Transform and demapping the parallel converted Discrete Fourier Transformed received signals, from N subcarriers to P subcarriers in order to produce demapped received data symbols, - estimating (S503 to S510) iteratively the channel impulse response from the demapped received data symbols, the channel estimation being dependent of the first matrix, the Discrete Fourier Transform matrix and of a second matrix which is defined according to a posteriori probabilities that the transferred data symbols are equal to possible modulation symbols of the modulation scheme, the denominator of the impulse channel response being at next iteration the trace of the second matrix which is a diagonal matrix, the elements of which being diagonal elements of a third matrix obtained from the Discrete Fourier Transform matrix and from a fourth matrix, the elements of the fourth matrix being equal to: R k, k = ∑ l = 0 M − 1 APP i X k = α l α l 2 and R l, j = ∑ y = 0 M − 1 ∑ x = 0 M − 1 APP i X l = α x ⋅ APP i X j = α y + α x α y * for l ≠ j where APP i ( X k = α l) is the a posteriori probability that data symbol X k is equal to α l, α l is the l -th modulation symbol of the possible modulation symbols, M is the total number of possible modulation symbols and (.) * denotes the conjugate of (.) and the the second matrix is equal to: R FX = diag diagM FRF † where diag (.) denotes a diagonal matrix, in which vector (.) is the diagonal, diagM (.) denotes a vector made of the elements of the diagonal of the matrix (.), F is the Discrete Fourier Transform matrix and (.) † denotes the transpose conjugate of (.).