Nothing Special   »   [go: up one dir, main page]

You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (42)

Search Parameters:
Keywords = CORDIC

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
22 pages, 6724 KiB  
Article
An FPGA-Based Trigonometric Kalman Filter Approach for Improving the Measurement Quality of a Multi-Head Rotational Encoder
by Dariusz Janiszewski
Energies 2024, 17(23), 6122; https://doi.org/10.3390/en17236122 - 5 Dec 2024
Cited by 1 | Viewed by 550
Abstract
This article introduces an advanced theoretical approach, named the Trigonometric Kalman Filter (TKF), to enhance measurement accuracy for multi-head rotational encoders. Leveraging the processing capabilities of a Field-Programmable Gate Array (FPGA), the proposed TKF algorithm uses trigonometric functions and sophisticated signal fusion techniques [...] Read more.
This article introduces an advanced theoretical approach, named the Trigonometric Kalman Filter (TKF), to enhance measurement accuracy for multi-head rotational encoders. Leveraging the processing capabilities of a Field-Programmable Gate Array (FPGA), the proposed TKF algorithm uses trigonometric functions and sophisticated signal fusion techniques to provide highly accurate real-time angle estimation with rapid response. The inclusion of the Coordinate Rotation Digital Computer (CORDIC) algorithm enables swift and efficient computation of trigonometric values, facilitating precise tracking of angular position and rotational speed. This approach represents a notable advancement in control systems, where high accuracy and minimal latency are essential for optimal performance. The paper addresses key challenges in angle measurement, particularly the signal fusion inaccuracies that often impede precision in high-demand applications. Implementing the TKF with an FPGA-based pure fixed-point method not only enhances computational efficiency but also significantly reduces latency when compared to conventional software-based solutions. This FPGA-based implementation is particularly advantageous in real-time applications where processing speed and accuracy are critical, and it demonstrates the effective integration of hardware acceleration in improving measurement fidelity. To validate the effectiveness of this approach, the TKF was rigorously tested on a precision drive control system, configured for a direct PMSM drive in an astronomical telescope mount equipped with a standard 0.5m telescope frequently used by astronomers. This real-world application highlights the TKF’s ability to meet the stringent positioning and measurement accuracy requirements characteristic of astronomical observation, a field where minute angular adjustments are critical. The FPGA-based design enables high-frequency updates, essential for managing the minor, precise adjustments required for telescope control. The study includes a comprehensive computational analysis and experimental testing on an Altera Stratix FPGA board, presenting a detailed comparison of the TKF’s performance with other known methods, including fusion techniques such as differential methods, αβ filters, and related Kalman filtering applied to one sensors. The study demonstrates that the four-head fusion configuration of the TKF outperforms traditional methods in terms of measurement accuracy and responsiveness. Full article
(This article belongs to the Section F3: Power Electronics)
Show Figures

Figure 1

Figure 1
<p>Typical computing step for the CORDIC algorithm.</p>
Full article ">Figure 2
<p>Rotating encoder ring (ER) and four fixed read heads (RH1–RH4): real montage (<b>a</b>), schematic view (<b>b</b>).</p>
Full article ">Figure 3
<p>TKF diagram.</p>
Full article ">Figure 4
<p>The laboratory prototype astronomical two-axis direct-drive mount with an <math display="inline"><semantics> <mrow> <mn>11</mn> <mo>″</mo> </mrow> </semantics></math> telescope [<a href="#B30-energies-17-06122" class="html-bibr">30</a>].</p>
Full article ">Figure 5
<p>FPGA Controllerl—DE4.</p>
Full article ">Figure 6
<p>Schematic diagram of the computation system in Quartus II software.</p>
Full article ">Figure 7
<p>Trial scenario—torque demand (<math display="inline"><semantics> <msub> <mi>i</mi> <mi>q</mi> </msub> </semantics></math>) to produce small movement.</p>
Full article ">Figure 8
<p>TKF results with floating-point (<b>a</b>) and fixed-point (<b>b</b>) operations.</p>
Full article ">Figure 9
<p>Read and estimated position in dynamical (<b>a</b>) and steady state (<b>b</b>).</p>
Full article ">Figure 10
<p>Comparison of estimated speed <math display="inline"><semantics> <msub> <mover accent="true"> <mi>ω</mi> <mo stretchy="false">^</mo> </mover> <mi>r</mi> </msub> </semantics></math> in dynamical (<b>a</b>) and steady-state (<b>b</b>) operations.</p>
Full article ">Figure 11
<p>Comparison of dynamical behavior’s estimated speed <math display="inline"><semantics> <msub> <mover accent="true"> <mi>ω</mi> <mo stretchy="false">^</mo> </mover> <mi>r</mi> </msub> </semantics></math> during large changes in value, for positive (<b>a</b>) and negative (<b>b</b>) response.</p>
Full article ">Figure 12
<p>Comparison of dynamical behavior results with other methods for whole scenario (<b>a</b>) and enlarged part with biggest changes (<b>b</b>).</p>
Full article ">
17 pages, 4918 KiB  
Article
A Recursive Trigonometric Technique for Direct Digital Frequency Synthesizer Implementation
by Xing Xing, William Melek and Wilson Wang
Electronics 2024, 13(23), 4762; https://doi.org/10.3390/electronics13234762 - 2 Dec 2024
Viewed by 500
Abstract
This paper presents a novel recursive trigonometry (RT) technique for direct digital frequency synthesizer (DDFS) implementations. Traditional DDFS systems on field programmable gate arrays (FPGAs) either require a substantial amount of read-only memory (ROM) space to store reference values or depend on intricate [...] Read more.
This paper presents a novel recursive trigonometry (RT) technique for direct digital frequency synthesizer (DDFS) implementations. Traditional DDFS systems on field programmable gate arrays (FPGAs) either require a substantial amount of read-only memory (ROM) space to store reference values or depend on intricate angle rotation functions to approximate trigonometric values. The proposed RT technique offers a DDFS architecture without using the lookup table (LUT) method, and it can enhance signal accuracy and minimize power consumption. The effectiveness of the proposed RT technique has been implemented in a 13.5 kHz 16-bit DDFS with a minimum of 18.91 mW and was tested on a Lattice FPGA. The effectiveness of the proposed RT technology is assessed by using different FPGA platforms in terms of accuracy, hardware resource efficiency, and power consumption, especially in generating cosine waveforms. Full article
(This article belongs to the Special Issue New Advances of FPGAs in Signal Processing)
Show Figures

Figure 1

