Optimal estimation and sequential channel equalization algorithms for chaotic communications systems (Q5957452): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/s1110865701000282 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2128967587 / rank
 
Normal rank

Latest revision as of 08:55, 30 July 2024

scientific article; zbMATH DE number 1716923
Language Label Description Also known as
English
Optimal estimation and sequential channel equalization algorithms for chaotic communications systems
scientific article; zbMATH DE number 1716923

    Statements

    Optimal estimation and sequential channel equalization algorithms for chaotic communications systems (English)
    0 references
    0 references
    0 references
    24 July 2002
    0 references
    Summary: Many previously proposed communications systems based on chaos disregard common channel distortions and fail to work under realistic channel conditions. In this paper, optimal estimation and sequential channel equalization algorithms are proposed for chaotic communications systems where information is encoded using symbolic dynamics representations. For the optimal estimate of the transmitted signal, the symbolic dynamics representation of chaotic systems is first exploited to represent the chaotic dynamics of the signal by an equivalent trellis diagram. Then, the Viterbi algorithm is used to achieve an optimal estimate of the noise corrupted chaotic sequence. For the sequential channel equalization algorithm, the dynamics-based trellis diagram is expanded to accommodate a finite impulse response (FIR) model of the channel. Once the initial estimate of the channel parameter is obtained through the training sequence, the Viterbi algorithm is used to estimate the chaotic sequence. If necessary, channel parameters can then be updated through successive estimates of the chaotic sequence. The proposed algorithms are simulated for both time-invariant and time-varying channels.
    0 references
    chaotic communication
    0 references
    nonlinear systems
    0 references
    estimation
    0 references
    channel equalization
    0 references

    Identifiers