z-logo
open-access-imgOpen Access
Regeneration scanning method for M ‐WFRFT communication signals
Author(s) -
Liu Fang,
Feng Yongxin
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2018.6278
Subject(s) - weighting , transmitter , interference (communication) , computer science , algorithm , mathematics , transformation (genetics) , telecommunications , physics , acoustics , channel (broadcasting) , biochemistry , chemistry , gene
Considering its simplicity and the uniform distribution of signal energy and interference after transformation, the weighted fractional Fourier transform (WFRFT) has been gradually applied to the field of communication. With in‐depth study of WFRFT, the number of weighted terms can be extended from the original four terms to any number. This is called a multi‐WFRFT ( M ‐WFRFT). As the number of weighted terms plays an important role in the receiving system, research into an M ‐WFRFT reception method compatible with different weighted terms is critical. In view of the high complexity of communication systems based on M ‐WFRFT, in order to solve the general receiving problems of the receiver when the parameters of the transmitter are not fixed or when multiple transmitters share the same receiving system, a regenerative transformation scan method for M ‐WFRFT signals is established. This is accomplished by adapting to dynamic processing conditions and avoiding the problem of high complexity. In this method, the 4‐WFRFT mechanism is introduced, regeneration weighting coefficients are constructed, and the regeneration order is given by combining the inherent relationship between the weighting coefficients and the order. The new method can achieve the purpose of receiving M ‐WFRFT signals with different number of items and different orders.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here