Figure 1
<p>Conventional DDFS architecture.</p>
Full article ">Figure 2
<p>The architecture of the proposed RT technique.</p>
Full article ">Figure 3
<p>Illustration of the DDFS architecture using the RT technique.</p>
Full article ">Figure 4
<p>Illustration of the FSM for dynamic cosine generation using the RT technique.</p>
Full article ">Figure 5
<p>Cosine waveform with 6° iteration angle using the RT technique in MATLAB.</p>
Full article ">Figure 6
<p>Cosine waveform with 8° iteration angle using the RT technique in MATLAB.</p>
Full article ">Figure 7
<p>Cosine waveform with (<b>a</b>) 7 degrees iteration angle and (<b>b</b>) 7.059 degrees iteration angle using the RT technique in MATLAB.</p>
Full article ">Figure 8
<p>The RT cosine waveform simulation by MATLAB.</p>
Full article ">Figure 9
<p>The 32-bit accuracy comparison between different methods: (<b>a</b>) radix-2, (<b>b</b>) radix-4, and (<b>c</b>) RT by MATLAB.</p>
Full article ">Figure 10
<p>Accuracy comparison corresponding to different bit widths for the RT technique from ModelSim.</p>
Full article ">Figure 11
<p>Accuracy comparison of the RT technique using the quadrant transform in MATLAB.</p>
Full article ">Figure 12
<p>Comparison of cumulative errors over different numbers of iterations in the RT technique from ModelSim.</p>
Full article ">Figure 13
<p>Experiment setup of proposed DDFS: (1) DAC module; (2) oscilloscope; and (3) Lattice ICE40 FPGA module; (4) PC.</p>
Full article ">Figure 14
<p>Time-domain output from the RT-based DDFS.</p>
Full article ">Figure 15
<p>Spectrum output from the RT-based DDFS at 13.5 kHz.</p>
Full article ">
13 pages, 2700 KiB  
Article
Hardware Implementation of a 2D Chaotic Map-Based Audio Encryption System Using S-Box
by Hisham M. Elrefai, Wafaa S. Sayed and Lobna A. Said
Electronics 2024, 13(21), 4254; https://doi.org/10.3390/electronics13214254 - 30 Oct 2024
Cited by 1 | Viewed by 648
Abstract
This paper presents a hardware-based audio encryption system using a 2D chaotic map and dynamic S-box design implemented on an Artix-7 FPGA platform. Three distinct chaotic maps—logistic–fraction (2D-LF), logistic–sine (2D-LS), and fraction–sine (2D-FS)—were investigated and implemented on an FPGA. The 2D-LF map was [...] Read more.
This paper presents a hardware-based audio encryption system using a 2D chaotic map and dynamic S-box design implemented on an Artix-7 FPGA platform. Three distinct chaotic maps—logistic–fraction (2D-LF), logistic–sine (2D-LS), and fraction–sine (2D-FS)—were investigated and implemented on an FPGA. The 2D-LF map was employed in the encryption system for its throughput and power efficiency performance. The proposed encryption system benefits from the randomness of chaotic sequences for block permutation and S-box substitution to enhance the diffusion and confusion properties of the encrypted speech signal. The system’s encryption strength is validated through performance evaluations, using the mean squared error (MSE), signal-to-noise ratio (SNR), correlation coefficients, and NIST randomness tests, which confirm the unpredictability of the encrypted speech signal. The hardware implementation results show a throughput of 2880 Mbps and power consumption of 0.13 W. Full article
(This article belongs to the Section Circuit and Signal Processing)
Show Figures

Figure 1

Figure 1
<p>Phase space trajectory (<b>a</b>) 2D-LF, (<b>b</b>) 2D-Ls, and (<b>c</b>) 2D-FS.</p>
Full article ">Figure 2
<p>Hardware architecture of (<b>a</b>) 2D-LF, (<b>b</b>) 2D-Ls, and (<b>c</b>) 2D-FS.</p>
Full article ">Figure 3
<p>Hardware architectures of (<b>a</b>) x-y term.png, (<b>b</b>) <math display="inline"><semantics> <mi>θ</mi> </semantics></math>, (<b>c</b>) MUL, and (<b>d</b>) <math display="inline"><semantics> <msub> <mi>O</mi> <mrow> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </semantics></math>.</p>
Full article ">Figure 4
<p>Phase space trajectory of fixed-point hardware design vs. floating-point Matlab: (<b>a</b>) 2D-LF, (<b>b</b>) 2D-LS, (<b>c</b>) 2D-FS.</p>
Full article ">Figure 5
<p>Proposed encryption system for audio signals.</p>
Full article ">
16 pages, 2967 KiB  
Technical Note
Field Programmable Gate Array (FPGA) Implementation of Parallel Jacobi for Eigen-Decomposition in Direction of Arrival (DOA) Estimation Algorithm
by Shuang Zhou and Li Zhou
Remote Sens. 2024, 16(20), 3892; https://doi.org/10.3390/rs16203892 - 19 Oct 2024
Viewed by 986
Abstract
The eigen-decomposition of a covariance matrix is a key step in the Direction of Arrival (DOA) estimation algorithms such as subspace classes. Eigen-decomposition using the parallel Jacobi algorithm implemented on FPGA offers excellent parallelism and real-time performance. Addressing the high complexity and resource [...] Read more.
The eigen-decomposition of a covariance matrix is a key step in the Direction of Arrival (DOA) estimation algorithms such as subspace classes. Eigen-decomposition using the parallel Jacobi algorithm implemented on FPGA offers excellent parallelism and real-time performance. Addressing the high complexity and resource consumption of the traditional parallel Jacobi algorithm implemented on FPGA, this study proposes an improved FPGA-based parallel Jacobi algorithm for eigen-decomposition. By analyzing the relationship between angle calculation and rotation during the Jacobi algorithm decomposition process, leveraging parallelism in the data processing, and based on the concepts of time-division multiplexing and parallel partition processing, this approach effectively reduces FPGA resource consumption. The improved parallel Jacobi algorithm is then applied to the classic DOA estimation algorithm, the MUSIC algorithm, and implemented on Xilinx’s Zynq FPGA. Experimental results demonstrate that this parallel approach can reduce resource consumption by approximately 75% compared to the traditional method but introduces little additional time consumption. The proposed method in this paper will solve the problem of great hardware consumption of eigen-decomposition based on FPGA in DOA applications. Full article
Show Figures

Figure 1

