EP3553953A1 - Approximation of log-likelihood ratios for soft decision decoding in the presence of impulse noise channels - Google Patents

Approximation of log-likelihood ratios for soft decision decoding in the presence of impulse noise channels Download PDF

Info

Publication number
EP3553953A1
EP3553953A1 EP18305464.2A EP18305464A EP3553953A1 EP 3553953 A1 EP3553953 A1 EP 3553953A1 EP 18305464 A EP18305464 A EP 18305464A EP 3553953 A1 EP3553953 A1 EP 3553953A1
Authority
EP
European Patent Office
Prior art keywords
signal
function
parameters
modified
encoded signal
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP18305464.2A
Other languages
German (de)
French (fr)
Inventor
Vincent DIMANCHE
Guillaume GELLE
Alban Goupil
Laurent CLAVIER
Salvatore GUZZO BONIFACIO
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Centre National de la Recherche Scientifique CNRS
Universite Lille 2 Droit et Sante
Universite de Reims Champagne Ardenne URCA
Original Assignee
Centre National de la Recherche Scientifique CNRS
Universite Lille 2 Droit et Sante
Universite de Reims Champagne Ardenne URCA
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Centre National de la Recherche Scientifique CNRS, Universite Lille 2 Droit et Sante, Universite de Reims Champagne Ardenne URCA filed Critical Centre National de la Recherche Scientifique CNRS
Priority to EP18305464.2A priority Critical patent/EP3553953A1/en
Priority to PCT/EP2019/059526 priority patent/WO2019197657A1/en
Publication of EP3553953A1 publication Critical patent/EP3553953A1/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/45Soft decoding, i.e. using symbol reliability information
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63Joint error correction and other techniques
    • H03M13/6337Error control coding in combination with channel estimation
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65Purpose and implementation aspects
    • H03M13/6577Representation or format of variables, register sizes or word-lengths and quantization
    • H03M13/658Scaling by multiplication or division
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0064Concatenated codes
    • H04L1/0066Parallel concatenated codes

