An Optimized Low-Power VLSI Architecture For ECG VCG Data Compression For IoHT Wearable Device Application
An Optimized Low-Power VLSI Architecture For ECG VCG Data Compression For IoHT Wearable Device Application
I. I NTRODUCTION
C ARDIAC ailments are one of the biggest causes of Fig. 1. Basic IoHT system.
mortality, causing millions of deaths worldwide every
year. Electrocardiogram (ECG) signal manifests the heart’s
electrical activity and is widely used by clinicians to detect over long intervals (12–24 h). This continuous monitoring of
these heart abnormalities. In general, a 12-lead ECG is con- the patients results in the generation of a large amount of
sidered by cardiologists for the diagnosis of cardiac diseases. clinical data.
Similarly, medical professionals also view a three-lead vec- Data compression aids in reducing the size of acquired
torcardiogram (VCG) in many cardiac cases as it can depict ECG/VCG data that can be stored or sent to cloud storage.
anomalies with fewer leads [1]. In the Internet of Healthcare The data compression schemes can be of two types: lossy
Thing (IoHT), ECG/VCG data are acquired using different and lossless. Lossy data compression results in permanent
sensors and, later, sent to cloud storage to enable telehealth loss of information during the processing steps, whereas loss-
monitoring and analysis by the doctors in a hospital. A typical less compression techniques ensure that no information loss
IoHT system is shown in Fig. 1. However, for reliable detec- occurs during the processing steps in the compression [2], [3].
tion of heart diseases, ECG and VGC need to be recorded As we know, biomedical signals contain critical pathological
details that need to be preserved during the compression
Manuscript received 16 December 2022; revised 29 June 2023; accepted process; therefore, lossless compression is preferred over lossy
25 August 2023. Date of publication 6 October 2023; date of current version
28 November 2023. (Corresponding author: Meenali Janveja.) techniques.
Meenali Janveja, Ashwani Kumar Sharma, Abhyuday Bhardwaj, and Gaurav Although users can rely on lossy techniques for ECG
Trivedi are with the Department of Electronics and Electrical Engineering, compression, lossless compression is needed for better clinical
Indian Institute of Technology Guwahati, Guwahati, Assam 781039, India
(e-mail: [email protected]). accuracy for many reasons. Furthermore, worldwide medical
Jan Pidanic is with the Department of Electrical Engineering, University of regulations also advocate for the lossless techniques of ECG
Pardubice, 53210 Pardubice, Czech Republic. data compression. Also, with advanced diagnostics, ECG
Color versions of one or more figures in this article are available at
https://doi.org/10.1109/TVLSI.2023.3314611. variations that were earlier treated as random heart activity
Digital Object Identifier 10.1109/TVLSI.2023.3314611 can now be of great medical relevance. Advanced machine
1063-8210 © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See https://www.ieee.org/publications/rights/index.html for more information.
Authorized licensed use limited to: Wenzhou University. Downloaded on December 02,2024 at 05:57:03 UTC from IEEE Xplore. Restrictions apply.
JANVEJA et al.: OPTIMIZED LOW-POWER VLSI ARCHITECTURE FOR ECG/VCG DATA COMPRESSION 2009
Authorized licensed use limited to: Wenzhou University. Downloaded on December 02,2024 at 05:57:03 UTC from IEEE Xplore. Restrictions apply.
2010 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 31, NO. 12, DECEMBER 2023
(I I + I I I )
packaging schemes, which require less hardware and memory aV F = (3)
resources. Their novelties are depicted as follows. 2
1) Serial Architecture: An optimized technique to inter- (I − I I I )
aV L = (4)
leave the samples of multilead ECG and VCG signal is 2
used, eliminating the need for parallel architecture and V 2 = (0.088733 × I ) − (0.09116 × I I )
saving area and power resources. + (1.57862 × V 1) + (0.230214 × V 5) (5)
2) Modified Adaptive Linear Prediction Block: A multi- V 3 = (0.245068 × I ) + (0.447773 × I I )
plier and divider-less adaptive linear prediction block is
proposed in this article. The architecture is designed to + (1.14726 × V 1) + (0.609744 × V 5) (6)
optimize all the mulitplication and division operations V 4 = (0.111111 × I ) + (0.064849 × I I )
as shift operations, making it area- and power-efficient. + (0.465706 × V 1) + (1.07423 × V 5) (7)
The same architecture is used as a subsystem for com- V 6 = (0.202721 × I ) + (0.038811 × I I )
pression and decompression.
3) Simple Error Encoding Scheme: In the realization of the − (0.176913 × V 1) + (0.59492 × V 5). (8)
proposed method, a simple linear encoding scheme is
The complete 12-lead information can be built from the
used, which is implemented using comparators. Further-
information of these suggested four leads by the clinicians.
more, optimization to the original samples is performed
Therefore, four-lead ECG data can be compressed instead of
so that the error obtained can be encoded using fewer
12-lead data to be communicated over a channel. This reduces
bits.
the hardware and memory requirements of the wearable
4) Novel Packaging Scheme for Encoded Error Data: The
devices. Similarly, the proposed algorithm can be extended
proposed work uses a simple variable length entropy
for three-lead VCG data compression. The complete ECG
encoding scheme, which involves selecting a fixed num-
compression algorithm is explained in Algorithm 1. The
ber of bits as per the range of encoded error. The
interleaved samples of four-lead ECG or three-lead VCG are
packed data are generated by concatenating the encoding
fed as input to the compression system. A four-lead data
length and selected bits of the predicted error. This tech-
compression system is presented in [8]. The data of four
nique does not require complex computations, making
leads come parallelly from the sensors in any conventional
it hardware-efficient and maintaining a high CR.
system. However, processing these leads in parallel generally
5) VCG Compression and Decompression Systems: The
requires parallel architecture [8]. As it is evident that parallel
heart’s electrical activity can be monitored with the
architectures increase hardware requirements, we use sequen-
help of two signals ECG or VCG. ECG represents
tial implementation using a simple technique to interleave
the heart’s electrical activity using 12 leads, whereas
samples of all the four leads in this work. Initially, the first
VCG records the magnitude and direction of the elec-
sample of the first lead is taken as an input and compressed.
trical forces generated by the heart using three leads.
Later, the first samples of the other three leads are processed
VCG is a more useful investigative method for better
sequentially. The operating frequency of the design is set
diagnosis. It demonstrates clinical superiority over the
in such a way that all the four samples of every lead are
standard 12-lead ECG, specifically in the cases of atrial
processed before the second set of samples starts processing.
and ventricular hypertrophy, identification of myocardial
This enables us to optimize hardware resources considerably
infarction (MI) and ischemia, and to detect the pres-
and achieve low-power and area-efficient design for multilead
ence of multiple fascicular and bundle branch blocks.
ECG compression.
Among all the CVDs, MI and ischemia are among
Next, these interleaved samples are divided by a value
the biggest causes of mortality worldwide, and making
“T ” chosen adaptively to remove an overflow error in the
an accurate diagnosis of MI is crucial. Therefore, VCG
computations and are input to the adaptive linear prediction
compression can significantly add to the medical field
block. In this block, the first (I)-, second (II)-, and third
for better diagnosing these cardiac diseases and aids in
(III)-order linear predictions of the current sample are per-
increasing life expectancy. Almost all the works reported
formed. The previous three samples are used to estimate the
previously pertain to ECG data compression. However,
slope parameter and the weighted average of II- and III-order
the algorithm proposed in this article is also extended
linear predictions [8]. Note that we have assumed the first three
for VCG data compression and decompression.
samples to lie in the flat region of an ECG signal to simplify
A. Proposed Algorithm the algorithm. This assumption does not introduce any error
Conventionally, ECG is recorded as 12 leads of continuous in the compressed ECG signal. In the first step, the I-, II-, and
data. However, the electrical information of these 12 leads III-order linear predictions of the current sample are estimated
can be estimated mathematically with the help of only four using (9)–(11). x1 ˆ[n], x2 ˆ[n], and x3 ˆ[n] are the I-, II-, and
reference leads [21], i.e., I , I I , V 1, and V 5, as shown in the III- order linear predictions of the current sample, respectively,
equations below
x1 ˆ[n] = x[n − 1] (9)
I I I = I I −I (1)
x2 ˆ[n] = 2 · x[n − 1] − x[n − 2] (10)
−(I + I I )
aV R = (2) x3 ˆ[n] = 3 · x[n − 1] − 3 · x[n − 2] + x[n − 3]. (11)
2
Authorized licensed use limited to: Wenzhou University. Downloaded on December 02,2024 at 05:57:03 UTC from IEEE Xplore. Restrictions apply.
JANVEJA et al.: OPTIMIZED LOW-POWER VLSI ARCHITECTURE FOR ECG/VCG DATA COMPRESSION 2011
Algorithm 1 Pseudocode for ECG Data Compression linear predictions as per (14). Note that the threshold value of
10 is chosen adaptively by considering the tradeoff between
accuracy and CR
x2 ˆ[n] · W2 [n] + x3 ˆ[n] · W3 [n]
ˆ =
x[n] . (14)
(W2 [n] + W3 [n])
The weights W2 [n] and W3 [n] are calculated according to
the following equation:
Wi [n] = K ( M−ei [n])
¯
(15)
where K is taken as 2 for the ease of hardware implementation,
¯ is the
and M is determined after multiple iterations. ei [n]
average error calculated for the previous three samples for
a particular order of linear prediction as per the following
equation:
(ei [n − 1] + ei [n − 2] + ei [n − 3])
¯ =
ei [n] . (16)
3
The error term in weight calculation ensures that the final
prediction after the weighted average is closer to the lin-
ear prediction with fewer errors than II- and III-order linear
predictions. The adaptive linear prediction is followed by the
final prediction error calculation, which is estimated using the
following equation:
ˆ
e[n] = x[n] − x[n]. (17)
The next step of the compression process is encoding
the error data. In the previous works, complex encoding
techniques, such as Huffman encoding schemes [4] and GRC
[5], [8], are used. However, these encoding schemes involve
complex multiplication and division operations, which are
compute- and resource-intensive. Therefore, a variable length
entropy encoding [6] is used in the proposed work, which
requires only comparing operations and can be implemented
with minimal hardware resources on silicon, as shown in
Algorithm 1. In our proposed work, we encode the samples in
fewer bits, evident in Algorithm 1 due to the optimization
performed in preprocessing the interleaved samples. This
further enables us to optimize the hardware requirements. The
encoding length for the error depends on the range in which
the prediction error falls as shown in Algorithm 1. The final
step of the encoding process is packaging an encoded error,
which facilitates easy decompression of the compressed data.
Some of the previous works [6], [8] use complex packaging
techniques, which require more information to be sent over
the channel and more registers and counters to store the
data before transmission. This leads to a lesser CR and the
Furthermore, slope parameters are estimated using the follow- utilization of more hardware resources. Therefore, we use a
ing equations: simple packaging technique in this work, which selects a fixed
d12 [n] = x[n − 1] − x[n − 2] (12) number of bits as per the encoded sample error range, shown
in Algorithm 1. In the proposed compression algorithm, the
d23 [n] = x[n − 2] − x[n − 3]. (13)
first sample of every ECG lead is not encoded; therefore,
If d12 [n] and d23 [n] are small compared with the threshold no packaging is required for these first samples. However, the
value of the slope, it is assumed that the current sample prediction error for subsequent samples of all the four ECG
is lying in a flat region; thus, the final prediction is made leads is also packed with the encoding length information.
with the help of I-order linear prediction using (9). However, Finally, these packed encoded error data are obtained as a
if any of the two slope parameters breaches the threshold, the compressed bitstream and are sent for telemonitoring or stored
final prediction is the weighted average of II- and III-order ON -chip or cloud.
Authorized licensed use limited to: Wenzhou University. Downloaded on December 02,2024 at 05:57:03 UTC from IEEE Xplore. Restrictions apply.
2012 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 31, NO. 12, DECEMBER 2023
Authorized licensed use limited to: Wenzhou University. Downloaded on December 02,2024 at 05:57:03 UTC from IEEE Xplore. Restrictions apply.
JANVEJA et al.: OPTIMIZED LOW-POWER VLSI ARCHITECTURE FOR ECG/VCG DATA COMPRESSION 2013
TABLE I
P ERFORMANCE E VALUATION OF C OMPRESSION D ESIGN
If △e = 3, then the prediction value is estimated as follows: samples, only three samples are interleaved. The rest of the
algorithm and design remains the same as for ECG.
x2 ˆ[n] x3 ˆ[n]
pred_value = + On the other hand, the input of the decompression system
9 1.125 contains the error information of the successive samples. The
= x2 ˆ[n] ≫ 4 + x2 ˆ[n] ≫ 5 + x2 ˆ[n] ≫ 6 first step of decompression is unpacking and decoding the
+ x3 ˆ[n] ≫ 1 + x3 ˆ[n] ≫ 2 + x3 ˆ[n] ≫ 3. error data, followed by lead separation, similar to compression.
(22) Furthermore, I-, II-, and III-order linear predictions, prediction
error calculation, lead merging, slope parameter calculation,
If △e >= 4, then the prediction value is estimated as (23). and adaptive linear prediction are performed to retrieve the
¯
Equation (23) is optimized, considering 2△e ≫ 1 and 2△e ≪ 1 original ECG.
x2 ˆ[n] x3 ˆ[n]
pred_val = + ¯
IV. R ESULTS AND D ISCUSSION
1 + 2△e 1 + 2△e
x2 ˆ[n]
x3 ˆ[n]
The proposed method is validated using MATLAB and is
= △e
+ realized as an ASIC. Its implementation details and analysis
2 1 are presented below.
= x2 ˆ[n] ≫ △e + x3 ˆ[n]. (23)
For the negative values of △e, shifting operations of A. Performance Evaluation
x2 ˆ[n] and x3 ˆ[n] are interchanged. It can be observed from
The proposed compression design is validated using the
the equations mentioned above that the division operations
PTB-DB database sampled at 250 Hz [19]. Each input ECG
are optimized as shift operations saving hardware resources
sample is 16 bits and is taken from a variety of age ranges
and power. The architecture of the modified adaptive linear
and gender. Furthermore, each signal is analyzed for a 3-s
block is presented in Fig. 3. The final predicted value of
duration at a time. The efficacy of designs is evaluated by CR
the current sample is then used to calculate the absolute
and percentage root mean square difference (PRD). CR, CR,
prediction error. The error data are further encoded with
is defined mathematically as the ratio of the size of data before
the help of variable length entropy encoding, which requires
compression to the size of data after compression. Note that
comparators for the implementation. Finally, the encoded error
a high CR value is desirable for a compression system
is packaged, appending the length information of the current
encoded error sample with the encoded error samples. The Original_data_size
CR = . (24)
resulting packed encoded error data as a compressed bitstream Compressed_data_size
can be stored or transmitted as needed. Once the complete
Furthermore, PRD should be as low as possible for better
process is completed, the registers are updated for the new
performance, which can be expressed as follows:
samples, and a similar process is repeated for the entire input v
bitstream. Similarly, we can use this hardware for VCG data u PN
u (X (n) − X r (n))2
compression. As described before, only three leads will be PRD(100%) = 100 × t n=1P N . (25)
n=1 (X (n))
2
transmitted for a VCG. Therefore, instead of interleaving four
Authorized licensed use limited to: Wenzhou University. Downloaded on December 02,2024 at 05:57:03 UTC from IEEE Xplore. Restrictions apply.
2014 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 31, NO. 12, DECEMBER 2023
TABLE II
FPGA R ESOURCE U TILIZATION
Authorized licensed use limited to: Wenzhou University. Downloaded on December 02,2024 at 05:57:03 UTC from IEEE Xplore. Restrictions apply.
JANVEJA et al.: OPTIMIZED LOW-POWER VLSI ARCHITECTURE FOR ECG/VCG DATA COMPRESSION 2015
TABLE V
C OMPARISON W ITH S TATE - OF - THE -A RT M ETHODS
Authorized licensed use limited to: Wenzhou University. Downloaded on December 02,2024 at 05:57:03 UTC from IEEE Xplore. Restrictions apply.