Pub Date : 2022-03-30DOI: 10.1109/dspa53304.2022.9790744
P. Nikishkin, R. Goriushkin, N. Vinogradov, E. Likhobabin, V. Vityazev
This paper presents a min-sum decoder design for Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes. The design is supported various LDPC Parity-Check matrices including the WiMAX (IEEE 802.16e) and the WiFi (IEEE 802.11n) standards matrices. New techniques such as pipelining of the decoding architecture core are proposed. These core calculate variable-to-check (VTC) and new check-to-variable (CTV) messages and also update estimate of posterior probabilities (APPs). The parallel multicore decoding architecture implies a prior shift of values based on the LDPC matrix and simultaneous calculation of values for the core. Proposed decoder is implemented on the Zynq-7000 Mini-ITX Evaluation Board (XC7Z100-2FFG900).
{"title":"High throughput FPGA implementation of Min-Sum LDPC Decoder Architecture for Wireless Communication Standards","authors":"P. Nikishkin, R. Goriushkin, N. Vinogradov, E. Likhobabin, V. Vityazev","doi":"10.1109/dspa53304.2022.9790744","DOIUrl":"https://doi.org/10.1109/dspa53304.2022.9790744","url":null,"abstract":"This paper presents a min-sum decoder design for Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes. The design is supported various LDPC Parity-Check matrices including the WiMAX (IEEE 802.16e) and the WiFi (IEEE 802.11n) standards matrices. New techniques such as pipelining of the decoding architecture core are proposed. These core calculate variable-to-check (VTC) and new check-to-variable (CTV) messages and also update estimate of posterior probabilities (APPs). The parallel multicore decoding architecture implies a prior shift of values based on the LDPC matrix and simultaneous calculation of values for the core. Proposed decoder is implemented on the Zynq-7000 Mini-ITX Evaluation Board (XC7Z100-2FFG900).","PeriodicalId":428492,"journal":{"name":"2022 24th International Conference on Digital Signal Processing and its Applications (DSPA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128315939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-30DOI: 10.1109/dspa53304.2022.9790759
V. Djigan
A phase-less algorithm of the antenna array calibration is presented in this paper. The algorithm is used to estimate and compensate the signal phase lag variation in the array channels. The estimated phase lags include the lags, caused by the channel equipment, and the lags, caused by the signal source spatial location in the case of the receiving array or, otherwise, the receiver spatial location in the case of the transmitting array. The compensation of the first-mentioned phase lags means the array calibration and the compensation of the second-mentioned phase lags means the array calibration and beam steering simultaneously, because the channel, space and phase lags are not separable. The proposed algorithm requires $boldsymbol{4+4(M-1)}$ measurements of the array output power after the changing of the signal phase to the specific values sequentially in the pairs of the reference and each of the calibrated channels of the array. Here, $boldsymbol{M}$ is the number of the array channels. This algorithm requires about 33% less power measurements, and therefore has less complexity comparing to the similar calibration algorithm, which requires $boldsymbol{2+6(M-1)}$ of such measurements. The accuracy of the channel phase estimation using the proposed or known calibration algorithm does not exceed the value of one discrete of the phase quantization by means of the digitally controlled phaseshifter. The proposed algorithm can be used in arrays of arbitrary geometric configuration.
{"title":"Reduced Complexity Antenna Array Calibration Algorithm","authors":"V. Djigan","doi":"10.1109/dspa53304.2022.9790759","DOIUrl":"https://doi.org/10.1109/dspa53304.2022.9790759","url":null,"abstract":"A phase-less algorithm of the antenna array calibration is presented in this paper. The algorithm is used to estimate and compensate the signal phase lag variation in the array channels. The estimated phase lags include the lags, caused by the channel equipment, and the lags, caused by the signal source spatial location in the case of the receiving array or, otherwise, the receiver spatial location in the case of the transmitting array. The compensation of the first-mentioned phase lags means the array calibration and the compensation of the second-mentioned phase lags means the array calibration and beam steering simultaneously, because the channel, space and phase lags are not separable. The proposed algorithm requires $boldsymbol{4+4(M-1)}$ measurements of the array output power after the changing of the signal phase to the specific values sequentially in the pairs of the reference and each of the calibrated channels of the array. Here, $boldsymbol{M}$ is the number of the array channels. This algorithm requires about 33% less power measurements, and therefore has less complexity comparing to the similar calibration algorithm, which requires $boldsymbol{2+6(M-1)}$ of such measurements. The accuracy of the channel phase estimation using the proposed or known calibration algorithm does not exceed the value of one discrete of the phase quantization by means of the digitally controlled phaseshifter. The proposed algorithm can be used in arrays of arbitrary geometric configuration.","PeriodicalId":428492,"journal":{"name":"2022 24th International Conference on Digital Signal Processing and its Applications (DSPA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134073472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-30DOI: 10.1109/dspa53304.2022.9790770
V. Bugrov, E. Fitasov, V. Sataev, O. Kudryashova
The rationale for using the quantization of the coefficients of a digital FIR filter in the concept of dynamic programming is given as a process of stepwise quantization of the coefficients with their discrete optimization at each step according to the objective function common to the entire quantization process. An algorithm for step-by-step dynamic quantization is considered by methods of integer nonlinear programming, taking into account the given signal scaling. The effectiveness of this approach is illustrated by the example of dynamic quantization of the coefficients of a cascaded high-pass FIR filter with a minimum bit depth of representation of integer coefficients.
{"title":"Dynamic Coefficient Quantization Digital FIR Filter","authors":"V. Bugrov, E. Fitasov, V. Sataev, O. Kudryashova","doi":"10.1109/dspa53304.2022.9790770","DOIUrl":"https://doi.org/10.1109/dspa53304.2022.9790770","url":null,"abstract":"The rationale for using the quantization of the coefficients of a digital FIR filter in the concept of dynamic programming is given as a process of stepwise quantization of the coefficients with their discrete optimization at each step according to the objective function common to the entire quantization process. An algorithm for step-by-step dynamic quantization is considered by methods of integer nonlinear programming, taking into account the given signal scaling. The effectiveness of this approach is illustrated by the example of dynamic quantization of the coefficients of a cascaded high-pass FIR filter with a minimum bit depth of representation of integer coefficients.","PeriodicalId":428492,"journal":{"name":"2022 24th International Conference on Digital Signal Processing and its Applications (DSPA)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134518876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-30DOI: 10.1109/dspa53304.2022.9790745
Kharina Natalya, Chernyadyev Sergei
The paper proposes a software for recognizing car license plates. The software is intended for integration into an autonomous module for installation on a gate at the entrance to the protected area. A feature of the software is the use of computer vision algorithms, the implementation of which requires minimal computing resources, since the video stream is being processed by a low-end CPU. The software is executed in the form of the caused library in language C ++ with use of standard functions of library of computer vision OpenCV. The software consists of following steps: image preprocessing and binarization, license plate localization, plate rotation and normalization, segmentation inside the license plate, segmentation result validation, text recognition. To verify and test the software, a camera was installed on the gate with the subsequent processing of the received video data. As a result of testing probability of correct recognition 0.96, probability of recognition error - 0.004, probability of missing - 0.035, probability of false recognition - 0.015, the frame processing time at a frame resolution of 3 MPix on an Orange Pi Pc 2 CPU with an Allwinner H5 Quad-Core ARM Cortex-A53 64 bit processor is 1.2-1.5 s.
提出了一种汽车车牌识别软件。该软件旨在集成到一个自动模块中，安装在保护区入口处的大门上。该软件的一个特点是使用计算机视觉算法，其实现需要最少的计算资源，因为视频流是由低端CPU处理的。本软件以c++语言的cause库的形式，利用计算机视觉库的标准函数OpenCV来执行。该软件包括以下几个步骤:图像预处理和二值化、车牌定位、车牌旋转和归一化、车牌内部分割、分割结果验证、文本识别。为了验证和测试软件，在门上安装了摄像机，并对接收到的视频数据进行后续处理。测试结果表明:正确识别概率为0.96，识别错误概率为- 0.004，缺失概率为- 0.035，错误识别概率为- 0.015，在采用Allwinner H5四核ARM Cortex-A53 64位处理器的Orange Pi Pc 2 CPU上，帧分辨率为3 MPix的帧处理时间为1.2-1.5 s。
{"title":"Software for Car License Plates Recognition with Minimal Computing Resources","authors":"Kharina Natalya, Chernyadyev Sergei","doi":"10.1109/dspa53304.2022.9790745","DOIUrl":"https://doi.org/10.1109/dspa53304.2022.9790745","url":null,"abstract":"The paper proposes a software for recognizing car license plates. The software is intended for integration into an autonomous module for installation on a gate at the entrance to the protected area. A feature of the software is the use of computer vision algorithms, the implementation of which requires minimal computing resources, since the video stream is being processed by a low-end CPU. The software is executed in the form of the caused library in language C ++ with use of standard functions of library of computer vision OpenCV. The software consists of following steps: image preprocessing and binarization, license plate localization, plate rotation and normalization, segmentation inside the license plate, segmentation result validation, text recognition. To verify and test the software, a camera was installed on the gate with the subsequent processing of the received video data. As a result of testing probability of correct recognition 0.96, probability of recognition error - 0.004, probability of missing - 0.035, probability of false recognition - 0.015, the frame processing time at a frame resolution of 3 MPix on an Orange Pi Pc 2 CPU with an Allwinner H5 Quad-Core ARM Cortex-A53 64 bit processor is 1.2-1.5 s.","PeriodicalId":428492,"journal":{"name":"2022 24th International Conference on Digital Signal Processing and its Applications (DSPA)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130283686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-30DOI: 10.1109/dspa53304.2022.9790743
Dmitry V. Khablov
This paper describes a control system for two-wheeled mobile robots capable of moving in rooms in an autonomous mode without using satellite navigation signals. The movement takes place along a given route, maneuvering is carried out using an electronic differential that controls the speeds of rotation of both wheels. In this case, the control of the control parameters of the movement is carried out not by odometers or rotation sensors, but by microwave Doppler sensors. This enables a direct measurement of the linear speeds of the wheels. The algorithm of operation of the proposed control system when performing maneuvers and moving along the selected trajectory is described. An increase in the accuracy of movement along the route is noted in comparison with traditional control methods.
{"title":"Control of Two-Wheel Mobile Robots Using Doppler Microwave Sensors","authors":"Dmitry V. Khablov","doi":"10.1109/dspa53304.2022.9790743","DOIUrl":"https://doi.org/10.1109/dspa53304.2022.9790743","url":null,"abstract":"This paper describes a control system for two-wheeled mobile robots capable of moving in rooms in an autonomous mode without using satellite navigation signals. The movement takes place along a given route, maneuvering is carried out using an electronic differential that controls the speeds of rotation of both wheels. In this case, the control of the control parameters of the movement is carried out not by odometers or rotation sensors, but by microwave Doppler sensors. This enables a direct measurement of the linear speeds of the wheels. The algorithm of operation of the proposed control system when performing maneuvers and moving along the selected trajectory is described. An increase in the accuracy of movement along the route is noted in comparison with traditional control methods.","PeriodicalId":428492,"journal":{"name":"2022 24th International Conference on Digital Signal Processing and its Applications (DSPA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126402967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-30DOI: 10.1109/dspa53304.2022.9790769
A. Denisov, Y. Kuznetsov, A. Baev, M. Konovalyuk, A. Gorbunova
The wireless access points of smartphones, tablets, and other devices face collisions and the channel throughput decrease in public places due to the limited numbers of channels. The channel spacing is required to reduce the effects of adjacent channel interference. This paper proposes an effective interfer-ence suppression method based on the cyclic Wiener filter. In the laboratory test setup, different channel spacing is simulated using a set of frequency shifts between the signal of interest and interference. The analytical and experimental comparisons of the stationary Wiener filter and cyclic Wiener filter for WLAN signals models are performed.
{"title":"WLAN Adjacent Channel Interference Suppression Using Cyclic Wiener Filter","authors":"A. Denisov, Y. Kuznetsov, A. Baev, M. Konovalyuk, A. Gorbunova","doi":"10.1109/dspa53304.2022.9790769","DOIUrl":"https://doi.org/10.1109/dspa53304.2022.9790769","url":null,"abstract":"The wireless access points of smartphones, tablets, and other devices face collisions and the channel throughput decrease in public places due to the limited numbers of channels. The channel spacing is required to reduce the effects of adjacent channel interference. This paper proposes an effective interfer-ence suppression method based on the cyclic Wiener filter. In the laboratory test setup, different channel spacing is simulated using a set of frequency shifts between the signal of interest and interference. The analytical and experimental comparisons of the stationary Wiener filter and cyclic Wiener filter for WLAN signals models are performed.","PeriodicalId":428492,"journal":{"name":"2022 24th International Conference on Digital Signal Processing and its Applications (DSPA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130864943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-30DOI: 10.1109/dspa53304.2022.9790742
V. Zolotarev, G. Ovechkin, Ch. T. Zung
The results of the Optimization Theory (OT) of error-correcton coding obtained over 50 years are considered. It is shown that OT completely solved the Shannon's problem for all classical channels. It is indicated that OT algorithms provide the best possible characteristics. It is noted that the united criterion for the quality of algorithms <> ≡ “noiseproofness-veracity-complexity” is satisfied only by decoders created within the framework of OT, which have the best theoretically possible characteristics. The simplest practically optimal decoders OT are built on the basis of the theories of the search for global extremums of functionals. Our block Viterbi algorithms also have minimal complexity.
{"title":"The Prospects of Optimization Theory Application for Solving Shannon Problem","authors":"V. Zolotarev, G. Ovechkin, Ch. T. Zung","doi":"10.1109/dspa53304.2022.9790742","DOIUrl":"https://doi.org/10.1109/dspa53304.2022.9790742","url":null,"abstract":"The results of the Optimization Theory (OT) of error-correcton coding obtained over 50 years are considered. It is shown that OT completely solved the Shannon's problem for all classical channels. It is indicated that OT algorithms provide the best possible characteristics. It is noted that the united criterion for the quality of algorithms <<NVC>> ≡ “noiseproofness-veracity-complexity” is satisfied only by decoders created within the framework of OT, which have the best theoretically possible characteristics. The simplest practically optimal decoders OT are built on the basis of the theories of the search for global extremums of functionals. Our block Viterbi algorithms also have minimal complexity.","PeriodicalId":428492,"journal":{"name":"2022 24th International Conference on Digital Signal Processing and its Applications (DSPA)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130204884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The rapid development of information technology has significantly expanded the scope of application of digital Fourier processing of finite signals. We note tomography, active and passive sonar, radar, seismology, technical diagnostics, medicine, forensic cybernetics, and artificial intelligence among these applications. The complication of the tasks solved by information technologies in these subject areas stimulated, firstly, the transition from one-dimensional to two-dimensional digital Fourier processing, and secondly, it posed an urgent theoretical and applied problem of finding new basic systems, both in one-dimensional and two-dimensional case. Systems analysis has shown that the transition from the one-dimensional to the two-dimensional case is far from trivial and is primarily of a qualitative rather than quantitative nature. At the same time, the generalization of the results of the two-dimensional case to the multidimensional one, as a rule, does not cause difficulties, since it is mainly quantitative, and not qualitative. A systematic analysis of the actual theoretical and applied problem of searching for new basic systems has shown that the most important requirements for basic systems are: orthogonality, symmetry and multiplicativity. The article provides the detailed analysis of the analytical properties of new two discrete Fourier transforms developed by the authors. These are Parametric Discrete Fourier Transform (DFT-P) for Fourier processing of scalar functions of scalar arguments and 2D Discrete Fourier Transform with variable parameters (2D DFT-VP) for Fourier processing of scalar functions of vector arguments. DFT-P and 2D DFT-VP transforms are based on a generalization of exponential basis systems of DFT and 2D DFT transforms.
{"title":"Evolution of One-Dimensional and Two-Dimensional Discrete Fourier Transform","authors":"Ponomarev Alexey, Ponomareva Olga, Smirnova Natalia","doi":"10.1109/dspa53304.2022.9790768","DOIUrl":"https://doi.org/10.1109/dspa53304.2022.9790768","url":null,"abstract":"The rapid development of information technology has significantly expanded the scope of application of digital Fourier processing of finite signals. We note tomography, active and passive sonar, radar, seismology, technical diagnostics, medicine, forensic cybernetics, and artificial intelligence among these applications. The complication of the tasks solved by information technologies in these subject areas stimulated, firstly, the transition from one-dimensional to two-dimensional digital Fourier processing, and secondly, it posed an urgent theoretical and applied problem of finding new basic systems, both in one-dimensional and two-dimensional case. Systems analysis has shown that the transition from the one-dimensional to the two-dimensional case is far from trivial and is primarily of a qualitative rather than quantitative nature. At the same time, the generalization of the results of the two-dimensional case to the multidimensional one, as a rule, does not cause difficulties, since it is mainly quantitative, and not qualitative. A systematic analysis of the actual theoretical and applied problem of searching for new basic systems has shown that the most important requirements for basic systems are: orthogonality, symmetry and multiplicativity. The article provides the detailed analysis of the analytical properties of new two discrete Fourier transforms developed by the authors. These are Parametric Discrete Fourier Transform (DFT-P) for Fourier processing of scalar functions of scalar arguments and 2D Discrete Fourier Transform with variable parameters (2D DFT-VP) for Fourier processing of scalar functions of vector arguments. DFT-P and 2D DFT-VP transforms are based on a generalization of exponential basis systems of DFT and 2D DFT transforms.","PeriodicalId":428492,"journal":{"name":"2022 24th International Conference on Digital Signal Processing and its Applications (DSPA)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124150995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-30DOI: 10.1109/dspa53304.2022.9790788
Y. Parshin, A. Parshin, M. Grachev
Wide use of MIMO technology opens up some new possibilities for increasing the noise immunity of communication systems. The presence of multiple transmitter antennas and multiple receiver antennas allows for spatial coding and spatial decoding of signals together with spatial interference cancellation. The efficiency of transmit-receive spatial diversity is investigated as a function of the spatial correlation in the MIMO channel and interference correlation on the receiver site. It was found that the influence of the spatial correlation in the MIMO channel on the outage probability of the MIMO communication system is similar to the influence of the interference spatial correlation when the antennas' number is different.
{"title":"Influence of Signal and Interference Spatial Correlation on the MIMO Communication System's Channel Capacity","authors":"Y. Parshin, A. Parshin, M. Grachev","doi":"10.1109/dspa53304.2022.9790788","DOIUrl":"https://doi.org/10.1109/dspa53304.2022.9790788","url":null,"abstract":"Wide use of MIMO technology opens up some new possibilities for increasing the noise immunity of communication systems. The presence of multiple transmitter antennas and multiple receiver antennas allows for spatial coding and spatial decoding of signals together with spatial interference cancellation. The efficiency of transmit-receive spatial diversity is investigated as a function of the spatial correlation in the MIMO channel and interference correlation on the receiver site. It was found that the influence of the spatial correlation in the MIMO channel on the outage probability of the MIMO communication system is similar to the influence of the interference spatial correlation when the antennas' number is different.","PeriodicalId":428492,"journal":{"name":"2022 24th International Conference on Digital Signal Processing and its Applications (DSPA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125786876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The rapid development of information technology has significantly expanded the scope of application of digital Fourier processing of finite signals. Among them, the work noted tomography, active and passive sonar, radar, seismology, technical diagnostics, medicine, forensic cybernetics, and artificial intelligence. The development of information technologies, the complication of the tasks being solved stimulated the transition from one-dimensional to two-dimensional digital Fourier processing. System analysis has shown that the transition from the one-dimensional to the two-dimensional case is far from trivial and is primarily of a qualitative rather than quantitative nature. At the same time, the generalization of the results of the two-dimensional case to the multidimensional one, as a rule, does not cause difficulties, since it is mainly quantitative, and not qualitative. As is known, for the practical application of the application of Fourier processing methods, expanding the scope of their application, an important role belongs to the procedures for the rapid implementation of corresponding Fourier transforms (the story of FFT algorithm proposed in 1965), a clear confirmation of this. The paper deals with the solution of an important and urgent problem of developing fast algorithms for new discrete 2D Fourier transform with variable parameters (2D DFT - VP). Three groups of methods for increasing the speed of two-dimensional discrete fast Fourier transform with variable parameters are proposed and studied in the paper. The 1 st group of methods for improving the speed of 2D DFT-VP is based on the separability property of the kernel of 2D DFT - VP and the use of one-dimensional parametric DFTs (DFT -P). The 2nd group of methods for improving the speed of 2D DFT - VP is based on the property of separability of the kernel of 2D DFT-VP and the use of one-dimensional parametric fast Fourier transforms (FFT-P). Group 3 2D DFT-VP performance improvement methods based on 2D Fast Fourier Transform (2D FFT - VP) in vector base 2, with space decimation, with or without replacement.
{"title":"2D Discrete Fast Fourier Transform with variable parameters","authors":"Ponomarev Alexey, Ponomareva Olga, Smirnova Natalia","doi":"10.1109/dspa53304.2022.9790753","DOIUrl":"https://doi.org/10.1109/dspa53304.2022.9790753","url":null,"abstract":"The rapid development of information technology has significantly expanded the scope of application of digital Fourier processing of finite signals. Among them, the work noted tomography, active and passive sonar, radar, seismology, technical diagnostics, medicine, forensic cybernetics, and artificial intelligence. The development of information technologies, the complication of the tasks being solved stimulated the transition from one-dimensional to two-dimensional digital Fourier processing. System analysis has shown that the transition from the one-dimensional to the two-dimensional case is far from trivial and is primarily of a qualitative rather than quantitative nature. At the same time, the generalization of the results of the two-dimensional case to the multidimensional one, as a rule, does not cause difficulties, since it is mainly quantitative, and not qualitative. As is known, for the practical application of the application of Fourier processing methods, expanding the scope of their application, an important role belongs to the procedures for the rapid implementation of corresponding Fourier transforms (the story of FFT algorithm proposed in 1965), a clear confirmation of this. The paper deals with the solution of an important and urgent problem of developing fast algorithms for new discrete 2D Fourier transform with variable parameters (2D DFT - VP). Three groups of methods for increasing the speed of two-dimensional discrete fast Fourier transform with variable parameters are proposed and studied in the paper. The 1 st group of methods for improving the speed of 2D DFT-VP is based on the separability property of the kernel of 2D DFT - VP and the use of one-dimensional parametric DFTs (DFT -P). The 2nd group of methods for improving the speed of 2D DFT - VP is based on the property of separability of the kernel of 2D DFT-VP and the use of one-dimensional parametric fast Fourier transforms (FFT-P). Group 3 2D DFT-VP performance improvement methods based on 2D Fast Fourier Transform (2D FFT - VP) in vector base 2, with space decimation, with or without replacement.","PeriodicalId":428492,"journal":{"name":"2022 24th International Conference on Digital Signal Processing and its Applications (DSPA)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125891882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：