Figure 1
<p>Systolic array structure of an 8-order covariance matrix.</p>
Full article ">Figure 2
<p>(<b>a</b>) First rotational partition diagram. (<b>b</b>) Second rotational partition diagram.</p>
Full article ">Figure 3
<p>The steps of module operation.</p>
Full article ">Figure 4
<p>Block diagram of the MUSIC algorithm.</p>
Full article ">Figure 5
<p>Simulation results of eigen-decomposition iteration for (<b>a</b>) 21 times and (<b>b</b>) 28 times.</p>
Full article ">Figure 5 Cont.
<p>Simulation results of eigen-decomposition iteration for (<b>a</b>) 21 times and (<b>b</b>) 28 times.</p>
Full article ">Figure 6
<p>Illustration of the direction-finding results on the UV plane in MATLAB and FPGA.</p>
Full article ">
14 pages, 3120 KiB  
Article
A Novel Instruction Driven 1-D CNN Processor for ECG Classification
by Jiawen Deng, Jie Yang, Xin’an Wang and Xing Zhang
Sensors 2024, 24(13), 4376; https://doi.org/10.3390/s24134376 - 5 Jul 2024
Viewed by 1144
Abstract
Electrocardiography (ECG) has emerged as a ubiquitous diagnostic tool for the identification and characterization of diverse cardiovascular pathologies. Wearable health monitoring devices, equipped with on-device biomedical artificial intelligence (AI) processors, have revolutionized the acquisition, analysis, and interpretation of ECG data. However, these systems [...] Read more.
Electrocardiography (ECG) has emerged as a ubiquitous diagnostic tool for the identification and characterization of diverse cardiovascular pathologies. Wearable health monitoring devices, equipped with on-device biomedical artificial intelligence (AI) processors, have revolutionized the acquisition, analysis, and interpretation of ECG data. However, these systems necessitate AI processors that exhibit flexible configuration, facilitate portability, and demonstrate optimal performance in terms of power consumption and latency for the realization of various functionalities. To address these challenges, this study proposes an instruction-driven convolutional neural network (CNN) processor. This processor incorporates three key features: (1) An instruction-driven CNN processor to support versatile ECG-based application. (2) A Processing element (PE) array design that simultaneously considers parallelism and data reuse. (3) An activation unit based on the CORDIC algorithm, supporting both Tanh and Sigmoid computations. The design has been implemented using 110 nm CMOS process technology, occupying a die area of 1.35 mm2 with 12.94 µW power consumption. It has been demonstrated with two typical ECG AI applications, including two-class (i.e., normal/abnormal) classification and five-class classification. The proposed 1-D CNN algorithm performs with a 97.95% accuracy for the two-class classification and 97.9% for the five-class classification, respectively. Full article
(This article belongs to the Section Biomedical Sensors)
Show Figures

Figure 1

Figure 1
<p>ECG waveform from MIT_BIH database.</p>
Full article ">Figure 2
<p>Algorithm for 1-D convolution layer and partition.</p>
Full article ">Figure 3
<p>Block diagram of the proposed system.</p>
Full article ">Figure 4
<p>Work flow of the proposed system.</p>
Full article ">Figure 5
<p>Hardware architecture of the R-peak detection engine.</p>
Full article ">Figure 6
<p>The overall architecture of the 1-D CNN engine.</p>
Full article ">Figure 7
<p>The IEEE 754 standard half-precision floating-point data format.</p>
Full article ">Figure 8
<p>The demonstration of the PE array and data buffer.</p>
Full article ">Figure 9
<p>The architecture of computing Sigmoid(x) and Tanh(x) and T(x) based on CORDIC.</p>
Full article ">Figure 10
<p>The architecture of the pooling unit.</p>
Full article ">Figure 11
<p>The processor layout and specifications.</p>
Full article ">
17 pages, 4001 KiB  
Article
A Low-Latency CORDIC Algorithm Based on Pre-Rotation and Its Application on Computation of Arctangent Function
by Kun Li, Hongji Fang, Zhenguo Ma, Feng Yu, Bo Zhang and Qianjian Xing
Electronics 2024, 13(12), 2338; https://doi.org/10.3390/electronics13122338 - 14 Jun 2024
Viewed by 1246
Abstract
This paper presents a low-latency coordinate rotation digital computer (CORDIC) algorithm to accelerate the computation of arctangent functions, and it describes the corresponding iterative and pipelined architecture of this novel algorithm. As compared to the existing methods based on CORDIC, the proposed method [...] Read more.
This paper presents a low-latency coordinate rotation digital computer (CORDIC) algorithm to accelerate the computation of arctangent functions, and it describes the corresponding iterative and pipelined architecture of this novel algorithm. As compared to the existing methods based on CORDIC, the proposed method can effectively reduce the number of iterations by dedicated pre-rotation and comparison processes. Moreover, the proposed CORDIC algorithm supports all vectors with arbitrary angles while maintaining convergence. By error analysis, the proposed algorithm can achieve the same accuracy as the conventional CORDIC algorithm during floating-point arctangent function computation and reduce the number of iterations by approximately 50%. This paper presents two new architectures—the iterative architecture, which can be more resource efficient, and the pipelined architecture, which can achieve a throughput rate of one datum per clock. Finally, the experimental comparison results indicate that the proposed method outperforms extant methods as it exhibits low latency, requires fewer resources to compute the arctangent function for floating-point inputs, and necessitates no digital signal processing (DSP) and memory for fixed-point inputs. Full article
(This article belongs to the Section Computer Science & Engineering)
Show Figures

Figure 1