Definitions

  • the invention is related to methods and systems for processing an encoded signal received from a noisy channel, in particular before the decoding of the encoded signal.
  • Sensor networks and ad hoc networks are wireless communication networks capable of organizing themselves without previously defined infrastructures. These networks are experiencing developments in many areas, from home applications to military applications.
  • Modern codes such as turbo codes or Low Density Parity Check (LDPC) codes can be used, with iterative decoding algorithms, trying to improve the quality of information being decoded iteration after iteration.
  • the decoding of these codes uses as input the signal exiting from the channel, which may be in the form of log likelihood ratio (LLR).
  • LLR log likelihood ratio
  • the calculation of the LLR is based on channel modeling and depends largely on the distribution of the additive noise and interference. To do so, it is known to use a Gaussian model, which quickly reaches its limits and poorly matches the multiple communications in a network, i.e. the multiple access interferences generated by the nodes of a sufficiently dense network, which have an impulsive character and strongly influence the quality of the reception of information at the destination nodes. These interferences do not present Gaussian distributions but can be modeled by stable distributions which are characterized by a slower decay of the tails than in the Gaussian case, as described in the article of Hassen Benmaad et al. "Clipping demapper for LDPC decoding in impulsive channel", IEEE Communications Letters, Institute of Electrical and Electronics Engineers, 2013, 17 (5), pp.968-971 .
  • the main difficulty of changing the metric lies in the fact that the distribution of the interference is not necessarily a priori known. It depends on the network configuration, for instance the density of users and the design of the layers of Media Access Control (MAC). If stable distribution is quite a general model, there is not however an explicit form of the density, making the LLR extremely complex to compute.
  • MAC Media Access Control
  • the known p-norm is an advantageously chosen solution because it only requires a rough estimate of the stable distribution, and not the estimation of the noise parameters
  • the invention aims at satisfying this need by providing a method for processing an encoded signal S received from a noisy channel, in particular with impulsive noise in wireless transmission, prior to the decoding of the signal by a decoder, the method comprising:
  • the signal processing of the invention provides a generic method that can be implemented on many different types of receivers. It does not necessitate modification in the transmitter and can simply be added to existing protocols at the receiver side. It also has the advantage of not degrading communications in case of traditional communication conditions with a simple thermal Gaussian noise. Furthermore, the method is self-adaptive and can be used in many different settings, with different noise distributions.
  • the processing method according to the invention provides better results than state-of-the-art methods, allowing obtaining much more correctly decoded packets.
  • the improvement is particularly significant if noise has an impulsive behavior.
  • Transmitters and receivers used for implementing the method according to the invention are usually driven by separate hardware clocks, the carrier frequency set up at the transmitter and the receiver sides may not be exactly the same. It is thus advantageous to perform a step of synchronization, for estimating and correcting carrier shift that may be introduced, to generate the encoded signal S.
  • the synchronization included in state-of-the-art systems is capable to apply the necessary correction in the case of noiseless signals or with a low level of noise.
  • the default correction mechanism is not precise enough.
  • An example of a BPSK modulated signal, with the presence of carrier offset, is illustrated in Fig. 7 .
  • the signal is composed of around 40000 samples, with a carrier offset of approximately 140Hz.
  • the presence of carrier impairment produces the identified effect in the image: the amplitude, affected by noise, is not regular, and seems almost modulated, with a sinusoidal shape for the envelop.
  • Carrier shift effect is also visible in constellation diagrams, with the spread of the samples in a circle.
  • an iterative process is advantageously defined, performed over a range of frequencies ⁇ f min ⁇ ⁇ f ⁇ ⁇ f Max , in order to obtain frequency offset correction.
  • the aforementioned loop may be composed of the following steps: apply a temporary offset correction ⁇ f , as defined above, estimate phase shift of the constellation, using for example linear approximation, compensate estimated phase shift, and compute synchronization metric as defined above.
  • the encoded signal S comprises a plurality of symbols a k , the first function being applied to an amplitude x associated to each symbol.
  • a matched filtering may be applied in order to minimize Inter-Symbol Interference, followed by a decimation operation for extracting, from the oversampled signal, one sample per symbol.
  • a step of symbol synchronization may be used to detect the synchronization sequence, which depends on the used protocol and is included in the encoded signal in order to identify the beginning of the useful data, also called "payload".
  • a PSK Detect step is responsible for the analysis of the signal, in order to associate one of the admissible point in the constellation to each symbol of the sequence.
  • a step of symbol demapping then transforms the symbol sequence to a binary sequence, which corresponds to the output for the decoding.
  • a Forward Error Correction code is used, such a binary decision is not optimal, and a soft decision, that is to say based on real values, is preferable.
  • the quantized decimated values may be used for extract amplitudes, as can be seen in Fig. 9 .
  • the method may comprise normalizing the amplitudes of the encoded signal S before estimation of the parameters a, b, and application of the first function f a,b .
  • Such amplitude normalization is useful to compensate path loss attenuation, due to the propagation of the signal over the channel, in particular in case of a wireless channel.
  • the first function is preferably a non-linear function providing a parametrized approximation of log likelihood ratio.
  • FIG. 12 An example of the first function f a,b is represented in Fig. 12 .
  • all input amplitudes x in absolute value that are below a threshold s x are preferably processed using a linear part of the first function f a,b , and all amplitudes x that exceed said threshold s x are processed using an hyperbola type part of the first function f a,b .
  • the linear part of the first function f a,b may be determined by a slope that can introduce a non-negligible amplification effect on the output signal. This amplification may introduce amplitude values out of the admissible range of the decoding algorithm.
  • This normalization operation on the modified signal S' is useful to resize overall amplitudes and re-establish the limits within tolerable boundaries.
  • the normalized samples keep the original shape of the non-normalized samples but with an adapted dynamic range.
  • the goal is to estimate the values of a and b that can optimize the mutual information based on the channel condition estimated for the encoded signal S.
  • the coefficient a and b may be estimated using an information theory criterion in order to maximize the mutual information between the encoded signal and the sequence after the non-linear mapping, based on a learning sequence.
  • the estimation of the parameters a, b is performed by a non-linear optimization algorithm, preferably a Nelder-Mead algorithm.
  • a non-linear optimization algorithm preferably a Nelder-Mead algorithm.
  • Other algorithms may be used, for example a search on a predefined grid.
  • the input signal AS for the estimation of the parameters a, b is called "autodidact signal”. This signal corresponds to an approximated isolation of the estimated noise component introduced by the channel.
  • the invention also provides a system for processing an encoded signal S received from a noisy channel, in particular with impulsive noise in wireless transmission, prior to the decoding of the signal by a decoder, the system comprising:
  • the system may further comprise a module adapted for normalizing the amplitudes of the encoded signal S before estimation of the parameters a, b and application of the first function f a,b .
  • the invention also provides a computer program product for processing an encoded signal S received from a noisy channel, in particular with impulsive noise in wireless transmission, prior to the decoding of the signal by a decoder, the computer program product comprising a support and stored on this support instructions that can be read by a processor, these instructions being configured for:
  • an example of a system used in the invention for the transmission and reception of packets over a wireless network comprises an universal software radio peripheral (USRP) and an associated driving computer (PC) at the transmitter side, and a USRP and a PC at the receiver side.
  • the packets are transmitted over a noisy wireless channel.
  • the invention is not limited to wireless transmissions, and can apply to non-wireless transmissions, for example in Power-Line communications or acoustic transmissions.
  • the USRPs in use are for example NI-USRP 2952R.
  • the invention is not limited to the use of a USRP, and a system-on-chip, a DSP or FPGA may also be used.
  • a single USRP equipped with two independent radio interfaces is used to send and receive the signal. In this case, synchronization between transmitter and receiver is automatically achieved due to the share of the same clock at transmitter and receiver sides.
  • the operations performed by the hardware inside the USRP can be abstracted both for transmission and for reception of signals as illustrated in Fig. 2 and Fig. 3 respectively. These operations are necessary for the conversion of the signal between baseband and passband and vice versa.
  • bands centered in 915 MHz and 2.45 GHz may be used, corresponding to bands of Industrial Scientific and Medical bands (ISM).
  • ISM Industrial Scientific and Medical bands
  • the invention is however not limited to specific carrier bands.
  • the USRP In order to transmit a signal over a communication medium, it is necessary to transpose it from the baseband, which is centered around 0Hz, to the desired passband. To do so, the USRP receives the waveform to transmit from the computer, filters and transposes, in a step of up-conversion, the spectrum of the signal. The signal is then encoded and modulated. The signal in passband is amplified prior to be directed toward the antenna to be transmitted over the wireless medium.
  • the operations to be performed at the reception are meant to revert the process performed by the transmitter.
  • the signal captured by the antenna is amplified using a low noise amplifier.
  • the received signal is transposed back to baseband applying the same carrier frequency used by the transmitter.
  • a filtering of the down converted signal is advantageously performed in order to retain only the frequencies of interest.
  • the filtered signal is then sampled and transferred to the computer to be further processed.
  • a step for establishing the setup of the receiver is performed once at startup, similarly to the one at the transmitter, by initializing the USRP with parameters such as carrier frequency, sampling frequency, or amplification factor. During such step, it is also possible to qualify some of the properties that are specific to the coding technique in use.
  • the next step is to acquire the baseband sampled signal produced by the USRP.
  • the data type is an array of complex numbers containing the In-Phase and Quadrature (I/Q) components of each sample, obtained by the down-conversion, as the real and imaginary part of a complex number.
  • a step of extracting useful signal may be performed, in order to estimate the signal and noise level, for extracting from all received samples only those that are likely to carry out a message. This is meant to reduce the execution time avoiding to process samples containing merely noise.
  • a parallelized signal analysis may be implemented, as depicted in Fig. 5 .
  • Each "Process signal” component of parallel processing is in charge to detect boundaries for the presence of a packet. All results are recombined to produce boundaries, and used to create set of samples to be further analyzed. The remaining have been estimated to contain just channel noise.
  • the signal may then be subjected to another sampling process, as shown in Fig. 4 .
  • This is useful to have the correct number of samples per symbol necessary for the further demodulation step.
  • the sampling frequency is often a configurable parameter at the transmitter side, there can be a difference between the requested sampling frequency and the actual sampling frequency, due to hardware limitations. Thus, resampling may be performed to eliminate possible impairments.
  • a further step of demodulation and amplitude extraction which can be decomposed as illustrated in Fig. 6 , is performed in the illustrated example.
  • the resampled noisy signal is preferably low-pass filtered prior to continue further in the demodulation chain, to form the encoded signal S.
  • Fig. 8 shows the result of this synchronization step, performed on the encoded signal S, in time domain.
  • a step of BPSK demodulation with amplitude extraction is performed in order to extract amplitude associated to every symbol of the encoded signal S.
  • This amplitude sequence will be the input for non-linear operation performed in the invention.
  • the transmitted message is retrieved in a step of signal decoding.
  • the validity of the decoded sequence may be verified in a step of "Message display & statistics update".
  • the sequence is subjected to a verification of the cyclic redundancy check (CRC) code added as tail of the payload at the transmitter side. If such verification is successfully passed, the payload, the essential data that is being carried within a packet, is extracted, converted in the string format and displayed for the user.
  • the reception statistics may be updated to keep count of the current received packet as successfully or unsuccessfully decoded.
  • FIG. 10 An example of detailed steps for processing the encoded signal S according to the invention is shown in Fig. 10 .
  • a first step is the beforehand estimation of parameters a, b depending on the channel noise, which are necessary to properly configure the computation of the non-linear first function f a,b , followed by an operation of RMS normalization, before the obtaining of the decoded sequence by a decoding step.
  • a preliminary operation of amplitude normalization is realized.
  • a non-linear function f a , b x min a ⁇ x , b x ⁇ sign x , as illustrated in Fig. 12 , for obtaining a modified signal S' to be decoded.
  • all input amplitudes x in absolute value that are below a threshold s x are processed using a linear part of the first function f a,b , and all amplitudes x that exceed said threshold s x are processed using an hyperbola type part of the first function f a,b .
  • results presented in table form indicating main configuration parameters, are grouped based on the type of coding technique under evaluation.
  • the tables represent the percentage of correctly decoded packets; that is to say which have a CRC check with positive result.
  • y Pr c i 1
  • y with c i the expected code word and y the channel output, used with a normal distribution with ⁇ 0.8, and for the method according to the invention are presented and compared.
  • Performances of the automatic estimation of the channel configuration parameters according to the invention are also shown, in order to determine the improvement in terms of decoding capabilities and to validate the implemented channel estimation technique.
  • transmitter and receiver are played by two completely separated couples of USRP and controlling unit.
  • the two systems do not share the same clock, hence the synchronization operations are important to allow a proper analysis of the processed sampled signal S'.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Noise Elimination (AREA)
  • Error Detection And Correction (AREA)

