CN112737548A - Adaptive filtering method, device and computer readable storage medium - Google Patents
Adaptive filtering method, device and computer readable storage medium Download PDFInfo
- Publication number
- CN112737548A CN112737548A CN202011545075.XA CN202011545075A CN112737548A CN 112737548 A CN112737548 A CN 112737548A CN 202011545075 A CN202011545075 A CN 202011545075A CN 112737548 A CN112737548 A CN 112737548A
- Authority
- CN
- China
- Prior art keywords
- state
- condition
- adaptive filtering
- multiplexing
- jump
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03H—IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
- H03H21/00—Adaptive networks
- H03H21/0012—Digital adaptive filters
- H03H21/0025—Particular filtering methods
- H03H21/0027—Particular filtering methods filtering in the frequency domain
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/52—Multiplying; Dividing
- G06F7/523—Multiplying only
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Cable Transmission Systems, Equalization Of Radio And Reduction Of Echo (AREA)
Abstract
The embodiment of the invention discloses a self-adaptive filtering method, a device and a computer readable storage medium, wherein the self-adaptive filtering device comprises: at least one multiplexing device, the multiplexing device comprising one or more of: the system comprises a Fourier transform FFT multiplexing module, a zero insertion multiplexing module and a complex multiplier multiplexing module; the multiplexing device is configured to determine the next state to be jumped to by the multiplexing device according to the jump condition which is currently met, and execute corresponding operation according to the next state to be jumped to; wherein, different states corresponding to a multiplexing device respectively represent different operations using the multiplexing device in the adaptive filtering; the jump condition represents a condition for jumping from one state to the next in adaptive filtering. On the premise of ensuring the FDAF function, the multiplexing of partial modules is realized, and the aim of reducing resource consumption can be achieved.
Description
Technical Field
Embodiments of the present invention relate to adaptive filtering technologies, and in particular, to an adaptive filtering method, an adaptive filtering device, and a computer readable storage medium.
Background
The adaptive filter uses the estimation of the statistical characteristics of the input and output signals as the basis, and adopts a specific algorithm to automatically adjust the coefficient of the filter to achieve the optimal filter characteristic.
At present, the adaptive filter device is applied to the fields of automatic equalization, echo cancellation, antenna array beam forming and the like in the communication field. The Least Mean Square (LMS) adaptive filter is widely used due to its simple structure and low computational complexity.
However, although the FDAF based on the LMS Adaptive Filter has a relatively simple structure and low computational complexity compared to other Adaptive filters, the resource consumption of the FPGA is enormous if the computation is performed in a completely parallel manner.
Disclosure of Invention
In view of the above, an embodiment of the present invention provides an adaptive filter device, including: the method comprises the following steps: at least one multiplexing device, the multiplexing device comprising one or more of: the system comprises a Fourier transform FFT multiplexing module, a zero insertion multiplexing module and a complex multiplier multiplexing module;
the multiplexing device is configured to determine the next state to be jumped to by the multiplexing device according to the jump condition which is currently met, and execute corresponding operation according to the next state to be jumped to;
wherein, different states corresponding to a multiplexing device respectively represent different operations using the multiplexing device in the adaptive filtering; the jump condition represents a condition for jumping from one state to the next in adaptive filtering.
An embodiment of the present invention further provides a self-adaptive filtering method, which is applied to the self-adaptive filter device; the method comprises the following steps:
sequentially executing each step of operation in the self-adaptive filtering according to a preset sequence;
when any multiplexing device needs to be used in one-step operation, determining the next state to be jumped to by the multiplexing device according to the currently met jump condition, and executing corresponding operation according to the next state to be jumped to;
wherein, different states corresponding to a multiplexing device respectively represent different operations using the multiplexing device in the adaptive filtering; the jump condition represents a condition for jumping from one state to the next in adaptive filtering.
An embodiment of the present invention further provides a computer-readable storage medium, which stores a computer program, wherein the computer program, when executed by a processor, implements the adaptive filtering method described above.
Other aspects will be apparent upon reading and understanding the attached drawings and detailed description.
Drawings
The accompanying drawings are included to provide an understanding of the present disclosure and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the examples serve to explain the principles of the disclosure and not to limit the disclosure.
Fig. 1 is a schematic structural diagram of an adaptive filter device according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart illustrating a completion of an FDAF operation according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of an adaptive filter device according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating an FFT state transition diagram according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of an adaptive filter device according to an embodiment of the present invention;
FIG. 6 is a diagram illustrating a state transition diagram of a complex multiplier according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of an adaptive filter device according to an embodiment of the present invention;
FIG. 8 is a diagram illustrating a state transition diagram for zero block insertion according to an embodiment of the present invention;
fig. 9 is a schematic structural diagram of an adaptive filter device according to an embodiment of the present invention;
FIG. 10 is a diagram illustrating an overall state transition diagram according to an embodiment of the present invention;
fig. 11 is a flowchart illustrating an adaptive filtering method according to an embodiment of the present invention.
Detailed Description
The present application describes embodiments, but the description is illustrative rather than limiting and it will be apparent to those of ordinary skill in the art that many more embodiments and implementations are possible within the scope of the embodiments described herein. Although many possible combinations of features are shown in the drawings and discussed in the detailed description, many other combinations of the disclosed features are possible. Any feature or element of any embodiment may be used in combination with or instead of any other feature or element in any other embodiment, unless expressly limited otherwise.
The present application includes and contemplates combinations of features and elements known to those of ordinary skill in the art. The embodiments, features and elements disclosed in this application may also be combined with any conventional features or elements to form a unique inventive concept as defined by the claims. Any feature or element of any embodiment may also be combined with features or elements from other inventive aspects to form yet another unique inventive aspect, as defined by the claims. Thus, it should be understood that any of the features shown and/or discussed in this application may be implemented alone or in any suitable combination. Accordingly, the embodiments are not limited except as by the appended claims and their equivalents. Furthermore, various modifications and changes may be made within the scope of the appended claims.
Further, in describing representative embodiments, the specification may have presented the method and/or process as a particular sequence of steps. However, to the extent that the method or process does not rely on the particular order of steps set forth herein, the method or process should not be limited to the particular sequence of steps described. Other orders of steps are possible as will be understood by those of ordinary skill in the art. Therefore, the particular order of the steps set forth in the specification should not be construed as limitations on the claims. Further, the claims directed to the method and/or process should not be limited to the performance of their steps in the order written, and one skilled in the art can readily appreciate that the sequences may be varied and still remain within the spirit and scope of the embodiments of the present application.
An embodiment of the present invention provides an adaptive filter device, as shown in fig. 1, including: at least one multiplexing device, the multiplexing device comprising one or more of: the system comprises a Fourier transform FFT multiplexing module, a zero insertion multiplexing module and a complex multiplier multiplexing module;
the multiplexing device is configured to determine the next state to be jumped to by the multiplexing device according to the jump condition which is currently met, and execute corresponding operation according to the next state to be jumped to;
wherein, different states corresponding to a multiplexing device respectively represent different operations using the multiplexing device in the adaptive filtering; the jump condition represents a condition for jumping from one state to the next in adaptive filtering.
The states included in the adaptive filtering may be divided in advance according to operations, and one operation may be represented by one state; according to the sequence of operation, different states have corresponding sequence; after the state corresponding to the last operation of the adaptive filtering, the state corresponding to the first operation of the adaptive filtering may be followed, which indicates that the next round of adaptive filtering is started. Each state may jump to the next state when a jump condition is satisfied, the jump condition may be different for different states, and the jump condition may be, but is not limited to, that the operation represented for the current state is completed.
The states corresponding to one multiplexing device are not necessarily adjacent to each other in the adaptive filtering, but the states are sequentially performed for the multiplexing device. For example, the state sequence in the adaptive filtering is state 1, state 2, state 3, and state 4; the operations represented by states 1 and 3 require the use of a multiplexer, and although states 1 and 3 are not adjacent in the adaptive filtering, state 1 is followed by state 3 in the multiplexer.
In an exemplary embodiment, each multiplexing device is provided with a corresponding state machine;
each state machine is configured to store the jump sequence between different states of the corresponding multiplexing device, and control the corresponding multiplexing device to clear data of the current state and jump to the next state according to the currently met jump condition.
In an exemplary embodiment, each state corresponding to the FFT multiplexing module and the jump condition that needs to be satisfied when jumping to the state include:
the first state is the first Fourier transform in the self-adaptive filtering, and the corresponding first jumping condition is that the FDAF starting is finished or the zero block insertion for the second time is finished;
the second state is the second Fourier transform in the self-adaptive filtering, and the corresponding second jumping condition is the completion of W parameter updating;
the third state is the first inverse Fourier transform in the self-adaptive filtering, and the corresponding third jump condition is that the first complex multiplication is completed;
the fourth state is the third Fourier transform in the self-adaptive filtering, and the corresponding fourth jumping condition is that zero block insertion for the first time is completed;
and the fifth state is the second inverse Fourier transform in the self-adaptive filtering, and the corresponding fifth jumping condition is the completion of the second complex multiplication.
In an exemplary embodiment, each state corresponding to the zero insertion multiplexing module and the jump condition that needs to be satisfied when jumping to the state include:
the sixth state is that zero blocks are inserted for the first time in the self-adaptive filtering, and the corresponding sixth skipping condition is that the output processing is finished;
and the seventh state is that zero blocks are inserted for the second time in the self-adaptive filtering, and the corresponding seventh jumping condition is that the second inverse Fourier transform is completed.
In an exemplary embodiment, each state corresponding to the complex multiplier multiplexing module and the jump condition that needs to be satisfied when jumping to the state include:
the eighth state is the first complex multiplication calculation in the self-adaptive filtering, and the corresponding eighth jumping condition is the completion of the second Fourier transform;
and the ninth state is the second complex multiplication calculation in the self-adaptive filtering, and the corresponding ninth jumping condition is the completion of the third Fourier transform.
In an exemplary embodiment, each state is provided with a state identifier, each state identifier is used for identifying the corresponding state, and each state identifier has global uniqueness;
each jump condition is provided with a condition code, each condition code is used for identifying the corresponding jump condition, and each condition code has global uniqueness.
In an exemplary embodiment, each state is provided with a status flag indicating whether the operation in that state is in a start phase or a finish phase.
In an exemplary embodiment, each multiplexing device is further configured to, when performing an operation represented by one state, perform a preparation for a next state to be jumped to in parallel if the operation result of the state has no dependency on the operation represented by the next state to be jumped to.
The technical scheme provided by the embodiment of the invention realizes the multiplexing of partial modules on the premise of ensuring the FDAF function, and can achieve the purpose of reducing resource consumption.
In an embodiment of the present invention, fig. 2 is a schematic flow chart illustrating a completion of one FDAF operation, and as shown in fig. 2, the performing of one FDAF sequentially includes: 13 operation steps;
the 13 operation steps are respectively as follows according to the sequence: FDAF starting, first Fourier transformation, W parameter updating, second Fourier transformation, first complex multiplication calculation, first inverse Fourier transformation, output processing, first zero block insertion, third Fourier transformation, second complex multiplication calculation, division, second inverse Fourier transformation and second zero block insertion.
In an exemplary embodiment, the 13 operations may be set to 13 states, respectively, and the different states represent different operations, respectively.
In an exemplary embodiment, a state identifier may be set for each state, each state identifier is used to identify a corresponding state, and each state identifier has global uniqueness. For example, in this embodiment, the state flags of 13 states corresponding to the above 13 operations may be set as: startup, FFT3& data loading, W parameter update, FFT1, complex multiplier 2, IFFT2& conjugate taking, output processing, zero insertion block 1, FFT2& P parameter update, complex multiplier 1, division, IFFT1, zero insertion block 2.
In an exemplary embodiment, each condition for jumping from one state to the next state in the adaptive filtering may be set as a jump condition, each jump condition is provided with a condition code, each condition code is used for identifying the corresponding jump condition, and each condition code has global uniqueness. In other embodiments, the jump condition may be identified in other manners as long as one jump condition can be uniquely referred to.
In an exemplary embodiment, as shown in table 1, the following jump conditions and corresponding condition codes may be set for all states of one FDAF:
table 1:
where the number 0 represents a reset, indicating that whatever state is in, after reset, it will revert back to IDLE.
Based on the adaptive filtering process shown in fig. 2, an embodiment of the present invention provides an adaptive filtering device, as shown in fig. 3, which includes an FFT multiplexing module;
the FFT multiplexing module is configured to determine the next state to be jumped to by the FFT multiplexing module according to the jump condition which is met currently, and execute corresponding operation according to the next state to be jumped to;
wherein, different states corresponding to the FFT multiplexing module respectively represent different operations using the FFT multiplexing module in the adaptive filtering; the jump condition represents a condition for jumping from one state to the next in adaptive filtering.
In an exemplary embodiment, the FFT multiplexing module is responsible for converting the time domain signal into a frequency domain signal using a FFT (Fast Fourier transform) function in the FDAF, and converting the frequency domain signal into the time domain signal through IFFT (inverse Fast Fourier transform).
In an exemplary embodiment, since the FFT and IFFT operation structure is similar, the FFT IP core of an FPGA (Field-Programmable Gate Array) can be used to support the FFT and IFFT functions through configuration signals. For example, the states of the status flags FFT3& data load, FFT1, FFT2& P parameter update are correspondingly configured to convert the time domain signal into the frequency domain signal using a FFT (Fast Fourier transform) function; the state flag IFFT2& deconjugated, IFFT1 is correspondingly configured to convert the frequency domain signals to time domain signals by IFFT (inverse Fast Fourier Transformation).
The IP Core is a module provided by a certain party and designed in the form of a logic unit or a chip. The logic design of an application specific integrated circuit or a field editable gate array is carried out on the basis of an IP core, so that the design period can be shortened, and the design quality and efficiency can be improved.
In an exemplary embodiment, the FFT multiplexing module corresponds to 5 states in a single FDAF according to a hopping sequence, and information of the 5 states is shown in table 2:
table 2:
in an exemplary embodiment, based on the information shown in table 2, an FFT state transition diagram as shown in fig. 4 can be obtained.
In an exemplary embodiment, an FFT state machine may be set for the FFT multiplexing module, the FFT state machine stores the jump sequence between different states of the FFT multiplexing module, and controls the FFT multiplexing module to clear data of a current state and jump to a next state according to a jump condition currently satisfied. The FFT state machine can ensure that no conflict is caused when the FFT multiplexing module is multiplexed, and is used for clearing the input and the output of each FFT/IFFT operation.
For example, based on the FFT state transition diagram shown in fig. 4, the FFT state machine controls the state jump sequence of the FFT multiplexing module to be: FFT3- > FFT1- > IFFT2- > FFT2- > IFFT 1. The FFT state machine adopts the jump sequence, so that the input of new data can be properly accepted, and meanwhile, excessive waiting time can be avoided when the data effectively circulate.
In an exemplary embodiment, when multiplexing the FFT multiplexing module, if there is no front-back dependency relationship between the calculation result of the previous FFT/IFFT and the calculation result of the next FFT/IFFT, parallel calculation may be performed. For example, in FFT IP, assuming that the length of data entering the FFT is N, the number of cycles is about (N × log2(N)/2) +2 × N, e.g., 1024 points of data input, and after about 7K cycles, the result is obtained. The operation period can be further reduced by parallel computation. For another example, when performing FFT3 calculation, the input data is buffered at the same time, and preparation is made for the calculation of FFT1, reducing the calculation period.
According to the technical scheme of the embodiment of the invention, a large amount of FDAF resources can be saved and the resource consumption is reduced by multiplexing the FFT multiplexing module.
Based on the adaptive filtering process shown in fig. 2, an embodiment of the present invention provides an adaptive filter device, as shown in fig. 5, which includes a complex multiplier multiplexing module;
the complex multiplier multiplexing module is configured to determine the next state to be jumped to by the complex multiplier multiplexing module according to the currently met jump condition, and execute corresponding operation according to the next state to be jumped to;
wherein, different states corresponding to the complex multiplier multiplexing module respectively represent different operations using the complex multiplier multiplexing module in the adaptive filtering; the jump condition represents a condition for jumping from one state to the next in adaptive filtering.
In an exemplary embodiment, the complex multiplier multiplexing module is responsible for converting data in the frequency domain signal into complex numbers in FDAF, involving multiply-add calculations.
In an exemplary embodiment, the complex multiplier multiplexing module corresponds to 2 states in a single FDAF according to a jump sequence, and information of the 2 states is shown in table 3:
table 3:
in an exemplary embodiment, a complex multiplier state transition diagram as shown in fig. 6 may be obtained according to the information shown in table 3.
In an exemplary embodiment, a complex multiplication state machine may be provided for the complex multiplier multiplexing module, the complex multiplication state machine may store the jump sequence between different states of the complex multiplier multiplexing module, and the complex multiplier multiplexing module may be controlled to clear data of a current state and jump to a next state according to a currently satisfied jump condition. The complex multiplication state machine can ensure that the complex multiplier multiplexing module can not cause conflict when being multiplexed, and is used for clearing the input and the output of each complex multiplication calculation.
For example, based on the state transition diagram of the complex multiplier shown in fig. 6, the complex multiplication state machine controls the state jump sequence of the complex multiplication multiplexing module to be: complex multiplier 2- > complex multiplier 1. The jump sequence adopted by the complex multiplication state machine can properly accept the input of new data, and meanwhile, the excessive waiting time can be avoided when the data effectively circulate.
In an exemplary embodiment, when multiplexing the complex multiplication multiplexing module, the calculation result of the previous complex multiplication and the calculation of the next complex multiplication can be calculated in parallel if there is no front-back dependency relationship. The operation period can be further reduced by parallel computation.
According to the technical scheme of the embodiment of the invention, a large amount of FDAF resources can be saved and the resource consumption is reduced by multiplexing the complex multiplication multiplexing module.
Based on the adaptive filtering process shown in fig. 2, an embodiment of the present invention provides an adaptive filter device, as shown in fig. 7, which includes a zero-insertion multiplexing module;
the zero insertion multiplexing module is configured to determine the next state to be jumped to by the zero insertion multiplexing module according to the jump condition currently met, and execute corresponding operation according to the next state to be jumped to;
wherein, different states corresponding to the zero insertion multiplexing module respectively represent different operations using the zero insertion multiplexing module in the adaptive filtering; the jump condition represents a condition for jumping from one state to the next in adaptive filtering.
In an exemplary embodiment, the zero-insertion multiplexing module is responsible for performing a zero-insertion operation in the FDAF, where zero-insertion is performed once in front of the operand and once in back of the operand. The front zero insertion function and the rear zero insertion function can be realized by configuration, for example, the state of the state flag as zero insertion block 2 is correspondingly configured as rear zero insertion; the state of the state flag being zero insertion block 1 is arranged to correspond to the forward zero insertion.
In an exemplary embodiment, the zero insertion multiplexing module corresponds to 2 states in a single FDAF according to a skip sequence, and information of the 2 states is shown in table 4:
table 4:
in an exemplary embodiment, based on the information shown in table 4, the inserted zero block state transition diagram shown in fig. 8 can be obtained.
In an exemplary embodiment, a zero insertion state machine may be set for the zero insertion multiplexing module, the zero insertion state machine may store a jump sequence between different states of the zero insertion multiplexing module, and the zero insertion multiplexing module may be controlled to clear data of a current state and jump to a next state according to a currently satisfied jump condition. The zero insertion state machine can ensure that the multiplexing module of the zero insertion can not cause conflict, and is used for clearing the input and the output of each zero insertion operation.
For example, based on the zero-insertion block state transition diagram shown in fig. 8, the zero-insertion state machine controls the state jump sequence of the zero-insertion multiplexing module to be: insert zero block 1- > insert zero block 2. The zero insertion state machine adopts the jump sequence, can properly accept the input of new data, and can ensure that the data does not have excessive waiting time when effectively circulating.
In an exemplary embodiment, when the zero-insertion multiplexing module is multiplexed, the calculation of the last zero-insertion calculation result and the next zero-insertion calculation can be performed in parallel if there is no front-back dependency relationship. The operation period can be further reduced by parallel computation.
According to the technical scheme of the embodiment of the invention, a large amount of FDAF resources can be saved and the resource consumption is reduced by multiplexing the zero insertion multiplexing module.
Based on the adaptive filtering process shown in fig. 2, an embodiment of the present invention provides an adaptive filter device, as shown in fig. 9, the adaptive filter device includes an FFT multiplexing module, a complex multiplier multiplexing module, and a zero-insertion multiplexing module;
in an exemplary embodiment, the implementation of the FFT multiplexing module refers to the content described in the above embodiments, and is not described herein again.
In an exemplary embodiment, the implementation of the complex multiplier refers to the content described in the above embodiments, and is not described herein again.
In an exemplary embodiment, the implementation scheme of the zero insertion multiplexing module refers to the content described in the above embodiments, and is not described herein again.
In an exemplary embodiment, based on the information shown in table 1, an overall state transition diagram as shown in fig. 10 may be obtained. The overall state transition diagram is a state control and state transition sequence of the overall state of the once FDAF.
In an exemplary embodiment, the adaptive filtering device further includes a controller. The controller can respectively refine each operation in once FDAF into a single-trend state in advance, and set a jump condition for each state, namely state conversion can be realized. The trend of the whole process can be controlled through the controller, the normal operation of each module is guaranteed, and meanwhile, when new data arrive, the operation process can be correctly entered.
In an exemplary embodiment, the controller may also engage the state machine and perform other related operations. When partial operation is performed, other operations can be performed in parallel, and the operation period is reduced.
In an exemplary embodiment, other operation state machines may be provided for controlling state transitions of operations other than FFT/IFFT, complex multiplication computation, zero insertion operations.
In an exemplary embodiment, when a state is entered and the computation or data processing is not complete, the state is maintained until the computation is complete. In this example, a status flag may be set for each state, the status flag indicating whether the operation in that state is in the start phase or the completion phase. For example, a start flag start and an operation completion flag done are set for each of the divided states. The controller or the state machine can judge whether the state is started or completed by reading the state flag of each state.
In an exemplary embodiment, the start flag start may be pulled high by one cycle after the operation represented by the corresponding state starts to be executed, and the operation completion flag done may be pulled low after the operation represented by the corresponding state starts to be executed, and pulled high after the calculation is completed. The rising edge of the done flag done in the previous state operation can be sampled as the start flag of the next state operation.
In an exemplary embodiment, the operation period of the FDAF may be reduced by the controller performing other non-dependent operations among modules having a longer operation time. On the premise of ensuring the FDAF function, multiplexing of partial modules is realized through the controller of the FDAF, parallel work of the partial modules is met, and after the aim of reducing resources is achieved, the operation period of the modules can be shortened.
According to the technical scheme of the embodiment of the invention, the low-resource FDAF based on the FPGA realizes multiplexing of partial modules through ordered state transformation, and the aim of reducing resources is fulfilled. Furthermore, other non-relevant operations are performed in the middle of the module with longer running time, so that the operation period of the FDAF can be reduced, and the requirement of certain operation speed can be met on the premise of using lower resources.
The technical scheme of the embodiment of the invention can enable the FDAF to be more widely applied to various environments.
An embodiment of the present invention further provides a self-adaptive filtering method, which is applied to the self-adaptive filtering device described in any of the above examples; as shown in fig. 11, the method includes:
when any multiplexing device needs to be used in one-step operation, determining the next state to be jumped to by the multiplexing device according to the currently met jump condition, and executing corresponding operation according to the next state to be jumped to;
wherein, different states corresponding to a multiplexing device respectively represent different operations using the multiplexing device in the adaptive filtering; the jump condition represents a condition for jumping from one state to the next in adaptive filtering.
An embodiment of the present invention further provides a computer-readable storage medium, which stores a computer program, wherein the computer program, when executed by a processor, implements the adaptive filtering method described above.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
Claims (10)
1. An adaptive filter device, comprising: at least one multiplexing device, the multiplexing device comprising one or more of: the system comprises a Fourier transform FFT multiplexing module, a zero insertion multiplexing module and a complex multiplier multiplexing module;
the multiplexing device is configured to determine the next state to be jumped to by the multiplexing device according to the jump condition which is currently met, and execute corresponding operation according to the next state to be jumped to;
wherein, different states corresponding to a multiplexing device respectively represent different operations using the multiplexing device in the adaptive filtering; the jump condition represents a condition for jumping from one state to the next in adaptive filtering.
2. An adaptive filter device according to claim 1, wherein each multiplexing device is provided with a corresponding state machine;
each state machine is configured to store the jump sequence between different states of the corresponding multiplexing device, and control the corresponding multiplexing device to clear data of the current state and jump to the next state according to the currently met jump condition.
3. The adaptive filter device according to claim 1, wherein the FFT multiplexing module corresponds to each state and the jump condition to the state needs to be satisfied includes:
the first state is the first Fourier transform in the self-adaptive filtering, and the corresponding first jumping condition is that the FDAF starting is finished or the zero block insertion for the second time is finished;
the second state is the second Fourier transform in the self-adaptive filtering, and the corresponding second jumping condition is the completion of W parameter updating;
the third state is the first inverse Fourier transform in the self-adaptive filtering, and the corresponding third jump condition is that the first complex multiplication is completed;
the fourth state is the third Fourier transform in the self-adaptive filtering, and the corresponding fourth jumping condition is that zero block insertion for the first time is completed;
and the fifth state is the second inverse Fourier transform in the self-adaptive filtering, and the corresponding fifth jumping condition is the completion of the second complex multiplication.
4. The adaptive filter device of claim 1, wherein each state corresponding to the zero-insertion multiplexing module and the jump condition to the state to be satisfied includes:
the sixth state is that zero blocks are inserted for the first time in the self-adaptive filtering, and the corresponding sixth skipping condition is that the output processing is finished;
and the seventh state is that zero blocks are inserted for the second time in the self-adaptive filtering, and the corresponding seventh jumping condition is that the second inverse Fourier transform is completed.
5. The adaptive filter device of claim 1, wherein each state of the complex multiplier multiplexing module and the jump condition to be satisfied for jumping to the state comprises:
the eighth state is the first complex multiplication calculation in the self-adaptive filtering, and the corresponding eighth jumping condition is the completion of the second Fourier transform;
the ninth state is the first complex multiplication calculation in the adaptive filtering, and the corresponding ninth jumping condition is the completion of the third Fourier transform.
6. The adaptive filter device of claim 1, wherein each state is provided with a state identifier, each state identifier being used to identify the corresponding state, each state identifier having global uniqueness;
each jump condition is provided with a condition code, each condition code is used for identifying the corresponding jump condition, and each condition code has global uniqueness.
7. An adaptive filter device according to claim 1, wherein each state is provided with a status flag indicating whether operation in that state is in a start phase or a finish phase.
8. The adaptive filtering device according to claim 1, wherein each multiplexing device is further configured to perform, in parallel, preparation for a next state to be skipped if the operation result of the state has no dependency on the operation represented by the next state to be skipped when the operation represented by the state is performed.
9. An adaptive filtering method applied to the adaptive filter device of any one of claims 1 to 8; the method comprises the following steps:
sequentially executing each step of operation in the self-adaptive filtering according to a preset sequence;
when any multiplexing device needs to be used in one-step operation, determining the next state to be jumped to by the multiplexing device according to the currently met jump condition, and executing corresponding operation according to the next state to be jumped to;
wherein, different states corresponding to a multiplexing device respectively represent different operations using the multiplexing device in the adaptive filtering; the jump condition represents a condition for jumping from one state to the next in adaptive filtering.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program, wherein the computer program, when executed by a processor, implements the adaptive filtering method of claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011545075.XA CN112737548A (en) | 2020-12-23 | 2020-12-23 | Adaptive filtering method, device and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011545075.XA CN112737548A (en) | 2020-12-23 | 2020-12-23 | Adaptive filtering method, device and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112737548A true CN112737548A (en) | 2021-04-30 |
Family
ID=75605243
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011545075.XA Pending CN112737548A (en) | 2020-12-23 | 2020-12-23 | Adaptive filtering method, device and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112737548A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873277A (en) * | 2010-06-10 | 2010-10-27 | 复旦大学 | VLSI structure suitable for suppressing channel estimation and equalization algorithms of long echo in DTMB system |
| CN106649200A (en) * | 2016-12-27 | 2017-05-10 | 南京大学 | Time division multiplexing-based self-correlation calculation VLSI design method |
| CN108141202A (en) * | 2015-07-28 | 2018-06-08 | 弗劳恩霍夫应用研究促进协会 | Blockette adaptive frequency domain filter equipment including adaptation module and correction module |
-
2020
- 2020-12-23 CN CN202011545075.XA patent/CN112737548A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873277A (en) * | 2010-06-10 | 2010-10-27 | 复旦大学 | VLSI structure suitable for suppressing channel estimation and equalization algorithms of long echo in DTMB system |
| CN108141202A (en) * | 2015-07-28 | 2018-06-08 | 弗劳恩霍夫应用研究促进协会 | Blockette adaptive frequency domain filter equipment including adaptation module and correction module |
| CN106649200A (en) * | 2016-12-27 | 2017-05-10 | 南京大学 | Time division multiplexing-based self-correlation calculation VLSI design method |
Non-Patent Citations (2)
| Title |
|---|
| J. J. SHYNK: "Frequency-domain and multirate adaptive filtering", 《IEEE SIGNAL PROCESSING MAGAZINE》 * |
| 史治国，洪少华，陈抗生编著: "《基于XILINX FPGA的OFDM通信系统基带设计》", 31 March 2009, 浙江大学出版社 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20080196030A1 (en) | Optimizing memory accesses for multi-threaded programs in a non-uniform memory access (numa) system | |
| CN107728953B (en) | Method for improving mixed read-write performance of solid state disk | |
| CN111352350A (en) | Method and device for determining execution of smart home scene | |
| CN101763433A (en) | Data storage system and method | |
| CN110489396B (en) | User interface data isolation method and device | |
| US20170099167A1 (en) | System and method for multi-threaded ofdm channel equalizer with coprocessor | |
| CN112737548A (en) | Adaptive filtering method, device and computer readable storage medium | |
| CN108831496B (en) | echo suppression method and device, storage medium and electronic equipment | |
| CN104575508B (en) | A kind of processing method and its device of audio signal modified tone | |
| CN116614215B (en) | Data synchronization method, device, signal receiving terminal and storage medium | |
| CN116150067A (en) | Bandwidth adjustment method, device, electronic equipment and storage medium | |
| CN102457251B (en) | Method and device for realizing universal digital filter | |
| CN115395842A (en) | Method and device for expanding current loop bandwidth, storage medium and servo driver | |
| CN115456009A (en) | Signal processing method, device operation monitoring device, device and medium | |
| CN112631781B (en) | Operator execution method and device, electronic equipment and storage medium | |
| CN111309475B (en) | Detection task execution method and equipment | |
| CN115809625A (en) | Method and device for realizing filtering processing, computer storage medium and terminal | |
| CN110069221B (en) | Data release method and device | |
| CN101557376B (en) | Method and device for generating windowing subband waveform | |
| CN112558921A (en) | Device and method for realizing cross-correlation operation | |
| CN112631648A (en) | Service configuration method and device, electronic equipment and storage medium | |
| US9621130B2 (en) | Configurable generic filter hardware block and methods | |
| CN111090635B (en) | Configuration method and device of early warning scheme and computer readable storage medium | |
| CN111831390B (en) | Resource management method and device of server and server | |
| US8711920B1 (en) | System and method for multi-threaded OFDM channel equalizer |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210430 |