Figure 1
<p>CORDIC rotation in vector mode.</p>
Full article ">Figure 2
<p>The conventional CORDIC pipelined architecture in vector mode. It consists of <span class="html-italic">n</span> stages, with each stage requiring three adders, and the rotation angle completed in each stage is fixed.</p>
Full article ">Figure 3
<p>First rotation of the initial vector: (<b>a</b>) Angle of the initial vector is <math display="inline"><semantics> <mrow> <msup> <mn>20.00</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>. (<b>b</b>) Angle of the initial vector is <math display="inline"><semantics> <mrow> <msup> <mn>30.00</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>All cases of the first Rotation when the initial vector is in the first quadrant: (<b>a</b>) Case 1. The vector angle is too large and the rotation angle corresponding to <math display="inline"><semantics> <msub> <mi>y</mi> <mn>1</mn> </msub> </semantics></math> is the best choice. (<b>b</b>) Case 2. The rotation angle corresponding to <math display="inline"><semantics> <msub> <mi>y</mi> <mn>1</mn> </msub> </semantics></math> is the best choice. (<b>c</b>) Case 3. The rotation angle corresponding to <math display="inline"><semantics> <msub> <mi>y</mi> <mn>2</mn> </msub> </semantics></math> is the best choice. (<b>d</b>) Case 4. The rotation angle corresponding to <math display="inline"><semantics> <msub> <mi>y</mi> <mn>2</mn> </msub> </semantics></math> is the best choice. (<b>e</b>) Case 5. No rotation is the best choice.</p>
Full article ">Figure 5
<p>Examples of different cases in Algorithm 2: (<b>a</b>) Case 4. The rotation angle corresponding to <math display="inline"><semantics> <msub> <mi>y</mi> <mn>2</mn> </msub> </semantics></math> is the best choice. (<b>b</b>) Case 5. The rotation angle corresponding to <math display="inline"><semantics> <msub> <mi>y</mi> <mn>3</mn> </msub> </semantics></math> is the best choice. (<b>c</b>) Case 6. The rotation angle corresponding to <math display="inline"><semantics> <msub> <mi>y</mi> <mn>3</mn> </msub> </semantics></math> is the best choice. (<b>d</b>) Case 7. No rotation is the best choice.</p>
Full article ">Figure 6
<p>Classification of initial vectors according to angle: (<b>a</b>) Maximum rotation angle is <math display="inline"><semantics> <mrow> <msup> <mn>63.43</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>. (<b>b</b>) Maximum rotation angle is <math display="inline"><semantics> <mrow> <msup> <mn>45.00</mn> <mo>∘</mo> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>Errors in conventional CORDIC algorithm.</p>
Full article ">Figure 8
<p>Error of PR-CORDIC algorithm: (<b>a</b>) Maximum error of PR-CORDIC algorithm under different parameters. (<b>b</b>) Average error of PR-CORDIC algorithm under different parameters.</p>
Full article ">Figure 9
<p>The correlation between error and the input vector angle.</p>
Full article ">Figure 10
<p>Details of the entire proposed iterative architecture. Both PE1 and PE2 require two adders each: (<b>a</b>) PE1 for pre-rotation. (<b>b</b>) PE2 for rotation.</p>
Full article ">Figure 11
<p>Proposed iterative architecture. The architectures of PE1 and PE2 are shown in <a href="#electronics-13-02338-f010" class="html-fig">Figure 10</a>. COMPARE completes the logic of Algorithm 1, while ITERATION CNT is used to control the start and end of the entire calculation process.</p>
Full article ">Figure 12
<p>The iteration process pipeline architecture. It consists of 12 stages, with each stage requiring four adders, and there are two possible rotation angles.</p>
Full article ">Figure 13
<p>The preprocessing and postprocessing architecture. Through preprocessing and postprocessing, the convergence range of the rotation angles can be achieved within [−<math display="inline"><semantics> <mi>π</mi> </semantics></math>, <math display="inline"><semantics> <mi>π</mi> </semantics></math>].</p>
Full article ">
20 pages, 5283 KiB  
Article
Fault Classification and Diagnosis Approach Using FFT-CNN for FPGA-Based CORDIC Processor
by Yu Xie, He Chen, Yin Zhuang and Yizhuang Xie
Electronics 2024, 13(1), 72; https://doi.org/10.3390/electronics13010072 - 22 Dec 2023
Cited by 7 | Viewed by 1404
Abstract
Within the realm of digital signal processing and communication systems, FPGA-based CORDIC (Coordinate Rotation Digital Computer) processors play pivotal roles, applied in trigonometric calculations and vector operations. However, soft errors have become one of the major threats in high-reliability FPGA-based applications, potentially degrading [...] Read more.
Within the realm of digital signal processing and communication systems, FPGA-based CORDIC (Coordinate Rotation Digital Computer) processors play pivotal roles, applied in trigonometric calculations and vector operations. However, soft errors have become one of the major threats in high-reliability FPGA-based applications, potentially degrading performance and causing system failures. This paper proposes a fault classification and diagnosis method for FPGA-based CORDIC processors, leveraging Fast Fourier Transform (FFT) and Convolutional Neural Networks (CNNs). The approach involves constructing fault classification datasets, optimizing features extraction through FFT to shorten the time of diagnosis and improve the diagnostic accuracy, and employing CNNs for training and testing of faults diagnosis. Different CNN architectures are tested to explore and construct the optimal fault classifier. Experimental results encompassing simulation and implementation demonstrate the improved accuracy and efficiency in fault classification and diagnosis. The proposed method provides fault prediction with an accuracy of more than 98.6% and holds the potential to enhance the reliability and performance of FPGA-based CORDIC circuit systems, surpassing traditional fault diagnosis methods such as Sum of Square (SoS). Full article
(This article belongs to the Special Issue Artificial Intelligence in Image and Video Processing)
Show Figures

Figure 1

Figure 1
<p>Architecture of the fault-tolerant system.</p>
Full article ">Figure 2
<p>The topological structure of the floating-point CORDIC processor.</p>
Full article ">Figure 3
<p>Hardware structure of the pre-processing unit.</p>
Full article ">Figure 4
<p>Hardware structure of the rotation-processing unit.</p>
Full article ">Figure 5
<p>Hardware structure of the post-processing unit.</p>
Full article ">Figure 6
<p>Architecture of the fault injection system.</p>
Full article ">Figure 7
<p>Architecture of the SoS check.</p>
Full article ">Figure 8
<p>Processing flow of the FFT-CNN fault classification and diagnosis approach.</p>
Full article ">Figure 9
<p>Output data of the CORDIC processor with different fault states. (<b>A</b>) Pre-processing fault state; (<b>B</b>) error-free state; (<b>C</b>) post-processing fault state; (<b>D</b>) rotation-processing fault state.</p>
Full article ">Figure 10
<p>Comparison of error-free state output data. (<b>A</b>) Original data; (<b>B</b>) feature extraction optimization by FFT.</p>
Full article ">Figure 11
<p>Output data after FFT with different fault states. (<b>A</b>) Pre-processing fault state; (<b>B</b>) error-free state; (<b>C</b>) post-processing fault state; (<b>D</b>) rotation-processing fault state.</p>
Full article ">Figure 12
<p>Architecture of LeNet-5 neural network for CORDIC fault diagnosis.</p>
Full article ">Figure 13
<p>Diagram of the VGG11 neural network.</p>
Full article ">Figure 14
<p>The training flow of the proposed FFT-CNN fault diagnosis approach.</p>
Full article ">Figure 15
<p>Fault diagnosis model of the proposed FFT-CNN approach.</p>
Full article ">Figure 16
<p>Hardware architecture of the fault-tolerant system.</p>
Full article ">Figure 17
<p>Accuracy comparison of the different methods.</p>
Full article ">
20 pages, 1513 KiB  
Article
Design of Hardware IP for 128-Bit Low-Latency Arcsinh and Arccosh Functions
by Junfeng Chang and Mingjiang Wang
Electronics 2023, 12(22), 4658; https://doi.org/10.3390/electronics12224658 - 15 Nov 2023
Cited by 1 | Viewed by 982
Abstract
With the rapid development of technologies like artificial intelligence, high-performance computing chips are playing an increasingly vital role. The inverse hyperbolic sine and inverse hyperbolic cosine functions are of utmost importance in fields such as image blur and robot joint control. Therefore, there [...] Read more.
With the rapid development of technologies like artificial intelligence, high-performance computing chips are playing an increasingly vital role. The inverse hyperbolic sine and inverse hyperbolic cosine functions are of utmost importance in fields such as image blur and robot joint control. Therefore, there is an urgent need for research into high-precision, high-performance hardware Intellectual Property (IP) for arcsinh and arccosh functions. To address this issue, this paper introduces a novel 128-bit low-latency floating-point hardware IP for arcsinh and arccosh functions, employing an enhanced Coordinate Rotation Digital Computer (CORDIC) algorithm, achieving a computation precision of 113 bits in just 32 computation cycles. This significantly enhances computational efficiency while reducing hardware implementation latency. The results indicate that, when compared to Python standard results, the calculated error of the proposed hardware IP does not exceed 8×1034. Furthermore, this paper synthesizes the completed IP using the TSMC 65 nm process, with a total IP area of 2.1056 mm2. Operating at a frequency of 300 MHz, its power is 22.4 mW. Finally, hardware implementation and resource analysis are conducted and compared on an Field Programmable Gate Array (FPGA). The results show that the improved algorithm trades a slight area increase for lower latency and higher accuracy. The designed hardware IP is expected to provide a more accurate and efficient computational tool for applications like image processing, thereby advancing technological development. Full article
(This article belongs to the Section Circuit and Signal Processing)
Show Figures