Abstract

Method for processing an encoded signal (S) received from a noisy channel, in particular with impulsive noise in wireless transmission, prior to the decoding of the signal by a decoder, the method comprising:
- applying to the encoded signal (S) a first function (fa,b ) based on at least two parameters (a, b) depending on the channel noise, for obtaining a modified signal (S') to be decoded, the first function being chosen so as to mitigate the influence of the channel noise during the decoding of the modified signal (S'),
said at least two parameters (a, b) being estimated beforehand by minimizing a second function (J) taking as input a signal (AS) obtained from the encoded signal (S) modified by a processing function using a random binary sequence.

Description

  • The invention is related to methods and systems for processing an encoded signal received from a noisy channel, in particular before the decoding of the encoded signal.
  • Background of the invention
  • Sensor networks and ad hoc networks are wireless communication networks capable of organizing themselves without previously defined infrastructures. These networks are experiencing developments in many areas, from home applications to military applications. The implementation of these networks particularly in the case where they have a large number of communicating entities, such as several sensor nodes in the case of sensor networks, raises new issues such as the appearance of disturbances in transmission, notably interferences, presenting the peculiarity of being of impulsive nature in sufficiently dense networks.
  • To mitigate the disturbances of the system, it is necessary to code the information transmitted in a robust manner. It is known to code the information according to an error correction code which adds a redundancy.
  • Modern codes such as turbo codes or Low Density Parity Check (LDPC) codes can be used, with iterative decoding algorithms, trying to improve the quality of information being decoded iteration after iteration. The decoding of these codes uses as input the signal exiting from the channel, which may be in the form of log likelihood ratio (LLR).
  • The calculation of the LLR is based on channel modeling and depends largely on the distribution of the additive noise and interference. To do so, it is known to use a Gaussian model, which quickly reaches its limits and poorly matches the multiple communications in a network, i.e. the multiple access interferences generated by the nodes of a sufficiently dense network, which have an impulsive character and strongly influence the quality of the reception of information at the destination nodes. These interferences do not present Gaussian distributions but can be modeled by stable distributions which are characterized by a slower decay of the tails than in the Gaussian case, as described in the article of Hassen Benmaad et al. "Clipping demapper for LDPC decoding in impulsive channel", IEEE Communications Letters, Institute of Electrical and Electronics Engineers, 2013, 17 (5), pp.968-971.
  • The use of known iterative-based decoding methods is not efficient anymore to transmit information in an impulsive environment and a significant degradation of the performances of these methods appears and affects the reliability of the decoding of the information. The mismatch between the assumption made to design the receiver and the true interference distribution makes the decoding inefficient.
  • However, the main difficulty of changing the metric lies in the fact that the distribution of the interference is not necessarily a priori known. It depends on the network configuration, for instance the density of users and the design of the layers of Media Access Control (MAC). If stable distribution is quite a general model, there is not however an explicit form of the density, making the LLR extremely complex to compute.
  • The article of Poulliat C. et al, "Performances des codes LDPCpour l'Ultra-Large Bande (ULB) impulsionnelle sous approximation gaussienne généralisée des interférences », in the proceedings of GRETSI conference, 2007, shows the use of a generalized Gaussian approximation of multi-users interferences. The type of considered impulsivity is quite specific and renders the approximation more restrictive.
  • The article of Chuan Hsian, "Iterative SOVA decoding over alpha stable channels", Journal of Engineering Science and Technology, June 2012, vol. 7(3) describes the use of a Cauchy-Bayesan metric. The article of Chuan Hisian, « SOVA decoding in Symmetric Alpha-Stable Noise », Symposium on Information & Computer Sciences, 2011, describes the use of Cauchy function in the path-metric. The Cauchy density is a special case of stable distribution but assumes a high impulsivity and is not adapted to low levels of impulsivity.
  • The article of M. Johnston et al., «Sum-Product Algorithm Utilizing Soft Distances on Additive impulsive Noise Channels », in IEEE Transactions on Communications, vol. 61, no. 6, pp. 2113-2116, June 2013., describes an adapted Sum-Product Algorithm (SPA) increasing the performances with respect to already-known SPA. It modifies the decoding algorithm in a deep manner, which implies a great complexity.
  • The known p-norm is an advantageously chosen solution because it only requires a rough estimate of the stable distribution, and not the estimation of the noise parameters
  • The article of Wei Gui, "Decoding Metric Study for Turbo Codes in Very impulsive Environment", in IEEE Communications Letters, vol. 16, no. 2, pp. 256-258, February 2012, describes the utilization of the p-norm. This norm leads to good performances, but is quite complex to implement.
  • Summary
  • There thus remains a need to further increase decoding performances in the case of transmission over a noisy wireless channel. More specifically, there is a need to reduce the impact that high intensity and low duration noises, also called impulsive noise, can have on the decoding process. Reduction of such an impact can improve the amount of data packets successfully decoded by a receiver, or, equivalently, reducing the packet error rate.
  • The invention aims at satisfying this need by providing a method for processing an encoded signal S received from a noisy channel, in particular with impulsive noise in wireless transmission, prior to the decoding of the signal by a decoder, the method comprising:
    • applying to the encoded signal S a first function fa,b based on at least two parameters a, b, depending on the channel noise, for obtaining a modified signal S' to be decoded, the first function being chosen so as to mitigate the influence of the channel noise during the decoding of the modified signal S',
    wherein said at least two parameters a, b, are estimated beforehand by minimizing a second function J taking as input a signal AS obtained from the encoded signal S modified by a processing function using a random binary sequence.
  • The signal processing of the invention provides a generic method that can be implemented on many different types of receivers. It does not necessitate modification in the transmitter and can simply be added to existing protocols at the receiver side. It also has the advantage of not degrading communications in case of traditional communication conditions with a simple thermal Gaussian noise. Furthermore, the method is self-adaptive and can be used in many different settings, with different noise distributions.
  • The processing method according to the invention provides better results than state-of-the-art methods, allowing obtaining much more correctly decoded packets. The improvement is particularly significant if noise has an impulsive behavior.
  • Synchronization
  • Transmitters and receivers used for implementing the method according to the invention are usually driven by separate hardware clocks, the carrier frequency set up at the transmitter and the receiver sides may not be exactly the same. It is thus advantageous to perform a step of synchronization, for estimating and correcting carrier shift that may be introduced, to generate the encoded signal S.
  • The synchronization included in state-of-the-art systems is capable to apply the necessary correction in the case of noiseless signals or with a low level of noise. In the case of noisy signals, especially with impulsive noise, the default correction mechanism is not precise enough. An example of a BPSK modulated signal, with the presence of carrier offset, is illustrated in Fig. 7. The signal is composed of around 40000 samples, with a carrier offset of approximately 140Hz. The presence of carrier impairment produces the identified effect in the image: the amplitude, affected by noise, is not regular, and seems almost modulated, with a sinusoidal shape for the envelop. Carrier shift effect is also visible in constellation diagrams, with the spread of the samples in a circle.
  • In order to compensate the carrier offset, a synchronization metric
    Figure imgb0001
    may be introduced, defined as: M = mean abs J S c Δf ,
    Figure imgb0002
    where S c Δf
    Figure imgb0003
    represents the corrected sampled sequence from the encoded signal S, using a Δf offset,
    Figure imgb0004
    indicates the imaginary part of the complex number, whereas abs and mean represent absolute value and average operations respectively. Corrected sampled sequence may be obtained by shifting every sample of a Δf offset, in frequency, and defined as: S c Δ f = k S k e i 2 π Δ f k T s ,
    Figure imgb0005
    where Ts represents the sampling time. For the estimation and correction operation, an iterative process is advantageously defined, performed over a range of frequencies Δ f min
    Figure imgb0006
    Δ f Δ f Max ,
    Figure imgb0007
    in order to obtain frequency offset correction.
  • The aforementioned loop may be composed of the following steps: apply a temporary offset correction Δ f , as defined above, estimate phase shift of the constellation, using for example linear approximation, compensate estimated phase shift, and compute synchronization metric
    Figure imgb0008
    as defined above.
  • Once all the synchronization metrics are collected, the frequency offset that allows minimizing the average dispersion over the imaginary coordinate of the complex space may be selected to be applied to the sampled signal under analysis, following the expression below: Offset = argmin Δ f M .
    Figure imgb0009
  • By applying this kind of synchronization, it is possible to obtain corrective measures that are effective in a wider noise scenario, compared with the known solutions.
  • Symbols and amplitudes
  • Preferably, the encoded signal S comprises a plurality of symbols ak , the first function being applied to an amplitude x associated to each symbol. The encoded signal S can be expressed as: S(t) = Σ kakh(t - kTsymb ) + n(t), where ak are the sent symbols at rate Tsymb, h(t) is a filter comprising a shaping filter and a channel filter, and n(t) is the noisy part.
  • After the synchronization, a matched filtering may be applied in order to minimize Inter-Symbol Interference, followed by a decimation operation for extracting, from the oversampled signal, one sample per symbol. The encoded signal S may thus be sampled with a number of n samples (S 1,S 2, ......, Sn ) per symbol, n being an integer, for example n=8, the number of samples per symbol being preferably reduced to one sample per symbol during a decimation step.
  • A step of symbol synchronization may be used to detect the synchronization sequence, which depends on the used protocol and is included in the encoded signal in order to identify the beginning of the useful data, also called "payload". In state-of-art systems, a PSK Detect step is responsible for the analysis of the signal, in order to associate one of the admissible point in the constellation to each symbol of the sequence. In the case of a BPSK modulation, only two symbols are possible and a positive value will be associated to 1 when a negative value will be associated to 0. A step of symbol demapping then transforms the symbol sequence to a binary sequence, which corresponds to the output for the decoding. When a Forward Error Correction code is used, such a binary decision is not optimal, and a soft decision, that is to say based on real values, is preferable.
  • The quantized decimated values, along with some information received from the PSK detect step to correct the phase shift, may be used for extract amplitudes, as can be seen in Fig. 9.
  • The method may comprise normalizing the amplitudes of the encoded signal S before estimation of the parameters a, b, and application of the first function fa,b .
  • The amplitude normalization may be obtained through division of the amplitudes of the sampled symbols by an attenuation factor, preferably defined by A = Sync R Sync D ,
    Figure imgb0010
    wherein SyncR represents a received synchronization sequence and SyncD represents a default synchronization sequence, preferably represented by default BPSK symbol +1 and -1 in the case where a BPSK modulation has been applied to the encoded signal, and |X|being an average absolute amplitude defined by X = i = 1 n X i n ,
    Figure imgb0011
    for a sequence X of n samples X 1, X 2 , ...... , Xn. Such amplitude normalization is useful to compensate path loss attenuation, due to the propagation of the signal over the channel, in particular in case of a wireless channel.
  • First and second functions
  • The first function is preferably a non-linear function providing a parametrized approximation of log likelihood ratio.
  • The first function may be defined by: f a , b x = min a x , b x sign x ,
    Figure imgb0012
    wherein x is the amplitude of the received symbol under analysis, and a and b are the beforehand-estimated parameters.
  • An example of the first function fa,b is represented in Fig. 12. As visible, all input amplitudes x in absolute value that are below a threshold sx are preferably processed using a linear part of the first function fa,b , and all amplitudes x that exceed said threshold sx are processed using an hyperbola type part of the first function fa,b. The threshold may be defined by s x = b a .
    Figure imgb0013
  • The second function J may be defined by a cost function J(a,b) of the first function fa,b , the parameters a, b being estimated such that (a,b) = argmin J(a,b).
  • Preferably, the cost function J is defined by J a b = i = 1 n ln 1 + e f a , b AS i n ,
    Figure imgb0014
    wherein fa,b is the first function, and ASi are the amplitudes of the input signal AS obtained from the encoded signal S modified by a processing function using a random binary sequence.
  • The method may comprise normalization of the samples of the modified signal S', in particular by computing a RMS value, the normalized modified signal S' being defined by normalized f a , b x = f a , b x RMS f a , b x ,
    Figure imgb0015
    with RMS x = m x m 2 m 2 ,
    Figure imgb0016
    wherein m is the number of samples available after processing by the first function fa,b .
  • The linear part of the first function fa,b , as can be seen in Fig. 12, may be determined by a slope that can introduce a non-negligible amplification effect on the output signal. This amplification may introduce amplitude values out of the admissible range of the decoding algorithm. This normalization operation on the modified signal S' is useful to resize overall amplitudes and re-establish the limits within tolerable boundaries. The normalized samples keep the original shape of the non-normalized samples but with an adapted dynamic range.
  • Estimation of a, b parameters
  • The goal is to estimate the values of a and b that can optimize the mutual information based on the channel condition estimated for the encoded signal S.
  • The coefficient a and b may be estimated using an information theory criterion in order to maximize the mutual information between the encoded signal and the sequence after the non-linear mapping, based on a learning sequence.
  • Preferably, the estimation of the parameters a, b is performed by a non-linear optimization algorithm, preferably a Nelder-Mead algorithm. Other algorithms may be used, for example a search on a predefined grid.
  • An initial guess of the parameters a, b may be defined before the first iteration of the minimization of the second function (J), for example by setting a = 4 and b = 6.
  • Input signal AS
  • The input signal AS for the estimation of the parameters a, b is called "autodidact signal". This signal corresponds to an approximated isolation of the estimated noise component introduced by the channel.
  • The input signal AS for the estimation of the parameters a, b may be generated by the following expression: ASk = 1 + n'k wherein n'k is a training sequence defined by n'k = nk · rk , with nk = yk - sign(yk ), rk being a random binary sequence distributed in {-1, 1}, and yk being the kth normalized amplitude of the encoded signal S.
  • System
  • The invention also provides a system for processing an encoded signal S received from a noisy channel, in particular with impulsive noise in wireless transmission, prior to the decoding of the signal by a decoder, the system comprising:
    • a signal processing module adapted for applying to the encoded signal S a first function based on at least two parameters for obtaining a modified signal S', the first function being chosen so as to mitigate the influence of the channel noise during the decoding of the modified signal, and
    • a parameter estimation module adapted for estimating said at least two parameters beforehand by minimization of a second function taking as input a signal AS obtained from the encoded signal S modified by a processing function using a random binary sequence.
  • The system may further comprise a module adapted for normalizing the amplitudes of the encoded signal S before estimation of the parameters a, b and application of the first function fa,b .
  • The system may comprise a module adapted for normalizing the samples of the modified signal (S'), in particular by computing a RMS value, the normalized modified signal (S') being defined by Normalized f a , b x = f a , b x RMS f a , b x ,
    Figure imgb0017
    with RMS x = m x m 2 m 2 ,
    Figure imgb0018
    wherein m is the number of samples available after processing by the first function fa,b .
  • The features defined above for the method apply to the system and vice-versa.
  • Computer program product
  • The invention also provides a computer program product for processing an encoded signal S received from a noisy channel, in particular with impulsive noise in wireless transmission, prior to the decoding of the signal by a decoder, the computer program product comprising a support and stored on this support instructions that can be read by a processor, these instructions being configured for:
    • applying to the encoded signal S a first function based on at least two parameters for obtaining a modified signal S' to be decoded, the first function being chosen so as to mitigate the influence of the channel noise during the decoding of the modified signal S', and
    • estimating beforehand said at least two parameters by minimizing a second function taking as input a signal AS obtained from the encoded signal S modified by a processing function using a random binary sequence.
  • The features defined above for the method and the system apply to the computer program product.
  • Brief description of the drawings
  • The invention will be better understood on reading the following detailed description of non-limiting exemplary embodiments thereof and on examining the appended drawings in which:
    • Figure 1 illustrates schematically an example of hardware system components for the transmission and reception of packets over a wireless network,
    • Figures 2 and 3 are respective block diagrams of the implementation steps of a USRP at the transmitter and receiver sides,
    • Figure 4 illustrates an example of a receiver block diagram,
    • Figure 5 shows an example of parallel processing for signal extraction,
    • Figure 6 is a block diagram showing some steps for extracting amplitudes according to the invention,
    • Figure 7, previously described, illustrates an example of a received baseband signal with carrier offset according to the state-of-the-art,
    • Figure 8 shows the result, in time domain, of the synchronization algorithm according to the invention,
    • Figure 9, previously described, shows a demodulation and amplitude extraction block diagram according to the invention,
    • Figure 10 is a block diagram showing some steps of the method for processing an encoded signal according to the invention,
    • Figure 11 is a block diagram showing some steps of the estimation of parameters depending on the channel noise according to the invention, and
    • Figure 12, previously described, illustrates an example of a non-linear function first function according to the invention.
    Detailed description
  • As illustrated in Fig.1, an example of a system used in the invention for the transmission and reception of packets over a wireless network comprises an universal software radio peripheral (USRP) and an associated driving computer (PC) at the transmitter side, and a USRP and a PC at the receiver side. The packets are transmitted over a noisy wireless channel. The invention is not limited to wireless transmissions, and can apply to non-wireless transmissions, for example in Power-Line communications or acoustic transmissions. The USRPs in use are for example NI-USRP 2952R. The invention is not limited to the use of a USRP, and a system-on-chip, a DSP or FPGA may also be used. Preferably, a single USRP equipped with two independent radio interfaces is used to send and receive the signal. In this case, synchronization between transmitter and receiver is automatically achieved due to the share of the same clock at transmitter and receiver sides.
  • The operations performed by the hardware inside the USRP can be abstracted both for transmission and for reception of signals as illustrated in Fig. 2 and Fig. 3 respectively. These operations are necessary for the conversion of the signal between baseband and passband and vice versa. In the present invention, bands centered in 915 MHz and 2.45 GHz may be used, corresponding to bands of Industrial Scientific and Medical bands (ISM). The invention is however not limited to specific carrier bands.
  • In order to transmit a signal over a communication medium, it is necessary to transpose it from the baseband, which is centered around 0Hz, to the desired passband. To do so, the USRP receives the waveform to transmit from the computer, filters and transposes, in a step of up-conversion, the spectrum of the signal. The signal is then encoded and modulated. The signal in passband is amplified prior to be directed toward the antenna to be transmitted over the wireless medium.
  • The operations to be performed at the reception are meant to revert the process performed by the transmitter. In this example, in the receiving chain of the USRP, the signal captured by the antenna is amplified using a low noise amplifier. In a step of down-conversion, the received signal is transposed back to baseband applying the same carrier frequency used by the transmitter. A filtering of the down converted signal is advantageously performed in order to retain only the frequencies of interest. The filtered signal is then sampled and transferred to the computer to be further processed.
  • The general structure of the receiver application which can be used for the implementation of the invention is represented by the block diagram of Fig. 4.
  • A step for establishing the setup of the receiver is performed once at startup, similarly to the one at the transmitter, by initializing the USRP with parameters such as carrier frequency, sampling frequency, or amplification factor. During such step, it is also possible to qualify some of the properties that are specific to the coding technique in use.
  • The next step is to acquire the baseband sampled signal produced by the USRP. In this example, the data type is an array of complex numbers containing the In-Phase and Quadrature (I/Q) components of each sample, obtained by the down-conversion, as the real and imaginary part of a complex number. The structure of the received signal can be expressed as: R t = t I k + jQ k δ t kT s
    Figure imgb0019
    where Ts represents the sampling time.
  • Due to its structure, the USRP is continuously down-converting and sampling what is detected. Consequently, the received sampled signal may or may not contain an actual transmission. Hence, a step of extracting useful signal may be performed, in order to estimate the signal and noise level, for extracting from all received samples only those that are likely to carry out a message. This is meant to reduce the execution time avoiding to process samples containing merely noise. In order to improve efficiency in signal processing and, consequently, being able to achieve real time decoding, a parallelized signal analysis may be implemented, as depicted in Fig. 5. Each "Process signal" component of parallel processing is in charge to detect boundaries for the presence of a packet. All results are recombined to produce boundaries, and used to create set of samples to be further analyzed. The remaining have been estimated to contain just channel noise.
  • The signal may then be subjected to another sampling process, as shown in Fig. 4. This is useful to have the correct number of samples per symbol necessary for the further demodulation step. Even though the sampling frequency is often a configurable parameter at the transmitter side, there can be a difference between the requested sampling frequency and the actual sampling frequency, due to hardware limitations. Thus, resampling may be performed to eliminate possible impairments.
  • A further step of demodulation and amplitude extraction, which can be decomposed as illustrated in Fig. 6, is performed in the illustrated example. The resampled noisy signal is preferably low-pass filtered prior to continue further in the demodulation chain, to form the encoded signal S.
  • As previously described, it is advantageous to perform a step of synchronization, for estimating and correcting carrier shift that may be introduced. Fig. 8 shows the result of this synchronization step, performed on the encoded signal S, in time domain.
  • A step of BPSK demodulation with amplitude extraction, previously described, and detailed in Fig. 9, is performed in order to extract amplitude associated to every symbol of the encoded signal S. This amplitude sequence will be the input for non-linear operation performed in the invention.
  • The method for processing the encoded signal according to the invention, marked by the black arrow of Fig. 4, will be further detailed below.
  • Once the encoded signal has been processed, the transmitted message is retrieved in a step of signal decoding.
  • The validity of the decoded sequence may be verified in a step of "Message display & statistics update". In this example, the sequence is subjected to a verification of the cyclic redundancy check (CRC) code added as tail of the payload at the transmitter side. If such verification is successfully passed, the payload, the essential data that is being carried within a packet, is extracted, converted in the string format and displayed for the user. The reception statistics may be updated to keep count of the current received packet as successfully or unsuccessfully decoded.
  • An example of detailed steps for processing the encoded signal S according to the invention is shown in Fig. 10.
  • As previously described, a first step is the beforehand estimation of parameters a, b depending on the channel noise, which are necessary to properly configure the computation of the non-linear first function fa,b , followed by an operation of RMS normalization, before the obtaining of the decoded sequence by a decoding step. This step uses the second function J that is a cost function J(a,b) of the first function fa,b, the parameters a, b being estimated such that (a,b) = argmin J(a,b), by using, preferably and as shown in Fig.11, a particular type of simplex method known as Nelder-Mead algorithm. It makes use of three points, in a bidimensional space, that are relocated during the iterations of the algorithm in order to obtain the estimated optimized pair a, b.
  • Preferably, as previously described and as shown on Fig. 11, for achieving the estimation of the parameters a, b, a preliminary operation of amplitude normalization is realized.
  • Once obtained the normalized amplitudes, as previously described, the autodidact Signal AS is generated by the following expression: ASk = 1 + n' k, wherein n'k is a training sequence defined by n'k = nk · rk , with nk = yk - sign(yk), rk being a random binary sequence distributed in {-1, 1}, and yk being the kth normalized amplitude of the encoded signal S. This signal AS is used as input for the cost function J(a,b), by defining an initial guess for parameters a and b, for example a = 4 and b = 6.
  • Preferably and as previously described, to every amplitude x of every symbols under analysis, is applied a non-linear function f a , b x = min a x , b x sign x ,
    Figure imgb0020
    as illustrated in Fig. 12, for obtaining a modified signal S' to be decoded. In this example, all input amplitudes x in absolute value that are below a threshold sx are processed using a linear part of the first function fa,b , and all amplitudes x that exceed said threshold sx are processed using an hyperbola type part of the first function fa,b. The threshold may be defined by: sx = b a .
    Figure imgb0021
  • In the illustrated example, a normalization of the samples of the modified signal S' is performed, by computing a RMS value, the normalized modified signal S' being defined by normalized f a , b x = f a , b x RMS f a , b x ,
    Figure imgb0022
    with RMS x = m x m 2 m 2 ,
    Figure imgb0023
    wherein m is the number of samples available after processing by the first function (fa,b ).
  • The processing of the encoded signal S according to the invention is then concluded, the produced output may be adopted to perform decoding, as above-written.
  • Decoding performance tests are now going to be presented. In the following test examples, a single USRP equipped with two independent radio interfaces is used, and received signals have been added with α-stable random noise aiming to simulate an impulsive channel noise. Such a noise depends on several parameters. α is the characteristic exponent of the probability distribution function. For an α -stable distributed noise, a lower α implies a higher impulsivity of the noise. β indicates the skewness, γ is used as a scale parameter, allowing to adjust the produced noise in amplitude, and δ is defined as a location parameter introducing a shifting offset. All test presented hereafter have been produced using β = 0 and δ = 0.
  • Tests have been performed using three different coding techniques, more precisely Low Density Parity Check (LDPC) coding, Convolutional coding and Turbo codes.
  • The results, presented in table form indicating main configuration parameters, are grouped based on the type of coding technique under evaluation. The tables represent the percentage of correctly decoded packets; that is to say which have a CRC check with positive result. Results for pure decoding, using amplitudes without applying any further processing, for classic LLR decoding, amplitudes processed using a standard equation for the computation of the LLR, LLR c i = ln Pr c i = 0 | y Pr c i = 1 | y
    Figure imgb0024
    with ci the expected code word and y the channel output, used with a normal distribution with σ = 0.8, and for the method according to the invention are presented and compared. Table 1: LDPC coding
    Pure decoding Classic LLR decoding Invention Average SNR
    Alpha=1.7 45.98% 91.56% 98.57% 1.19 dB
    Gamma=0.04
    Size= 13 Bytes
    Alpha=1.7 17.79% 81.83% 95.06% -1.55 dB
    Gamma=0.05
    Size= 13 Bytes
    Alpha=1.6 10.62% 77.86% 92.72% -2.80 dB
    Gamma=0.06
    Size= 13 Bytes
    Alpha=1.6 1.2% 56.75% 74.04% -4.78 dB
    Gamma=0.07
    Size= 13 Bytes
    Table 2: Convolutional coding - short payload
    Pure decoding Classic LLR decoding Invention Average SNR
    Alpha=1.7 78% 77.99% 96.91% -2.4 dB
    Gamma=0.08
    Rate=1 /2
    Size= 40 Bytes
    Alpha=1.7 54.25% 54.26% 89.4% -3.86 dB
    Gamma=0.09
    Rate=1 /2
    Size = 40 Bytes
    Alpha=1.6 65.2% 65.22% 94.07% -1.79 dB
    Gamma=0.05
    Rate=1 /2
    Size = 40 Bytes
    Table 3: Convolutional coding - medium payload
    Pure decoding Classic LLR decoding Invention Average SNR
    Alpha=1.6 8.58% 8.42% 92.03% -2.15 dB
    Gamma=0.05
    Rate=1 /2
    Size = 400 Bytes
    Alpha=1.6 23.55% 22.32% 93.78% 4.71 dB
    Gamma=0.05
    Rate=1 /3
    Size = 400 Bytes
    Table 4: Convolutional coding - long payload
    Pure decoding Classic LLR decoding Invention Average SNR
    Alpha=1.6 4.61% 4.51% 90.85% -2.44 dB
    Gamma=0.05
    Rate=1 /2
    Size = 600 Bytes
    Alpha=1.6 9.88% 9.22% 93.23% 4.93 dB
    Gamma=0.05
    Rate=1 /3
    Size = 600 Bytes
    Table 5: Turbo coding
    Pure decoding Classic LLR decoding Invention Average SNR
    Alpha=1.6 36.45% 65.80% 79.27% -1.59 dB
    Gamma=0.03
    Rate=1/2 (punct.)
    Size = 13 Bytes
    Alpha=1.6 24.52% 55.18% 76.12% -3.31 dB
    Gamma=0.04
    Rate=1 /3
    Size = 13 Bytes
    Alpha=1.6 3.65% 30.87% 53.23% -6.91dB
    Gamma=0.05
    Rate=1 /3
    Size = 13 Bytes
  • From these results, it is obvious that the processing method according to the invention provides better results than state-of-the-art methods. From 13% up to 80% of additional correctly decoded packets can be obtained.
  • Performances of the automatic estimation of the channel configuration parameters according to the invention are also shown, in order to determine the improvement in terms of decoding capabilities and to validate the implemented channel estimation technique.
  • All tests have been performed using convolutional coding technique, with β = 0 and δ = 0, and the results are presented in table form, indicating main configuration parameters.
  • In this example, transmitter and receiver are played by two completely separated couples of USRP and controlling unit. In such configuration, the two systems do not share the same clock, hence the synchronization operations are important to allow a proper analysis of the processed sampled signal S'. The tables represent the percentage of correctly decoded packets, for pure decoding, for classic LLR decoding, for a processing according to the invention but with theoretical a and b parameters mathematically calculated by a = 2 2 γ
    Figure imgb0025
    and b = 2 α + 1 2 ,
    Figure imgb0026
    and for the parameters estimation method according to the invention. Table 6: Convolutional coding - α=1.7
    Pure decoding Classic LLR decoding Theoretical parameters estimation Invention Average SNR
    Alpha=1.7 72.27% 72.28% 90.48% 84.39% 6.48 dB
    Gamma=0.01
    Rate=1 /2
    Size = 150 Bytes
    Alpha=1.7 18.71% 18.71% 58.79% 61.30% -11.04 dB
    Gamma=0.03
    Rate=1 /2
    Size = 150 Bytes
    Alpha=1.7 0.91% 0.9% 9.68% 13.23% -12.41 dB
    Gamma=0.05
    Rate=1 /2
    Size = 150 Bytes
    Table 7: Convolutional coding - α=1.8
    Pure decoding Classic LLR decoding Theoretical parameters estimation Invention Average SNR
    Alpha=1.8 50.16% 50.16% 69.25% 76.45% 1.55 dB
    Gamma=0.01
    Rate=1 /2
    Size = 150 Bytes
    Alpha=1.8 53.58% 53.58% 83.54% 77.45% -4.95 dB
    Gamma=0.03
    Rate=1 /2
    Size = 150 Bytes
    Alpha=1.8 7.58% 7.58% 26.50% 33.84% -9.17 dB
    Gamma=0.05
    Rate=1 /2
    Size = 150 Bytes
    Table 8: Convolutional coding - α=1.9
    Pure decoding Classic LLR decoding Theoretical parameters estimation Invention Average SNR
    Alpha=1.9 94.26% 94.26% 97.36% 96.55% 12.46 dB
    Gamma=0.01
    Rate=1 /2
    Size = 150 Bytes
    Alpha=1.9 70.19% 70.19% 84.64% 80.05% -5.21 dB
    Gamma=0.03
    Rate=1 /2
    Size = 150 Bytes
    Alpha=1.9 14.39% 14.39% 24.55% 29.46% -11.56 dB
    Gamma=0.05
    Rate=1 /2
    Size = 150 Bytes
    Table 9: Convolutional coding - Natural thermal noise
    Pure decoding Classic LLR decoding Non-linear theoretical Non-linear estimated
    Rate=1 /2 98.63% 98.63% 98.63% 98.63%
    Size = 150 Bytes
  • From these results, it is obvious that the estimated parameters according to the invention do not degrade the decoding performances, and even improve these performances most of the time.

