A novel envelope detector for high-frame rate, high-frequency ultrasound imaging
This paper proposes a novel design of envelope detectors capable of supporting a small animal cardiac imaging system requiring a temporal resolution of more than 150 frames per second. The proposed envelope detector adopts the quadrature demodulation and the lookup table (LUT) method to compute the...
| Veröffentlicht in: | IEEE transactions on ultrasonics, ferroelectrics, and frequency control. - 1986. - 54(2007), 9 vom: 20. Sept., Seite 1792-801 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2007
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on ultrasonics, ferroelectrics, and frequency control |
| Schlagworte: | Evaluation Study Journal Article Research Support, N.I.H., Extramural |
| Zusammenfassung: | This paper proposes a novel design of envelope detectors capable of supporting a small animal cardiac imaging system requiring a temporal resolution of more than 150 frames per second. The proposed envelope detector adopts the quadrature demodulation and the lookup table (LUT) method to compute the magnitude of the complex baseband components of received echo signals. Because the direct use of the LUT method for a square root function is not feasible due to a large memory size, this paper presents a new LUT strategy dramatically reducing its size by using binary logarithmic number system (BLNS). Due to the nature of BLNS, the proposed design does not require an individual LOG-compression functional block. In the implementation using a field programmable gate array (FPGA), a total of 166.56 Kbytes memories were used for computing the magnitude of 16-bit in-phase and quadrature components instead of 4 Gbytes in the case of the direct use of the LUT method. The experimental results show that the proposed envelope detector is capable of generating LOG-compressed envelope data at every clock cycle after 32 clock cycle latency, and its maximum error is less than 0.5 (i.e., within the rounding error), compared with the arithmetic results of square root function and LOG compression |
|---|---|
| Beschreibung: | Date Completed 26.11.2007 Date Revised 10.12.2019 published: Print Citation Status MEDLINE |
| ISSN: | 1525-8955 |