Figure 1

Figure 1
<p>Format for quad-precision floating-point numbers.</p>
Full article ">Figure 2
<p>Top-level structure diagram of low-latency arcsinh and arccosh hardware circuits.</p>
Full article ">Figure 3
<p>Flow chart of abnormal situation judgment of arcsinh function.</p>
Full article ">Figure 4
<p>Flow chart of abnormal situation judgment of arccosh function.</p>
Full article ">Figure 5
<p>Structural block diagram of Preliminary_calculation module.</p>
Full article ">Figure 6
<p>Structural block diagram of 128_sqrt module.</p>
Full article ">Figure 7
<p>State machine of Goldschmidt iterative process.</p>
Full article ">Figure 8
<p>Data path of Sqrt_mantissa_calculation module.</p>
Full article ">Figure 9
<p>Hardware circuit structure diagram of Ln_CORDIC module.</p>
Full article ">Figure 10
<p>Circuit structure diagram of CORDIC_iteration module.</p>
Full article ">Figure 11
<p>Circuit structure diagram of Post_processing module.</p>
Full article ">Figure 12
<p>Calculation results and errors of arcsinh function.</p>
Full article ">Figure 13
<p>Calculation results and errors of arccosh function.</p>
Full article ">Figure 14
<p>Calculation error of arcsinh function.</p>
Full article ">Figure 15
<p>Calculation error of arccosh function.</p>
Full article ">Figure 16
<p>Simulation timing on Modelsim.</p>
Full article ">
13 pages, 6255 KiB  
Communication
A Universal Digital Lock-in Amplifier Design for Calibrating the Photo-Detector Responses with Standard Black-Bodies
by Zheyi Yao, Jingpeng Pan, Chang Yu, Zhewen Yuan, Qian Chen and Xiubao Sui
Sensors 2023, 23(21), 8902; https://doi.org/10.3390/s23218902 - 1 Nov 2023
Cited by 2 | Viewed by 1671
Abstract
The lock-in amplifier (LIA) is widely utilized to detect ultra-weak optical periodic signals based on the phase-sensitive and enhanced detecting theory. In this paper, we present an all-digital and universal embedded LIA platform that accurately and conveniently describes the spectrum generated by standard [...] Read more.
The lock-in amplifier (LIA) is widely utilized to detect ultra-weak optical periodic signals based on the phase-sensitive and enhanced detecting theory. In this paper, we present an all-digital and universal embedded LIA platform that accurately and conveniently describes the spectrum generated by standard black bodies at various temperatures with different optical detectors. The proposed design significantly reduces the complexity and cost of traditional analog LIAs while maintaining accuracy. The LIA components are implemented using a single field programmable gate array (FPGA), offering flexibility to modify parameters for different situations. The normalized mean-square error (NMSE) of the captured spectra in the experiments is within 0.9% compared the theoretical values. Full article
(This article belongs to the Section Electronic Sensors)
Show Figures

Figure 1

Figure 1
<p>Structure diagram of phase-locked amplifier: AMP, amplifier, LPF, low-pass filter.</p>
Full article ">Figure 2
<p>Corresponding relationship between phase word and amplitude of trigonometric function.</p>
Full article ">Figure 3
<p>The phase sensitive detector with digital filter.</p>
Full article ">Figure 4
<p>The amplitude-frequency response diagram of digital low-pass filter, where <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>ω</mi> </mrow> <mrow> <mi>p</mi> </mrow> </msub> </mrow> </semantics></math> represents the passband cutoff frequency, <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>ω</mi> </mrow> <mrow> <mi>s</mi> <mi>t</mi> </mrow> </msub> </mrow> </semantics></math> represents stopband cut-off frequency, <math display="inline"><semantics> <mrow> <mo>∆</mo> <mi>ω</mi> <mo>=</mo> <msub> <mrow> <mi>ω</mi> </mrow> <mrow> <mi>s</mi> <mi>t</mi> </mrow> </msub> <mo>−</mo> <msub> <mrow> <mi>ω</mi> </mrow> <mrow> <mi>p</mi> </mrow> </msub> </mrow> </semantics></math> is the transition band, <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>δ</mi> </mrow> <mrow> <mi>p</mi> </mrow> </msub> </mrow> </semantics></math> represents the passband ripple, and <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>δ</mi> </mrow> <mrow> <mi>T</mi> </mrow> </msub> </mrow> </semantics></math> is the stop band ripple, respectively.</p>
Full article ">Figure 5
<p>The schematic diagram of the low-pass IIR filter.</p>
Full article ">Figure 6
<p>The CORDIC algorithm vector rotation diagram with rotating the input vector by <math display="inline"><semantics> <mrow> <mi>θ</mi> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>The <span class="html-italic">i</span>-th single iteration of CORDIC algorithm implementation. SHIFTER, phase shifter; ADD/SUB, adder or subtractor that contains conditional complementor; SIGN, sign bit capture.</p>
Full article ">Figure 8
<p>The setup of black body spectrum capturing. CVF, circular variant filter; MCT, HgCdTe detector; AMP, amplifier; LIA, locked-in amplifier.</p>
Full article ">Figure 9
<p>The simulation results. (<b>a</b>) Mixed input signal, <math display="inline"><semantics> <mrow> <mi>x</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>, with SNR = −10 in two periods; (<b>b</b>) Output signal from in-phase channel, <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>u</mi> </mrow> <mrow> <msub> <mrow> <mi>p</mi> </mrow> <mrow> <mi>L</mi> <mi>P</mi> <mi>F</mi> </mrow> </msub> </mrow> </msub> <mo stretchy="false">(</mo> <mi>t</mi> <mo stretchy="false">)</mo> </mrow> </semantics></math>; (<b>c</b>) Output signal from quadrature channel, <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>u</mi> </mrow> <mrow> <msub> <mrow> <mi>q</mi> </mrow> <mrow> <mi>L</mi> <mi>P</mi> <mi>F</mi> </mrow> </msub> </mrow> </msub> <mo stretchy="false">(</mo> <mi>t</mi> <mo stretchy="false">)</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 10
<p>(<b>a</b>) The output amplitude and the reference amplitude. (<b>b</b>) The output phase and the reference phase.</p>
Full article ">Figure 11
<p>The LIA PCB platform.</p>
Full article ">Figure 12
<p>The linear response experimental results. (<b>a</b>) Single voltage measuring results with 0.4000 Vpp for 25 s; (<b>b</b>) Amplitudes measuring results with input amplitude ranging from 0 to 0.5 Vpp.</p>
Full article ">Figure 13
<p>The wavelength-index of the CVF.</p>
Full article ">Figure 14
<p>The results of the MCT experiments. (<b>a</b>) The spectrum response of MCT; (<b>b</b>) The blackbody spectrum measuring results.</p>
Full article ">Figure 15
<p>The responses of InSb at various chopper rates.</p>
Full article ">
17 pages, 1924 KiB  
Article
A Scalable Spatial–Temporal Correlated Non-Stationary Channel Fading Generation Method
by Sheng Fang, Tongbao Mao, Boyu Hua, Yuan Ding, Maozhong Song, Qiangjun Zhou and Qiuming Zhu
Electronics 2023, 12(19), 4132; https://doi.org/10.3390/electronics12194132 - 4 Oct 2023
Cited by 1 | Viewed by 1269
Abstract
To address the challenges of complex implementation structures and high hardware resource consumption in multiple-input multiple-output (MIMO) channel emulators, this paper proposes a hardware generation method for spatial–temporal correlated non-stationary channel fading. Firstly, a hardware generation architecture is developed for field-programmable gate array [...] Read more.
To address the challenges of complex implementation structures and high hardware resource consumption in multiple-input multiple-output (MIMO) channel emulators, this paper proposes a hardware generation method for spatial–temporal correlated non-stationary channel fading. Firstly, a hardware generation architecture is developed for field-programmable gate array (FPGA) platforms, which can also reduce the complexity of the channel emulator. Secondly, an improved CORDIC method is introduced to reduce algorithm latency and hardware consumption while expanding the function convergence domain, with a relative error maintained at the level of 10-4. Furthermore, based on the idea of time-division multiplexing, an efficient hardware operation of a lower triangular matrix is adopted to minimize the consumption of hardware resources. Finally, the measured results demonstrate that the statistical characteristics of the channel fading generated by the proposed method are in good agreement with the theoretical ones, with an average error of less than 2%. Additionally, under identical simulation conditions, hardware resource consumption is reduced by 6.87%. These findings provide compelling evidence of the enhanced efficiency and accuracy in simulating MIMO channels achieved through the proposed method. Full article
(This article belongs to the Section Microwave and Wireless Communications)
Show Figures