Claims (17)

  1. Method for processing an encoded signal (S) received from a noisy channel, in particular with impulsive noise in wireless transmission, prior to the decoding of the signal by a decoder, the method comprising:
    - applying to the encoded signal (S) a first function (fa,b ) based on at least two parameters (a, b) depending on the channel noise, for obtaining a modified signal (S') to be decoded, the first function being chosen so as to mitigate the influence of the channel noise during the decoding of the modified signal (S'),
    said at least two parameters (a, b) being estimated beforehand by minimizing a second function (J) taking as input a signal (AS) obtained from the encoded signal (S) modified by a processing function using a random binary sequence.
  2. The method according to claim 1, wherein the encoded signal (S) comprising a plurality of symbols, the first function (fa,b ) being applied to an amplitude (x) associated to each symbol.
  3. The method according to claim 2, wherein the first function (fa,b ) is a non-linear function defined by: f a , b x = min a x , b x sign x ,
    Figure imgb0027
    wherein x is the amplitude of the symbol under analysis, and a and b are the beforehand-estimated parameters (a, b).
  4. The method according to the preceding claim, wherein all input amplitudes (x) in absolute value that are below a threshold (sx ) are processed using a linear part of the first function (fa,b ), and all amplitudes (x) that exceed said threshold (sx ) are processed using an hyperbola type part of the first function (fa,b ).
  5. The method according to the preceding claim, wherein the threshold (sx ) is defined by s x = b a .
    Figure imgb0028
  6. The method according to any one of the preceding claims, wherein the encoded signal (S) is sampled with a number of n samples (S 1, S 2 , ...... , Sn ) per symbol, n being an integer, for example n=8, the number of samples per symbol being preferably reduced to one sample per symbol during a decimation step.
  7. The method according to claim 6, wherein the second function (J) is defined by a cost function J(a,b) of the first function (fa,b ), the parameters (a, b) being estimated such that (a,b) = argmin J(a,b).
  8. The method according to the preceding claim, wherein the cost function (J) is defined by J a b = i = 1 n ln 1 + e f a , b AS i n ,
    Figure imgb0029
    wherein (fa,b ) is the first function, and ASi are the amplitudes of the input signal (AS) obtained from the encoded signal (S) modified by a processing function using a random binary sequence.
  9. The method according to any one of claims 2 to 8, comprising normalizing the amplitudes of the encoded signal (S) before estimation of the parameters (a, b) and application of the first function (fa,b ).
  10. The method according to claim 8, wherein the input signal (AS) for the estimation of the parameters (a, b) is generated by the following expression: ASk = 1 + n'k wherein n'k is a training sequence defined by n'k = nk · rk , with nk = yk - sign(yk ), rk being a random binary sequence distributed in {-1, 1}, and yk being the kth normalized amplitude of the encoded signal (S).
  11. The method according to any one of the proceeding claims, wherein the estimation of the parameters (a, b) is performed by a non-linear optimization algorithm, preferably a Nelder-Mead algorithm.
  12. The method according to the preceding claim, wherein an initial guess of the parameters (a, b) is defined before the first iteration of the minimization of the second
  13. The method according to claim 6, comprising normalization of the samples of the modified signal (S'), in particular by computing a RMS value, the normalized modified signal (S') being defined by normalized f a , b x = f a , b x RMS f a , b x ,
    Figure imgb0030
    with RMS x = m x m 2 m 2 ,
    Figure imgb0031
    wherein m is the number of samples available after processing by the first function (fa,b ).
  14. System for processing an encoded signal (S) received from a noisy channel, in particular with impulsive noise in wireless transmission, prior to the decoding of the signal by a decoder, the system comprising:
    - a signal processing module adapted for applying to the encoded signal (S) a first function (fa,b ) based on at least two parameters (a, b) for obtaining a modified signal (S'), the first function being chosen so as to mitigate the influence of the channel noise during the decoding of the modified signal (S'),
    - a parameter estimation module adapted for estimating said at least two parameters (a, b) beforehand by minimization of a second function (J) taking as input a signal (AS) obtained from the encoded signal (S) modified by a processing function using a random binary sequence.
  15. System according to claim 14, comprising a module adapted for normalizing the amplitudes of the encoded signal (S) before estimation of the parameters (a, b) and application of the first function (fa,b ).
  16. System according to claim 14 or 15, comprising a module adapted for normalizing the samples of the modified signal (S'), in particular by computing a RMS value, the normalized modified signal (S') being defined by Normalized f a , b x = f a , b x RMS f a , b x ,
    Figure imgb0032
    with RMS x = m x m 2 m 2 ,
    Figure imgb0033
    wherein m is the number of samples available after processing by the first function (fa,b ).
  17. A computer program product for processing an encoded signal (S) received from a noisy channel, in particular with impulsive noise in wireless transmission, prior to the decoding of the signal by a decoder, the computer program product comprising a support and stored on this support instructions that can be read by a processor, these instructions being configured for:
    - applying to the encoded signal (S) a first function (fa,b ) based on at least two parameters (a, b) for obtaining a modified signal (S') to be decoded, the first function being chosen so as to mitigate the influence of the channel noise during the decoding of the modified signal (S'), and
    - estimating beforehand said at least two parameters (a, b) by minimizing a second function (J) taking as input a signal (AS) obtained from the encoded signal (S) modified by a processing function using a random binary sequence.
EP18305464.2A 2018-04-13 2018-04-13 Approximation of log-likelihood ratios for soft decision decoding in the presence of impulse noise channels Withdrawn EP3553953A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP18305464.2A EP3553953A1 (en) 2018-04-13 2018-04-13 Approximation of log-likelihood ratios for soft decision decoding in the presence of impulse noise channels
PCT/EP2019/059526 WO2019197657A1 (en) 2018-04-13 2019-04-12 Approximation of log-likelihood ratios for soft decision decoding in the presence of impulse noise channels

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP18305464.2A EP3553953A1 (en) 2018-04-13 2018-04-13 Approximation of log-likelihood ratios for soft decision decoding in the presence of impulse noise channels

Publications (1)

Publication Number Publication Date
EP3553953A1 true EP3553953A1 (en) 2019-10-16

Family

ID=62217898

Family Applications (1)

Application Number Title Priority Date Filing Date
EP18305464.2A Withdrawn EP3553953A1 (en) 2018-04-13 2018-04-13 Approximation of log-likelihood ratios for soft decision decoding in the presence of impulse noise channels

Country Status (2)

Country Link
EP (1) EP3553953A1 (en)
WO (1) WO2019197657A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114363218A (en) * 2022-01-07 2022-04-15 合肥工业大学 Communication reachable rate detection method based on end-to-end learning

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113300721B (en) * 2021-05-27 2022-11-22 北京航空航天大学合肥创新研究院(北京航空航天大学合肥研究生院) LDPC code decoding method and storage medium
CN115473596B (en) * 2022-08-25 2024-06-18 北京航空航天大学 Multipath fading channel measurement system based on USRP

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050058302A1 (en) * 1998-12-24 2005-03-17 Xerox Corporation. Method and apparatus for reducing impulse noise in a signal processing system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050058302A1 (en) * 1998-12-24 2005-03-17 Xerox Corporation. Method and apparatus for reducing impulse noise in a signal processing system