Figure 1

Figure 1
<p>Hardware architecture of spatial–temporal correlated fading generation.</p>
Full article ">Figure 2
<p>Hardware architecture of the CORDIC algorithm.</p>
Full article ">Figure 3
<p>The relative errors of (<b>a</b>) e–exponent function, (<b>b</b>) logarithm function, and (<b>c</b>) square root function in the extended region.</p>
Full article ">Figure 4
<p>Lower triangular matrix operation based on time-division multiplexing.</p>
Full article ">Figure 5
<p>Complex multiplier based on data selector.</p>
Full article ">Figure 6
<p>PDFs of (<b>a</b>) Rice, (<b>b</b>) Lognormal, (<b>c</b>) Nakagami, and (<b>d</b>) Weibull fading envelope.</p>
Full article ">Figure 7
<p>Fading envelopes of (<b>a</b>) Rice, (<b>b</b>) Lognormal, (<b>c</b>) Nakagami, and (<b>d</b>) Weibull.</p>
Full article ">Figure 8
<p>(<b>a</b>) theoretical, generated, and simulated absolute value of TCFs at different time points, (<b>b</b>) theoretical, generated, and simulated DPSDs at different time points, and (<b>c</b>) the simulated time–variant DPSDs measured by spectrum analyzer.</p>
Full article ">Figure 9
<p>(<b>a</b>) The modulus of sub–channel SCF and (<b>b</b>) The relative error of sub–channel SCF.</p>
Full article ">Figure 10
<p>(<b>a</b>) Theoretical and (<b>b</b>) simulated values of sub-channel fading SCC at <span class="html-italic">t</span> = 24 s.</p>
Full article ">
39 pages, 8103 KiB  
Article
Advancements in Spaceborne Synthetic Aperture Radar Imaging with System-on-Chip Architecture and System Fault-Tolerant Technology
by Yu Xie, Yizhuang Xie, Bingyi Li and He Chen
Remote Sens. 2023, 15(19), 4739; https://doi.org/10.3390/rs15194739 - 27 Sep 2023
Cited by 3 | Viewed by 2899
Abstract
With the continuous development of satellite payload and system-on-chip (SoC) technology, spaceborne real-time synthetic aperture radar (SAR) imaging systems play a crucial role in various defense and civilian domains, including Earth remote sensing, military reconnaissance, disaster mitigation, and resource exploration. However, designing high-performance [...] Read more.
With the continuous development of satellite payload and system-on-chip (SoC) technology, spaceborne real-time synthetic aperture radar (SAR) imaging systems play a crucial role in various defense and civilian domains, including Earth remote sensing, military reconnaissance, disaster mitigation, and resource exploration. However, designing high-performance and high-reliability SAR imaging systems that operate in harsh environmental conditions while adhering to strict size, weight, and power consumption constraints remains a significant challenge. In this paper, we introduce a spaceborne SAR imaging chip based on a SoC architecture with system fault-tolerant technology. The fault-tolerant SAR SoC architecture has a CPU, interface subsystem, memory subsystem, data transit subsystem, and data processing subsystem. The data processing subsystem, which includes fast Fourier transform (FFT) modules, coordinated rotation digital computer (CORDIC) modules (for phase factor calculation), and complex multiplication modules, is the most critical component and can achieve various modes of SAR imaging. Through analyzing the computational requirements of various modes of SAR, we found that FFT accounted for over 50% of the total computational workload in SAR imaging processing, while the CORDIC modules for phase factor generation accounted for around 30%. Therefore, ensuring the fault tolerance of these two modules is crucial. To address this issue, we propose a word-length optimization redundancy (WLOR) method to make the fixed-point pipelined FFT processors in FFT modules fault tolerant. Additionally, we propose a fault-tolerant pipeline CORDIC architecture utilizing error correction code (ECC) and sum of squares (SOS) check. For other parts of the SoC architecture, we propose a generic partial triple modular redundancy (TMR) hardening method based on the HITS algorithm to improve fault tolerance. Finally, we developed a fully automated FPGA-based fault injection platform to test the design’s effectiveness by injecting errors at arbitrary locations. The simulation results demonstrate that the proposed methods significantly improved the chip’s fault tolerance, making the SAR imaging chip safer and more reliable. We also implemented a prototype measurement system with a chip-included board and demonstrated the proposed design’s performance on the Chinese Gaofen-3 strip-map continuous imaging system. The chip requires 9.2 s, 50.6 s, and 7.4 s for a strip-map with 16,384 × 16,384 granularity, multi-channel strip-map with 65,536 × 8192 granularity, and multi-channel scan mode with 32,768 × 4096 granularity, respectively, and the system hardware consumes 6.9 W of power to process the SAR raw data. Full article
(This article belongs to the Special Issue Spaceborne High-Resolution SAR Imaging)
Show Figures