Non-Patent Citations (10)

* Cited by examiner, † Cited by third party
Title
CHUAN HISIAN: "SOVA decoding in Symmetric Alpha-Stable Noise", SYMPOSIUM ON INFORMATION & COMPUTER SCIENCES, 2011
CHUAN HSIAN: "Iterative SOVA decoding over alpha stable channels", JOURNAL OF ENGINEERING SCIENCE AND TECHNOLOGY, vol. 7, no. 3, June 2012 (2012-06-01)
DIMANCHE VINCENT ET AL: "Estimation of an approximated likelihood ratio for iterative decoding in impulsive environment", PROC. 2016 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, IEEE, 3 April 2016 (2016-04-03), pages 1 - 6, XP032959372, DOI: 10.1109/WCNC.2016.7565031 *
DIMANCHE VINCENT ET AL: "On Detection Method for Soft Iterative Decoding in the Presence of Impulsive Interference", IEEE COMMUNICATIONS LETTERS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 18, no. 6, 1 June 2014 (2014-06-01), pages 945 - 948, XP011550325, ISSN: 1089-7798, [retrieved on 20140606], DOI: 10.1109/LCOMM.2014.2320921 *
GAO CHENYU ET AL: "Gradient descent bit-flipping based on penalty factor for decoding LDPC codes over symmetric alpha-stable noise channels", PROC. 2017 IEEE/CIC INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN CHINA (ICCC), IEEE, 22 October 2017 (2017-10-22), pages 1 - 4, XP033343368, DOI: 10.1109/ICCCHINA.2017.8330404 *
HASSEN BENMAAD ET AL.: "IEEE Communications Letters", vol. 17, 2013, INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, article "Clipping demapper for LDPC decoding in impulsive channel", pages: 968 - 971
HOU YI ET AL: "A non-linear LLR approximation for LDPC decoding over impulsive noise channels", PROC. 2014 IEEE/CIC INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN CHINA (ICCC), IEEE, 13 October 2014 (2014-10-13), pages 86 - 90, XP032721806, DOI: 10.1109/ICCCHINA.2014.7008248 *
M. JOHNSTON ET AL.: "Sum-Product Algorithm Utilizing Soft Distances on Additive impulsive Noise Channels", IEEE TRANSACTIONS ON COMMUNICATIONS, vol. 61, no. 6, June 2013 (2013-06-01), pages 2113 - 2116
POULLIAT C. ET AL.: "Performances des codes LDPCpour l'Ultra-Large Bande (ULB) impulsionnelle sous approximation gaussienne generalisee des interferences", PROCEEDINGS OF GRETSI CONFERENCE, 2007
WEI GUI: "Decoding Metric Study for Turbo Codes in Very impulsive Environment", IEEE COMMUNICATIONS LETTERS, vol. 16, no. 2, February 2012 (2012-02-01), pages 256 - 258, XP011409351, DOI: doi:10.1109/LCOMM.2011.112311.111504

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114363218A (en) * 2022-01-07 2022-04-15 合肥工业大学 Communication reachable rate detection method based on end-to-end learning