Figure 1

Figure 1
<p>Flowchart of the CS algorithm.</p>
Full article ">Figure 2
<p>Multi-channel SAR transceiver system schematic.</p>
Full article ">Figure 3
<p>Specific implementation flow of signal reconstruction based on an inverse filter.</p>
Full article ">Figure 4
<p>The framework of the fault-tolerant spaceborne SAR real-time imaging processing system.</p>
Full article ">Figure 5
<p>The 256-point Radix-2<sup>2</sup> pipelined FFT architecture.</p>
Full article ">Figure 6
<p>RP comparison process of the MRPR method for FFT.</p>
Full article ">Figure 7
<p>Histogram of the SQNR error with randomly generated word length. (<b>a</b>–<b>c</b>) Test chirp signal with/without noise under round case; (<b>d</b>–<b>f</b>): test chirp signal with/without noise under truncation case.</p>
Full article ">Figure 7 Cont.
<p>Histogram of the SQNR error with randomly generated word length. (<b>a</b>–<b>c</b>) Test chirp signal with/without noise under round case; (<b>d</b>–<b>f</b>): test chirp signal with/without noise under truncation case.</p>
Full article ">Figure 8
<p>Circuit architecture block diagram of the 16,384 point FFT.</p>
Full article ">Figure 9
<p>The WLOR comparison process for WLOR-FFT.</p>
Full article ">Figure 10
<p>The iterative architecture of CORDIC.</p>
Full article ">Figure 11
<p>Architecture of the RH CORDIC processor.</p>
Full article ">Figure 12
<p>Architecture of the SOS check.</p>
Full article ">Figure 13
<p>Flow diagram of the “two-step” RH method.</p>
Full article ">Figure 14
<p>Architecture of the fault injection system.</p>
Full article ">Figure 15
<p>Fault injection FSM.</p>
Full article ">Figure 16
<p>The format of the linear frame address.</p>
Full article ">Figure 17
<p>The process of automated fault injection.</p>
Full article ">Figure 18
<p>Placement of the RH CORDIC and fault injection system.</p>
Full article ">Figure 19
<p>Relationship of authority value (<span class="html-italic">Authority</span>) and hub value (<span class="html-italic">Hub</span>).</p>
Full article ">Figure 20
<p>The circuit node hardening process based on the HITS algorithm.</p>
Full article ">Figure 21
<p>The microphotograph of the prototype SAR imaging chip.</p>
Full article ">Figure 22
<p>The measurement environment: (<b>a</b>) chip test platform; (<b>b</b>) the measurement system.</p>
Full article ">Figure 23
<p>Imaging result: (<b>a</b>) Strip-map mode imaging result; (<b>b</b>) two-channel strip-map mode imaging result; (<b>c</b>) two-channel scan mode imaging result.</p>
Full article ">
23 pages, 1520 KiB  
Article
Research and Hardware Implementation of a Reduced-Latency Quadruple-Precision Floating-Point Arctangent Algorithm
by Changjun He, Bosong Yan, Shiyun Xu, Yiwen Zhang, Zhenhua Wang and Mingjiang Wang
Electronics 2023, 12(16), 3472; https://doi.org/10.3390/electronics12163472 - 16 Aug 2023
Cited by 2 | Viewed by 1563
Abstract
In the field of digital signal processing, such as in navigation and radar, a significant number of high-precision arctangent function calculations are required. Lookup tables, polynomial approximation, and single/double-precision floating-point Coordinate Rotation Digital Computer (CORDIC) algorithms are insufficient to meet the demands of [...] Read more.
In the field of digital signal processing, such as in navigation and radar, a significant number of high-precision arctangent function calculations are required. Lookup tables, polynomial approximation, and single/double-precision floating-point Coordinate Rotation Digital Computer (CORDIC) algorithms are insufficient to meet the demands of practical applications, where both high precision and low latency are essential. In this paper, based on the concept of trading area for speed, a four-step parallel branch iteration CORDIC algorithm is proposed. Using this improved algorithm, a 128-bit quad-precision floating-point arctangent function is designed, and the hardware circuit implementation of the arctangent algorithm is realized. The results demonstrate that the improved algorithm can achieve 128-bit floating-point arctangent calculations in just 32 cycles, with a maximum error not exceeding 2×1034 rad. It possesses exceptionally high computational accuracy and efficiency. Furthermore, the hardware area of the arithmetic unit is approximately 0.6317 mm2, and the power consumption is about 40.6483 mW under the TSMC 65 nm process at a working frequency of 500 MHz. This design can be well suited for dedicated CORDIC processor chip applications. The research presented in this paper holds significant value for high-precision and rapid arctangent function calculations in radar, navigation, meteorology, and other fields. Full article
(This article belongs to the Special Issue Advances in Data Science: Methods, Systems, and Applications)
Show Figures

Figure 1

Figure 1
<p>Format for quad-precision floating-point numbers.</p>
Full article ">Figure 2
<p>Prediction of twiddle factors.</p>
Full article ">Figure 3
<p>Hardware circuit diagram of the top module.</p>
Full article ">Figure 4
<p>A split of 128-bit floating-point numbers.</p>
Full article ">Figure 5
<p>Circuit structure of exception detection and pre-processing module.</p>
Full article ">Figure 6
<p>Hardware structure of four-step parallel branch iteration module.</p>
Full article ">Figure 7
<p>The hardware circuit of the calculation of the 15th branch of the Y-channel.</p>
Full article ">Figure 8
<p>The computation block diagram for the Z-channel.</p>
Full article ">Figure 9
<p>The prediction of twiddle factors.</p>
Full article ">Figure 10
<p>Circuit structure for leading zero detection.</p>
Full article ">Figure 11
<p>Format for fixed-point arctangent.</p>
Full article ">Figure 12
<p>The hardware structure of the floating-point regularization post-processing module.</p>
Full article ">Figure 13
<p>Error distribution results.</p>
Full article ">Figure 14
<p>The testing waveform for arctangent computation.</p>
Full article ">Figure 15
<p>The circuit diagram of the 128-bit floating-point arctangent function.</p>
Full article ">
16 pages, 3728 KiB  
Article
The Ultrasound Signal Processing Based on High-Performance CORDIC Algorithm and Radial Artery Imaging Implementation
by Chaohong Zhang, Xingguang Geng, Fei Yao, Liyuan Liu, Ziyang Guo, Yitao Zhang and Yunfeng Wang
Appl. Sci. 2023, 13(9), 5664; https://doi.org/10.3390/app13095664 - 4 May 2023
Cited by 5 | Viewed by 2668
Abstract
The radial artery reflects the largest amount of physiological and pathological information about the human body. However, ultrasound signal processing involves a large number of complex functions, and traditional digital signal processing can hardly meet the requirements of real-time processing of ultrasound data. [...] Read more.
The radial artery reflects the largest amount of physiological and pathological information about the human body. However, ultrasound signal processing involves a large number of complex functions, and traditional digital signal processing can hardly meet the requirements of real-time processing of ultrasound data. The research aims to improve computational accuracy and reduce the hardware complexity of ultrasound signal processing systems. Firstly, this paper proposes to apply the coordinate rotation digital computer (CORDIC) algorithm to the whole radial artery ultrasound signal processing, combines the signal processing characteristics of each sub-module, and designs the dynamic filtering module based on the radix-4 CORDIC algorithm, the quadrature demodulation module based on the partitioned-hybrid CORDIC algorithm, and the dynamic range transformation module based on the improved scale-free CORDIC algorithm. A digital radial artery ultrasound imaging system was then built to verify the accuracy of the three sub-modules. The simulation results show that the use of the high-performance CORDIC algorithm can improve the accuracy of data processing. This provides a new idea for the real-time processing of ultrasound signals. Finally, radial artery ultrasound data were collected from 20 volunteers using different probe scanning modes at three reference positions. The vessel diameter measurements were averaged to verify the reliability of the CORDIC algorithm for radial artery ultrasound imaging, which has practical application value for computer-aided clinical diagnosis. Full article
(This article belongs to the Special Issue Computational Ultrasound Imaging and Applications)
Show Figures