Also Published As

Publication number Publication date
WO2019197657A1 (en) 2019-10-17

Similar Documents

Publication Publication Date Title
US8548072B1 (en) Timing pilot generation for highly-spectrally-efficient communications
RU2322762C1 (en) Method for iterative estimation and decoding of channels and interferences
EP2439894B1 (en) System and method for iterative nonlinear compensation for intermodulation distortion in multicarrier communication systems
US6470047B1 (en) Apparatus for and method of reducing interference in a communications receiver
EP2929661B1 (en) Data detection method and data detector for signals transmitted over a communication channel with inter-symbol interference
US9008238B2 (en) Apparatus, method and receiving terminal for LDPC decoding
EP3553953A1 (en) Approximation of log-likelihood ratios for soft decision decoding in the presence of impulse noise channels
CN104584440B (en) Receiver, transmitter and communication means
US20070206664A1 (en) Communication method and apparatus for multi-user detection
US8645808B1 (en) Calculation of soft decoding metrics
KR20060105416A (en) Method for soft-demodulation and soft-modulation of multi-antenna system
US6567481B1 (en) Receivers including iterative map detection and related methods
EP3172879B1 (en) Method for receiving a digital signal in a digital communication system
JP2009212586A (en) Data communication system, and llr calculating device and method
Ogundile et al. Improved reliability information for rectangular 16-QAM over flat Rayleigh fading channels
EP2680520B1 (en) Method and apparatus for efficient MIMO reception with reduced complexity
EP4085566A1 (en) Superior timing synchronization using high-order tracking loops
JP2012039474A (en) Digital radio signal demodulator circuit and radio receiver unit using the same
CN111431834B (en) High-efficiency underwater current field communication method with high reliability
KR102080915B1 (en) Method and apparatus of iterative detection and decoding of signal in communication systems with mimo channel
US11855699B2 (en) Optical transmission system, optical transmitting apparatus and optical receiving apparatus
Li et al. Robust receiver algorithms to mitigate partial-band and partial-time interference in LDPC-coded OFDM systems
Duque et al. Autoencoders for Signal Enhancement in Communication Systems
JP3930511B2 (en) Receiving apparatus and communication system
Ogundile et al. Improved distance metric technique for deriving soft reliability information over Rayleigh Fading Channel

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN PUBLISHED

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20200603