Figure 1

Figure 1
<p>Block diagram of radial artery ultrasound imaging system.</p>
Full article ">Figure 2
<p>Flow diagram of radial artery ultrasonic signal processing.</p>
Full article ">Figure 3
<p>Block diagram of the dynamic finite impulse response (FIR) filter design.</p>
Full article ">Figure 4
<p>Block diagram of the quadrature demodulation implementation.</p>
Full article ">Figure 5
<p>Block diagram of the partitioned-hybrid coordinate rotation digital computer (CORDIC) algorithm.</p>
Full article ">Figure 6
<p>Block diagram of the improved scale-free CORDIC algorithm.</p>
Full article ">Figure 7
<p>Experimental platform of digital radial artery ultrasound imaging system based on FPGA.</p>
Full article ">Figure 8
<p>Accuracy of dynamic FIR filter coefficients based on the radix−4 CORDIC algorithm. (<b>a</b>) The comparison of the 33rd−order low−pass FIR filter coefficients generated by the radix-4 CORDIC and filter−Designer; (<b>b</b>) The error of the output filter coefficients of the radix−4 CORDIC algorithm.</p>
Full article ">Figure 9
<p>Test results of the dynamic FIR filtering performance based on the radix−4 CORDIC algorithm. (<b>a</b>) FPGA simulation of time-domain waveform before and after filtering of synthetic single−frequency signals; (<b>b</b>) FPGA simulation of time−domain waveform before and after filtering of white noise signal; (<b>c</b>) FPGA simulation of the spectrum before and after filtering synthetic single−frequency signals; (<b>d</b>) FPGA simulation of the spectrum before and after filtering white noise signal.</p>
Full article ">Figure 10
<p>(<b>a</b>) Absolute error distribution of the MATLAB square root simulation based on the partitioned−hybrid algorithm. (<b>b</b>) Absolute error distribution of the MATLAB logarithmic simulation based on the improved scale−free CORDIC algorithm.</p>
Full article ">Figure 11
<p>Ultrasound image of the radial artery in the wrist of a healthy adult male without signal processing. (<b>a</b>) Probe scanning direction parallel to the vessel; (<b>b</b>) Probe scanning direction perpendicular to the vessel.</p>
Full article ">Figure 12
<p>Ultrasound image of the radial artery in the wrist of the same healthy adult male after signal processing. (<b>a</b>) Probe scanning direction parallel to the vessel; (<b>b</b>) Probe scanning direction perpendicular to the vessel.</p>
Full article ">Figure 13
<p>Comparison of radial artery diameters in subjects with different scanning modalities of the probe. (<b>a</b>) Men; (<b>b</b>)Women.</p>
Full article ">
10 pages, 2212 KiB  
Article
A New Recursive Trigonometric Technique for FPGA-Design Implementation
by Xing Xing and Wilson Wang
Sensors 2023, 23(7), 3683; https://doi.org/10.3390/s23073683 - 2 Apr 2023
Cited by 5 | Viewed by 1910
Abstract
This paper presents a new recursive trigonometric (RT) technique for Field-Programmable Gate Array (FPGA) design implementation. The traditional implementation of trigonometric functions on FPGAs requires a significant amount of data storage space to store numerous reference values in the lookup tables. Although the [...] Read more.
This paper presents a new recursive trigonometric (RT) technique for Field-Programmable Gate Array (FPGA) design implementation. The traditional implementation of trigonometric functions on FPGAs requires a significant amount of data storage space to store numerous reference values in the lookup tables. Although the coordinate rotation digital computer (CORDIC) can reduce the required FPGA storage space, their implementation process can be very complex and time-consuming. The proposed RT technique aims to provide a new approach for generating trigonometric functions to improve communication accuracy and reduce response time in the FPGA. This new RT technique is based on the trigonometric transformation; the output is calculated directly from the input values, so its accuracy depends only on the accuracy of the inputs. The RT technique can prevent complex iterative calculations and reduce the computational errors caused by the scale factor K in the CORDIC. Its effectiveness in generating highly accurate cosine waveform is verified by simulation tests undertaken on an FPGA. Full article
(This article belongs to the Section Sensors Development)
Show Figures

Figure 1

Figure 1
<p>The architecture of the RT algorithm.</p>
Full article ">Figure 2
<p>The RT cosine waveform simulation by MATLAB.</p>
Full article ">Figure 3
<p>16-bit accuracy comparison among different methods: (<b>a</b>) Radix-2, (<b>b</b>) Radix-4, (<b>c</b>) RT.</p>
Full article ">Figure 4
<p>Accuracy comparison of the RT algorithms using and without using the quadrant transformation, represented by a solid line and a dashed line, respectively.</p>
Full article ">Figure 5
<p>Experiment setup of FPGA implementation of the cosine waveform: (1) Oscilloscope; (2) FPGA USB blaster; (3) DAC output; (4) Cyclone IV E FPGA; (5) Connection to a PC.</p>
Full article ">Figure 6
<p>A cosine waveform generated by Cyclone IV FPGA using the RT technique.</p>
Full article ">
1 pages, 154 KiB  
Correction
Correction: McCordic et al. The Household Food Security Implications of Disrupted Access to Basic Services in Five Cities in the Global South. Land 2022, 11, 654
by Cameron McCordic, Bruce Frayne, Naomi Sunu and Clare Williamson
Land 2023, 12(3), 654; https://doi.org/10.3390/land12030654 - 10 Mar 2023
Viewed by 729
Abstract
In the original publication [...] Full article
Back to TopTop