<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">14981</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2021.014981</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Adaptive Signal Enhancement Unit for EEG Analysis in Remote Patient Care Monitoring Systems</article-title>
<alt-title alt-title-type="left-running-head">Adaptive Signal Enhancement Unit for EEG Analysis in Remote Patient Care Monitoring Systems</alt-title>
<alt-title alt-title-type="right-running-head">Adaptive Signal Enhancement Unit for EEG Analysis in Remote Patient Care Monitoring Systems</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western">
<surname>Srinivas</surname>
<given-names>Ch.</given-names>
</name>
<xref ref-type="aff" rid="aff-1">1</xref>
<email>chsrinivaseeg@gmail.com</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western">
<surname>Rao</surname>
<given-names>K. Chandrabhushana</given-names>
</name>
<xref ref-type="aff" rid="aff-2">2</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Electronics and Communication Engineering, J. N. T. University</institution>, <addr-line>Kakinada, 533003</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Electronics and Communication Engineering, JNTUK-UCEV</institution>, <addr-line>Vizianagaram, 535003</addr-line>, <country>India</country></aff>
</contrib-group>
<author-notes><corresp id="cor1">&#x002A;Corresponding Author: Ch. Srinivas. Email: <email>chsrinivaseeg@gmail.com</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2020-12-14">
<day>14</day>
<month>12</month>
<year>2020</year>
</pub-date>
<volume>67</volume>
<issue>2</issue>
<fpage>1801</fpage>
<lpage>1817</lpage>
<history>
<date date-type="received">
<day>31</day>
<month>10</month>
<year>2020</year>
</date>
<date date-type="accepted">
<day>29</day>
<month>11</month>
<year>2020</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2021 Srinivas and Rao</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Srinivas and Rao</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_14981.pdf"></self-uri>
<abstract>
<p>In this paper we propose an efficient process of physiological artifact elimination methodology from brain waves (BW), which are also commonly known as electroencephalogram (EEG) signal. In a clinical environment during the acquisition of BW several artifacts contaminates the actual BW component. This leads to inaccurate and ambiguous diagnosis. As the statistical nature of the EEG signal is more non-stationery, adaptive filtering is the more promising method for the process of artifact elimination. In clinical conditions, the conventional adaptive techniques require many numbers of computational operations and leads to data samples overlapping and instability of the algorithm used. This causes delay in diagnosis and decision making. To overcome this problem in our work we propose to set a threshold value to diminish the problem of round off error. The resultant adaptive algorithm based on this strategy is Non-linear Least mean square (NL<sup>2</sup>MS) algorithm. Again, to improve this algorithm in terms of filtering capability we perform data normalization, using this algorithm several hybrid versions are developed to improve filtering and reduce computational operations. Using the method, a new signal enhancement unit (SEU) is realized and performance of various hybrid versions of algorithms examined using real EEG signals recorded from the subject. The ability of the proposed schemes is measured in terms of convergence, enhancement and multiplications required. Among various SEUs, the MCN<sup>2</sup>L<sup>2</sup>MS algorithm achieves 14.6734, 12.8732, 10.9257, 15.7790 dB during the artifact removal of RA, EMG, CSA and EBA components with only two multiplications. Hence, this algorithm seems to be better candidate for artifact elimination.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Adaptive algorithms</kwd>
<kwd>artifacts</kwd>
<kwd>brain waves</kwd>
<kwd>clipped algorithms</kwd>
<kwd>signal enhancement unit</kwd>
<kwd>wireless EEG monitoring</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Electroencephalogram (EEG) is the key tool to illustrates the functionality of various segments of the brain. Any physiological abnormality in the brain results abnormalities in the biopotentials generated in the neurons and causes medical ill conditions in the patient. As per the surveys of world health organization reported in [<xref ref-type="bibr" rid="ref-1">1</xref>&#x2013;<xref ref-type="bibr" rid="ref-4">4</xref>] brain wave disorders responsible majority of mortality during nowadays. Hence, high resolution EEG signals are needed in the diagnosis of several deceases. During the acquisition of brain waves, various physiological components like respiration artifact, muscle potential, cardiac activity and potential due to eye blink will contaminates the brain wave component. In clinical scenario these un-wanted components are considered as respiration artifacts (RA), Electro Muscle Artifact (EMA), Cardiac signal artifact (CSA) and Eyeblink artifact (EBA). These artifacts contaminate the signal quality, which is required for abnormality identification. Therefore, in remote EEG monitoring as well as in automatic EEG monitoring systems an important task is artifact removal. Since the artifacts masks the tiny features of brain wave, it is highly desirable to eliminate these artifacts and to facilitate high resolution brain wave for analysis and diagnosis. Among the various techniques of artifact removal, the adaptive artifact elimination is a promising method. This is because adaptive techniques are able to vary the weights based on input noisy signal. Also, among various physiological signals, the brain wave has a very non-stationary pattern. Thus, conventional filtering techniques are not suitable for artifact elimination in brain waves. Hence, adaptive FIR filters are the best solution in this process. Several adaptive filtering techniques are developed to eliminate artifacts from physiological signals. These are presented in several contributions like [<xref ref-type="bibr" rid="ref-5">5</xref>&#x2013;<xref ref-type="bibr" rid="ref-10">10</xref>]. In the presence of artifacts, the brain waves are ambiguous and needed to be eliminated. Due to technological developments in the brain wave analysis several techniques like brain computer interface (BCI), source localization, remote health care monitoring, machine learning, etc., also needs pre-processing of brain waves to facilitate high resolution EEG components for diagnosis. Several such contributions are found in the literature [<xref ref-type="bibr" rid="ref-11">11</xref>&#x2013;<xref ref-type="bibr" rid="ref-14">14</xref>]. Therefore, a typical remote health monitoring network consists of signal recording machine, telemetry link, brain computer interface and control station. Another important aspect of a remote brain care system is computational complexity.</p>
<p>In wireless EEG monitoring systems, the computational complexity is a major concern to be concentrated. If the received filter length is large, much time is required to perform the filtering operations, which are in terms of additions and multiplications. This cause overlapping of data values at the input of the SEU. To achieve less computational complexity, we develop the hybrid versions of MN<sup>2</sup>L<sup>2</sup>MS and clipped algorithms based on [<xref ref-type="bibr" rid="ref-15">15</xref>]. In [<xref ref-type="bibr" rid="ref-16">16</xref>] a methodology of less computational operations is presented based on sign-based algorithms. During some serious situation of the patient, some samples of EEG component becomes zero and undergo fluctuations, cause weight variations and leads to ambiguities in abnormality identification. To overcome such ambiguities, we set a threshold to error value based on the frame work presented in [<xref ref-type="bibr" rid="ref-17">17</xref>&#x2013;<xref ref-type="bibr" rid="ref-19">19</xref>]. By introducing this threshold in conventional LMS, it is modified as Non-Linear LMS (NL<sup>2</sup>MS). To improve convergence speed and to improve filtering capability we apply data normalization. The normalization with respect to data vector of Non-Linear LMS is termed as Normalized Non-Linear LMS (N<sup>2</sup>L<sup>2</sup>MS). This increase the number of computations of the denominator part of the algorithm equal to tap length. To avoid this, we modified the N<sup>2</sup>L<sup>2</sup>MS algorithm such that, the normalization is performed with respect to maximum of the input vector instead of all the values of the vector. As a result, the number of multiplication operations required in the denominator is only one. This algorithm is termed as Modified N<sup>2</sup>L<sup>2</sup>MS (M N<sup>2</sup>L<sup>2</sup>MS) algorithm. The resultant algorithms are Modified Clipped N<sup>2</sup>L<sup>2</sup>MS (MCN<sup>2</sup>L<sup>2</sup>MS) algorithm, Modified Sign (MSN<sup>2</sup>L<sup>2</sup>MS) algorithm and Modified Sign Sign N<sup>2</sup>L<sup>2</sup>MS (MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS) algorithm. Using this adaptive FIR frame work we develop a signal enhancement unit (SEU) to eliminate various physiological components from brain wave in clinical scenario. The performance of various algorithms in SEU are tested experimentally using real EEG signals.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Hybrid Adaptive Filter for Brain Wave Enhancement</title>
<p>In the artifact elimination process the key element is the adaptive algorithm, which trains the FIR filter to change its coefficients. Let us consider &#x2018;L&#x2019; to be the length of FIR filter. To facilitate ability to alter coefficients of filter in accordance to the artifact component this FIR filter is associated with an adaptive algorithm initially. Based on this strategy and using the framework of artifact elimination we develop an efficient adaptive artifact eliminator (AAE) which has better convergence, filtering ability, stability and less computational complexity. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> shows a typical schematic diagram of an AAE. Let <inline-formula id="ieqn-1"><alternatives><inline-graphic xlink:href="ieqn-1.png"/><tex-math id="tex-ieqn-1"><![CDATA[$E = \mathbf{e}_{\mathbf{1}}+\mathbf{a}_{\mathbf{1}}$]]></tex-math><mml:math id="mml-ieqn-1"><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mi>e</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mn>1</mml:mn></mml:mstyle></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mn>1</mml:mn></mml:mstyle></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>, here, E is the recorded signal of EEG, which combines the definite brain activity component (<inline-formula id="ieqn-2"><alternatives><inline-graphic xlink:href="ieqn-2.png"/><tex-math id="tex-ieqn-2"><![CDATA[$\mathbf{e}_{\mathbf{1}}$]]></tex-math><mml:math id="mml-ieqn-2"><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mi>e</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mn>1</mml:mn></mml:mstyle></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>) and artifact component (<inline-formula id="ieqn-3"><alternatives><inline-graphic xlink:href="ieqn-3.png"/><tex-math id="tex-ieqn-3"><![CDATA[$\mathbf{a}_{\mathbf{1}}$]]></tex-math><mml:math id="mml-ieqn-3"><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mn>1</mml:mn></mml:mstyle></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>).</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Typical block diagram of signal enhancement unit for brain wave analysis</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-1.png"/>
</fig>
<p>A random component <inline-formula id="ieqn-4"><alternatives><inline-graphic xlink:href="ieqn-4.png"/><tex-math id="tex-ieqn-4"><![CDATA[$\mathrm{a}_{2}$]]></tex-math><mml:math id="mml-ieqn-4"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula> is taken as reference component. The weight coefficient vector is w(n) of the filter in SEU, y(n) is the convolution between w(n) and a2. The adaptive algorithm trains <inline-formula id="ieqn-5"><alternatives><inline-graphic xlink:href="ieqn-5.png"/><tex-math id="tex-ieqn-5"><![CDATA[$\mathrm{a}_{2}$]]></tex-math><mml:math id="mml-ieqn-5"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>, become close to <inline-formula id="ieqn-6"><alternatives><inline-graphic xlink:href="ieqn-6.png"/><tex-math id="tex-ieqn-6"><![CDATA[$\mathrm{a}_{1}$]]></tex-math><mml:math id="mml-ieqn-6"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>, so that the summer performs the operation of <inline-formula id="ieqn-7"><alternatives><inline-graphic xlink:href="ieqn-7.png"/><tex-math id="tex-ieqn-7"><![CDATA[$\mathrm{e}_{1}+\mathrm{a}_{1}-\mathrm{a}_{2}$]]></tex-math><mml:math id="mml-ieqn-7"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. As the number of iterations are going on, <inline-formula id="ieqn-8"><alternatives><inline-graphic xlink:href="ieqn-8.png"/><tex-math id="tex-ieqn-8"><![CDATA[$\mathrm{a}_{1}\text{and }\mathrm{a}_{2}$]]></tex-math><mml:math id="mml-ieqn-8"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mstyle class="text"><mml:mtext>and&#x00A0;</mml:mtext></mml:mstyle><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula> come close to each other and maximum of their components get cancel with each other and actual brain wave component B(n) will come out of SEU. The component f(n) is the feedback signal, it drives the adaptive algorithm as error signal, based on this the weight updating process will be repeated. The mathematical expression for the LMS driven SEU is given by, <inline-formula id="ieqn-9"><alternatives><inline-graphic xlink:href="ieqn-9.png"/><tex-math id="tex-ieqn-9"><![CDATA[$\mathrm{w} \left(\mathrm{n}+1\right)= \mathrm{w} \left(\mathrm{n}\right)+\mathrm{s}\cdot \mathrm{E} \left(\mathrm{n}\right)\cdot\mathrm{f}(\mathrm{n})$]]></tex-math><mml:math id="mml-ieqn-9"><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi></mml:mstyle><mml:mo>&#x22C5;</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>E</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>f</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></inline-formula>. In this expression, w(<inline-formula id="ieqn-10"><alternatives><inline-graphic xlink:href="ieqn-10.png"/><tex-math id="tex-ieqn-10"><![CDATA[$\mathrm{n}+ 1$]]></tex-math><mml:math id="mml-ieqn-10"><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></alternatives></inline-formula>) is the next weight coefficient of the filter, w(n) is the present weight vector, &#x2018;s&#x2019; is the step size of the adaptation, E(n) is the input brain wave which is contaminated with physiological and non-physiological artifacts, f(n) is the feedback signal. The major limitation of the conventional LMS is gradient noise amplification [<xref ref-type="bibr" rid="ref-20">20</xref>,<xref ref-type="bibr" rid="ref-21">21</xref>]. Normalized version of LMS (NLMS) achieves better convergence and enhancement [<xref ref-type="bibr" rid="ref-22">22</xref>,<xref ref-type="bibr" rid="ref-23">23</xref>]. The mathematical recursion for this technique is written as,</p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-1.png"/>
<tex-math id="tex-eqn-1"><![CDATA[$$\begin{equation}
\mathrm{w} \left(\mathrm{n}+1\right)=\mathrm{w}
 \left(\mathrm{n}\right)+\mathrm{s} \left(\mathrm{n}\right)
\mathrm{x} \left(\mathrm{n}\right)\mathrm{f} \left(\mathrm{n}\right)
 \label{eqn-1}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-1" display="block"><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>f</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>Here, the step size parameter is written as,</p>
<p><disp-formula id="eqn-2">
<label>(2)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-2.png"/>
<tex-math id="tex-eqn-2"><![CDATA[$$\begin{equation}
\mathrm{s} \left(\mathrm{n}\right)=\frac{\mathrm{s}}{\varepsilon + \left\| \mathrm{E} \left(\mathrm{n}\right)\right\| ^{2}}
 \label{eqn-2}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-2" display="block"><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x03B5;</mml:mi><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>&#x2225;</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>E</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x2225;</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math></alternatives></disp-formula></p>
<p>In the next version of NLMS we normalize the step size with the maximum value of data vector E(n). This minimizes the number of computations in the denominator of the weight update recursion.</p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-3.png"/>
<tex-math id="tex-eqn-3"><![CDATA[$$\begin{equation}
\mathrm{w} \left(\mathrm{n}+1\right)=\mathrm{w} \left(\mathrm{n}\right)+
\frac{\mathrm{s}}{\varepsilon +\max \left\| \mathrm{E} \left(\mathrm{n}\right)\right\| ^{2}}\mathrm{E} \left(\mathrm{n}\right)\mathrm{f} \left(\mathrm{n}\right)
 \label{eqn-3}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-3" display="block"><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x03B5;</mml:mi><mml:mo>+</mml:mo><mml:mo> max</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>&#x2225;</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>E</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x2225;</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mstyle mathvariant="normal"><mml:mi>E</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>f</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>In physiological signal monitoring applications during critical conditions minute errors leads ambiguity in diagnosis. During critical conditions the decision has to be make instantaneously. To avoid this, a non-linear operation is combined with LMS algorithm, which results non-linear LMS (NL<sup>2</sup>MS) and is able to eliminate the ambiguities of round-off errors [<xref ref-type="bibr" rid="ref-24">24</xref>,<xref ref-type="bibr" rid="ref-25">25</xref>]. We use this property of NL<sup>2</sup>MS in the process of artifact elimination in EEG signals. This nonlinearity is defined as,</p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-4.png"/>
<tex-math id="tex-eqn-4"><![CDATA[$$\begin{equation}
\mathrm{g}\{\mathrm{e}\}= \left\{\begin{array}{l@{\quad}l}
\mathrm{e}-\mathrm{d}, & \mathrm{e}> d> 0 \\
0, & -\mathrm{d}< e< d \\
\mathrm{e}+\mathrm{d}, & \mathrm{e}< -d \end{array}\right\}
 \label{eqn-4}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-4" display="block"><mml:mstyle mathvariant="normal"><mml:mi>g</mml:mi></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable equalrows="false" columnlines="none" equalcolumns="false"><mml:mtr><mml:mtd columnalign="left"><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mo>-</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>d</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mspace width="1em"/></mml:mtd><mml:mtd columnalign="left"><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mo>&#x003E;</mml:mo><mml:mi>d</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="1em"/></mml:mtd><mml:mtd columnalign="left"><mml:mo>-</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>d</mml:mi></mml:mstyle><mml:mo>&#x003C;</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mi>d</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>d</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mspace width="1em"/></mml:mtd><mml:mtd columnalign="left"><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mo>&#x003C;</mml:mo><mml:mo>-</mml:mo><mml:mi>d</mml:mi></mml:mtd></mml:mtr> </mml:mtable></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>where d is threshold.</p>
<p>When applied to the error signal, it converts the LMS update recursion equation to</p>
<p><disp-formula id="eqn-5">
<label>(5)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-5.png"/>
<tex-math id="tex-eqn-5"><![CDATA[$$\begin{equation}
\mathrm{w} \left(\mathrm{n}+1\right)=\mathrm{w}
 \left(\mathrm{n}\right)+\mathrm{sg}\{\mathrm{e}(\mathrm{n})\}\mathrm{x} \left(\mathrm{n}\right)
 \label{eqn-5}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-5" display="block"><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi><mml:mi>g</mml:mi></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>This is the mathematical recursion for NL<sup>2</sup>MS algorithm. To achieve better convergence and enhancement we combine this NL<sup>2</sup>MS algorithm with NLMS and results normalized non-linear LMS (N<sup>2</sup>L<sup>2</sup>MS). The mathematical expression for this algorithm is given as,</p>
<p><disp-formula id="eqn-6">
<label>(6)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-6.png"/>
<tex-math id="tex-eqn-6"><![CDATA[$$\begin{equation}
\mathrm{w} \left(\mathrm{n}+1\right)=\mathrm{w} \left(\mathrm{n}\right)+
\mathrm{s}(\mathrm{n})\mathrm{g}\{\mathrm{e}(\mathrm{n})\}\mathrm{x} \left(\mathrm{n}\right)
 \label{eqn-6}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-6" display="block"><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>g</mml:mi></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>where <inline-formula id="ieqn-11"><alternatives><inline-graphic xlink:href="ieqn-11.png"/><tex-math id="tex-ieqn-11"><![CDATA[$\mathrm{s} \left(\mathrm{n}\right)=\displaystyle\frac{\mathrm{s}}{\varepsilon + \left\| \mathrm{x} \left(\mathrm{n}\right)\right\| ^{2}}$]]></tex-math><mml:math id="mml-ieqn-11"><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x03B5;</mml:mi><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>&#x2225;</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x2225;</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math></alternatives></inline-formula></p>
<p>A generalized flow diagram for the proposed SEU for brain wave enhancement is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. As in remote patient care monitoring applications the computational complexity of the processing techniques is a key element. If the number of multiplication operations for updating the weight coefficients increases the samples at the input port increases and overlap on each other and causes information loss. To overcome this problem, the impulse response of the receiver must be increased, but minimizing the number of computational operations of signal conditioning technique is an optimum solution. So, we developed hybrid versions of adaptive algorithms by combining the N<sup>2</sup>L<sup>2</sup>MS algorithm with sign-based algorithms. The three-familiar sign-based algorithms are clipped algorithm, sign algorithm and sign sign algorithm. The hybrid versions of N<sup>2</sup>L<sup>2</sup>MS and signed algorithms are named as, clipped N<sup>2</sup>L<sup>2</sup>MS algorithm (CN<sup>2</sup>L<sup>2</sup>MS), sign N<sup>2</sup>L<sup>2</sup>MS (S N<sup>2</sup>L<sup>2</sup>MS), sign sign N<sup>2</sup>L<sup>2</sup>MS (S<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS) algorithms respectively. Again, these normalized versions of the algorithms suffer with a problem of computational complexity due to normalization. This is due to the normalization with respect to the input data vector of length &#x2018;L&#x2019;. In this operation &#x2018;L&#x2019; number of multiplications are needed. To avoid this problem further N<sup>2</sup>L<sup>2</sup>MS is modified such that in the data normalization operation, the normalization is performed with respect to the maximum data value of the input vector. These versions of the proposed algorithms are called modified N<sup>2</sup>L<sup>2</sup>MS algorithm (MN<sup>2</sup>L<sup>2</sup>MS), modified clipped N<sup>2</sup>L<sup>2</sup>MS algorithm (MCN<sup>2</sup>L<sup>2</sup>MS), modified sign N<sup>2</sup>L<sup>2</sup>MS algorithm (MS N<sup>2</sup>L<sup>2</sup>MS), modified sign N<sup>2</sup>L<sup>2</sup>MS algorithm (MS<sup>2</sup> N<sup>2</sup>L<sup>2</sup>MS) respectively.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Flow chart of adaptive artifact cancellation algorithm for EEG analysis</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-2.png"/>
</fig>
<p>The weight update recursions for modified N<sup>2</sup>L<sup>2</sup>MS algorithm is given as,</p>
<p><disp-formula id="eqn-7">
<label>(7)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-7.png"/>
<tex-math id="tex-eqn-7"><![CDATA[$$\begin{equation}
\mathrm{w} \left(\mathrm{n}+1\right)=\mathrm{w} \left(\mathrm{n}\right)+
\mathrm{ms}(\mathrm{n})\mathrm{g}\{\mathrm{e}(\mathrm{n})\}\mathrm{x} \left(\mathrm{n}\right)
 \label{eqn-7}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-7" display="block"><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>m</mml:mi><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>g</mml:mi></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>where <inline-formula id="ieqn-12"><alternatives><inline-graphic xlink:href="ieqn-12.png"/><tex-math id="tex-ieqn-12"><![CDATA[$\mathrm{ms} \left(\mathrm{n}\right)=\displaystyle\frac{\mathrm{S}}{\varepsilon +\text{x}\text{m}\text{a}\text{x}*\text{x}\text{m}\text{a}\text{x}}$]]></tex-math><mml:math id="mml-ieqn-12"><mml:mstyle mathvariant="normal"><mml:mi>m</mml:mi><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>S</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>&#x03B5;</mml:mi><mml:mo>+</mml:mo><mml:mstyle class="text"><mml:mtext>x</mml:mtext></mml:mstyle><mml:mstyle class="text"><mml:mtext>m</mml:mtext></mml:mstyle><mml:mstyle class="text"><mml:mtext>a</mml:mtext></mml:mstyle><mml:mstyle class="text"><mml:mtext>x</mml:mtext></mml:mstyle><mml:mo>*</mml:mo><mml:mstyle class="text"><mml:mtext>x</mml:mtext></mml:mstyle><mml:mstyle class="text"><mml:mtext>m</mml:mtext></mml:mstyle><mml:mstyle class="text"><mml:mtext>a</mml:mtext></mml:mstyle><mml:mstyle class="text"><mml:mtext>x</mml:mtext></mml:mstyle></mml:mrow></mml:mfrac></mml:math></alternatives></inline-formula></p>
<p>Here, ms(n) is the modified step size, which is the normalized version with respect to maximum value of data vector instead of normalization with respect to entire input data vector. This minimized computational complexity in the denominator by an amount <inline-formula id="ieqn-13"><alternatives><inline-graphic xlink:href="ieqn-13.png"/><tex-math id="tex-ieqn-13"><![CDATA[$\mathrm{L}- 1$]]></tex-math><mml:math id="mml-ieqn-13"><mml:mstyle mathvariant="normal"><mml:mi>L</mml:mi></mml:mstyle><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:math></alternatives></inline-formula>, only one multiplication is needed for this maximum data normalization. Now we propose to combining clipped algorithm with MN<sup>2</sup>L<sup>2</sup>MS algorithm we can minimize the number of computations for performing the filtering process. The theory and analysis of clipped algorithm is presented in [<xref ref-type="bibr" rid="ref-15">15</xref>]. The resultant algorithm is modified clipped N<sup>2</sup>L<sup>2</sup>MS algorithm (MCN<sup>2</sup>L<sup>2</sup>MS). Its weight update phenomenon mathematically can be written as,</p>
<p><disp-formula id="eqn-8">
<label>(8)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-8.png"/>
<tex-math id="tex-eqn-8"><![CDATA[$$\begin{equation}
\mathrm{w} \left(\mathrm{n}+1\right)=\mathrm{w}
 \left(\mathrm{n}\right)+\mathrm{ms}(\mathrm{n})\mathrm{g}\{\mathrm{e}
(\mathrm{n})\}\mathrm{sgn}\{\mathrm{x} \left(\mathrm{n}\right)\}
 \label{eqn-8}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-8" display="block"><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>m</mml:mi><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>g</mml:mi></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>where <inline-formula id="ieqn-14"><alternatives><inline-graphic xlink:href="ieqn-14.png"/><tex-math id="tex-ieqn-14"><![CDATA[$\mathrm{sgn}\{ \}$]]></tex-math><mml:math id="mml-ieqn-14"><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> is a clipping function and is represented as follows,</p>
<p><disp-formula id="eqn-9">
<label>(9)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-9.png"/>
<tex-math id="tex-eqn-9"><![CDATA[$$\begin{equation}
\mathrm{Sgn} \left\{\mathrm{x} \left(\mathrm{n}\right)\right\}= \left\{\begin{array}{l@{\quad}l}1\colon & \mathrm{x} \left(\mathrm{n}\right)> 0 \\
0\colon & \mathrm{x} \left(\mathrm{n}\right)=0 \\
-1\colon & \mathrm{x} \left(\mathrm{n}\right)< 0 \end{array}\right\}
 \label{eqn-9}
\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-9" display="block"><mml:mstyle mathvariant="normal"><mml:mi>S</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable equalrows="false" columnlines="none" equalcolumns="false"><mml:mtr><mml:mtd columnalign="left"><mml:mn>1</mml:mn><mml:mo>:</mml:mo><mml:mspace width="1em"/></mml:mtd><mml:mtd columnalign="left"><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mn>0</mml:mn><mml:mo>:</mml:mo><mml:mspace width="1em"/></mml:mtd><mml:mtd columnalign="left"><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo>:</mml:mo><mml:mspace width="1em"/></mml:mtd><mml:mtd columnalign="left"><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr> </mml:mtable></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></alternatives></disp-formula></p>
<p>Similarly, by combining Sign LMS (SLMS) and Sign Sign LMS (SSLMS) with MN<sup>2</sup>L<sup>2</sup>MS results MSN<sup>2</sup>L<sup>2</sup>MS and MS<sup>2</sup> N<sup>2</sup>L<sup>2</sup>MS algorithms respectively. The weight update mechanism for these techniques can be written as,</p>
<p><disp-formula id="eqn-10">
<label>(10)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-10.png"/>
<tex-math id="tex-eqn-10"><![CDATA[$$\begin{equation}\mathrm{w} \left(\mathrm{n}+1\right)=\mathrm{w} \left(\mathrm{n}\right)+\mathrm{ms}
(\mathrm{n})\mathrm{sgn}\{\mathrm{g}[\mathrm{e} \left(\mathrm{n}\right)]\}\mathrm{x}
 \left(\mathrm{n}\right)
 \label{eqn-10} \end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-10" display="block"><mml:mrow></mml:mrow><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>m</mml:mi><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>s</mml:mi><mml:mi>g</mml:mi><mml:mi>n</mml:mi></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>g</mml:mi></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow></mml:mrow></mml:math>
</alternatives></disp-formula></p>
<p><disp-formula id="eqn-11">
<label>(11)</label>
<alternatives>
<graphic mimetype="image" mime-subtype="png" xlink:href="eqn-11.png"/>
<tex-math id="tex-eqn-11"><![CDATA[$$\begin{equation}\mathrm{w} \left(\mathrm{n}+1\right)=\mathrm{w} \left(\mathrm{n}\right)+\mathrm{ms} \left(\mathrm{n}\right)\text{ sgn} \left\{\mathrm{g} \left[\mathrm{e} \left(\mathrm{n}\right)\right]\right\}\text{ sgn}\{\mathrm{x} \left(\mathrm{n}\right)\}
 \label{eqn-11}\end{equation}$$]]></tex-math>
<mml:math id="mml-eqn-11" display="block"><mml:mrow></mml:mrow><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>m</mml:mi><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mstyle><mml:mtext>&#x00A0;sgn</mml:mtext></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>g</mml:mi></mml:mstyle><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mstyle><mml:mtext>&#x00A0;sgn</mml:mtext></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>x</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow></mml:mrow></mml:math>
</alternatives></disp-formula></p>
<p>Therefore, using these algorithms, namely, N<sup>2</sup>L<sup>2</sup>MS, MN<sup>2</sup>L<sup>2</sup>MS, MCN<sup>2</sup>L<sup>2</sup>MS, MSN<sup>2</sup>L<sup>2</sup>MS and MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS we develop various signal enhancement units. The convergence curves for LMS algorithm and its signed algorithms versions are shown <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. These illustrations are plotted between MSE and iteration number. MSE is calculated using the relation, i.e., <inline-formula id="ieqn-15"><alternatives><inline-graphic xlink:href="ieqn-15.png"/><tex-math id="tex-ieqn-15"><![CDATA[$\xi =\mathrm{E}\{|\mathrm{e} \left(\mathrm{n}\right)|^{2}\}$]]></tex-math><mml:math id="mml-ieqn-15"><mml:mi>&#x03BE;</mml:mi><mml:mo>=</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>E</mml:mi></mml:mstyle><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>n</mml:mi></mml:mstyle></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></alternatives></inline-formula> [<xref ref-type="bibr" rid="ref-21">21</xref>]. These curves are obtained during the Gaussian noise removal process to test the feasibility of adaptive algorithms in the adaptation process. From <xref ref-type="fig" rid="fig-3">Fig. 3</xref> among the algorithms LMS outperforms, but the convergence characteristics of CLMS is just inferior than LMS. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> confirms that maximum normalization strategy improves the convergence performance of the algorithms. In this case, also the clipped version of MN<sup>2</sup>L<sup>2</sup>MS is just inferior than MN<sup>2</sup>L<sup>2</sup>MS.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Convergence analysis curves for LMS and its signum variants</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-3.png"/>
</fig>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Convergence characteristics of N<sup>2</sup>L<sup>2</sup>MS and its hybrid versions</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-4.png"/>
</fig>
<p>The computational complexity of the above-mentioned enhancement techniques is shown in <xref ref-type="table" rid="table-1">Tab. 1</xref>. In signal processing circuits, the signum based techniques require a smaller number of multiplications than their counterparts because of clipping operations. So, we have used these signum based hybrid versions in our realizations to minimize the computational burden of the proposed SEU. Among the three sign-based algorithms MCN<sup>2</sup>L<sup>2</sup>MS, MSN<sup>2</sup>L<sup>2</sup>MS and MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS, MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS has less computational complexity. But as the data vector and error component are undergoing clipping results in the much quantity of information will be missed in the signal enhancement operation. Hence, the filtering ability of the technique is poor. This is also evident form the filtering ability presented in the next section. The MN<sup>2</sup>L<sup>2</sup>MS has the complexity in terms of multiplications equal to MSN<sup>2</sup>L<sup>2</sup>MS, but due to error clipping its resolution is inferior than MN<sup>2</sup>L<sup>2</sup>MS. So, MSN<sup>2</sup>L<sup>2</sup>MS is also not a good candidate for artifact elimination process. Whereas, in MCN<sup>2</sup>L<sup>2</sup>MS the data vector is clipped and its computational complexity is nearly equal to conventional LMS in terms of multiplications with increased convergence characteristics. Also, the number of multiplications required in the second part of the weight update recursion is independent of filter length. Therefore, based on the analysis of various algorithms in terms of convergence characteristics and number of multiplications, the MCN<sup>2</sup>L<sup>2</sup>MS is seems to be a better candidate for brain wave analysis in wireless EEG monitoring devices as well as in remote health care monitoring systems.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Complexity of various adaptive algorithms for artifact elimination in brain waves</title>
</caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>S.No.</th>
<th>Algorithm</th>
<th>Multiplications</th>
<th>Additions</th>
<th>ASC</th>
<th>Divisions</th>
</tr>
</thead>
<tbody>
<tr>
<td>1.</td>
<td>LMS</td>
<td><inline-formula id="ieqn-16"><alternatives><inline-graphic xlink:href="ieqn-16.png"/><tex-math id="tex-ieqn-16"><![CDATA[$\mathrm{L}+1$]]></tex-math><mml:math id="mml-ieqn-16"><mml:mstyle mathvariant="normal"><mml:mi>L</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></alternatives></inline-formula></td>
<td><inline-formula id="ieqn-17"><alternatives><inline-graphic xlink:href="ieqn-17.png"/><tex-math id="tex-ieqn-17"><![CDATA[$\mathrm{L}+1$]]></tex-math><mml:math id="mml-ieqn-17"><mml:mstyle mathvariant="normal"><mml:mi>L</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></alternatives></inline-formula></td>
<td>Nil</td>
<td>Nil</td>
</tr>
<tr>
<td>2.</td>
<td>N<sup>2</sup>L<sup>2</sup>MS</td>
<td><inline-formula id="ieqn-18"><alternatives><inline-graphic xlink:href="ieqn-18.png"/><tex-math id="tex-ieqn-18"><![CDATA[$\mathrm{2L}+1$]]></tex-math><mml:math id="mml-ieqn-18"><mml:mstyle mathvariant="normal"><mml:mn>2</mml:mn><mml:mi>L</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></alternatives></inline-formula></td>
<td><inline-formula id="ieqn-19"><alternatives><inline-graphic xlink:href="ieqn-19.png"/><tex-math id="tex-ieqn-19"><![CDATA[$\mathrm{2L}+1$]]></tex-math><mml:math id="mml-ieqn-19"><mml:mstyle mathvariant="normal"><mml:mn>2</mml:mn><mml:mi>L</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></alternatives></inline-formula></td>
<td>Nil</td>
<td>1</td>
</tr>
<tr>
<td>3.</td>
<td>MN<sup>2</sup>L<sup>2</sup>MS</td>
<td><inline-formula id="ieqn-20"><alternatives><inline-graphic xlink:href="ieqn-20.png"/><tex-math id="tex-ieqn-20"><![CDATA[$\mathrm{L}+2$]]></tex-math><mml:math id="mml-ieqn-20"><mml:mstyle mathvariant="normal"><mml:mi>L</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>2</mml:mn></mml:math></alternatives></inline-formula></td>
<td><inline-formula id="ieqn-21"><alternatives><inline-graphic xlink:href="ieqn-21.png"/><tex-math id="tex-ieqn-21"><![CDATA[$\mathrm{L}+1$]]></tex-math><mml:math id="mml-ieqn-21"><mml:mstyle mathvariant="normal"><mml:mi>L</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></alternatives></inline-formula></td>
<td>Nil</td>
<td>1</td>
</tr>
<tr>
<td>4.</td>
<td>MCN<sup>2</sup>L<sup>2</sup>MS</td>
<td>2</td>
<td><inline-formula id="ieqn-22"><alternatives><inline-graphic xlink:href="ieqn-22.png"/><tex-math id="tex-ieqn-22"><![CDATA[$\mathrm{L}+1$]]></tex-math><mml:math id="mml-ieqn-22"><mml:mstyle mathvariant="normal"><mml:mi>L</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></alternatives></inline-formula></td>
<td>Nil</td>
<td>1</td>
</tr>
<tr>
<td>5.</td>
<td>MSN<sup>2</sup>L<sup>2</sup>MS</td>
<td><inline-formula id="ieqn-23"><alternatives><inline-graphic xlink:href="ieqn-23.png"/><tex-math id="tex-ieqn-23"><![CDATA[$\mathrm{L}+2$]]></tex-math><mml:math id="mml-ieqn-23"><mml:mstyle mathvariant="normal"><mml:mi>L</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>2</mml:mn></mml:math></alternatives></inline-formula></td>
<td><inline-formula id="ieqn-24"><alternatives><inline-graphic xlink:href="ieqn-24.png"/><tex-math id="tex-ieqn-24"><![CDATA[$\mathrm{L}+1$]]></tex-math><mml:math id="mml-ieqn-24"><mml:mstyle mathvariant="normal"><mml:mi>L</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></alternatives></inline-formula></td>
<td>Nil</td>
<td>1</td>
</tr>
<tr>
<td>6.</td>
<td>MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS</td>
<td>Nil</td>
<td>Nil</td>
<td><inline-formula id="ieqn-25"><alternatives><inline-graphic xlink:href="ieqn-25.png"/><tex-math id="tex-ieqn-25"><![CDATA[$\mathrm{L}+1$]]></tex-math><mml:math id="mml-ieqn-25"><mml:mstyle mathvariant="normal"><mml:mi>L</mml:mi></mml:mstyle><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></alternatives></inline-formula></td>
<td>1</td>
</tr>
</tbody>
</table></table-wrap>
</sec>
<sec id="s3">
<label>3</label>
<title>Experimental Results and Analysis</title>
<p>To demonstrate the ability of the signal enhancement scheme in health care monitoring contest we have recorded several brain waves in various physiological scenarios using the Emotive EPOC brain wave acquisition headset [<xref ref-type="bibr" rid="ref-24">24</xref>]. These electrodes are arranged according to a grid as per the international 10&#x2013;20 system, these are designated as per the method presented in [<xref ref-type="bibr" rid="ref-25">25</xref>]. By utilizing brain computer interface method, we collected brain waves from 5 different subjects with both physiological and non-physiological artifacts. The EPOC acquisition system samples the channels at a rate of 128 PPS, all these pulses are in the 4-byte floating-point format corresponding to the bio-potential for individual electrode. In these experiments, we have collected 10,000 samples of EEG signal from the subject. To facilitate a high-resolution signal, we have shown 1000 samples of the brain data. The performance of various SEUs in the process of signal conditioning is measured in terms of signal to noise ratio improvement (SNRI), excess mean square error (EMSE), misadjustment (MSD) and correlation. The SNRI is defined as the difference in the signal to noise ratio before the operation of artifact removal and after the operation of artifact removal. It is the excess amount of the error than the minimum mean square error of the adaptive process. Whereas minimum mean square error is the minimum amount of error obtained by an optimum filter. It is a dominant parameter to compare different adaptive algorithms. Correlation is the similarity between the filtering signal and a clean signal without any artifacts. These performance measures are measured in ten experiments on individual data and averaged. These results are shown in <xref ref-type="table" rid="table-2">Tabs. 2</xref> and <xref ref-type="table" rid="table-3">3</xref>. Also, these performance measures are illustrated in <xref ref-type="fig" rid="fig-9">Figs. 9</xref>&#x2013;<xref ref-type="fig" rid="fig-12">12</xref>. A Gaussian noise with 0.01 variances from the mean of the brain wave data is added to resemble channel noise in a wireless EEG system, the step size parameter is taken as 0.01. In our work, we used five diversified samples of brain data, the data set consists of five samples namely, EEG1, EEG2, EEG3, EEG4 and EEG5 to obtain consistent results from SEUs. To perform experiments using the recorded data, we developed various SEUs using LMS, N<sup>2</sup>L<sup>2</sup>MS, MN<sup>2</sup>L<sup>2</sup>MS, MCN<sup>2</sup>L<sup>2</sup>MS, MSN<sup>2</sup>L<sup>2</sup>MS, MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS algorithms. A typical noise generator is used in the experiments to facilitate reference signal to the signal enhancement unit. The filter length is chosen as 5. As the filter length increases the filtering process will be accelerated but excess mean square error also increases. This in turn decreases the signal to noise ratio. So, we have chosen filter length as 5. The experimental findings of artifact elimination are described case by case in the following sub-sections.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Performance measures in terms of SNRI for signal enhancement process (in dBs)</title>
</caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Artifacttype</th>
<th>Sample No.</th>
<th colspan="6">SNRI due to various signal enhancement techniques</th>
</tr>
<tr>
<th></th>
<th></th>
<th>LMS</th>
<th>N<sup>2</sup>L<sup>2</sup>MS</th>
<th>MN<sup>2</sup>L<sup>2</sup>MS</th>
<th>MCN<sup>2</sup>L<sup>2</sup>MS</th>
<th>MSN<sup>2</sup>L<sup>2</sup>MS</th>
<th>MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS</th>
</tr>
</thead>
<tbody>
<tr>
<td>RA</td>
<td>EEG1</td>
<td>7.8476</td>
<td>16.3562</td>
<td>15.7870</td>
<td>14.6734</td>
<td>12.7342</td>
<td>10.6472</td>
</tr>
<tr>
<td/>
<td>EEG2</td>
<td>7.2387</td>
<td>16.2794</td>
<td>15.5632</td>
<td>14.1979</td>
<td>12. 0637</td>
<td>10. 6422</td>
</tr>
<tr>
<td/>
<td>EEG3</td>
<td>7.1343</td>
<td>16.1133</td>
<td>15.3254</td>
<td>14.0256</td>
<td>12. 0364</td>
<td>10. 6241</td>
</tr>
<tr>
<td/>
<td>EEG4</td>
<td>7.5372</td>
<td>16.3511</td>
<td>15.6334</td>
<td>14.6232</td>
<td>12. 6523</td>
<td>10. 6456</td>
</tr>
<tr>
<td/>
<td>EEG5</td>
<td>7.9362</td>
<td>16.7231</td>
<td>15.9343</td>
<td>14.9454</td>
<td>12. 9342</td>
<td>10. 7643</td>
</tr>
<tr>
<td/>
<td><bold>Average</bold></td>
<td><bold>7.5388</bold></td>
<td><bold>16.3646</bold></td>
<td><bold>15.6487</bold></td>
<td><bold>14.4931</bold></td>
<td><bold>12.7342</bold></td>
<td><bold>10.6472</bold></td>
</tr>
<tr>
<td>EMG</td>
<td>EEG1</td>
<td>6.2187</td>
<td>15.9572</td>
<td>13.9448</td>
<td>12.8732</td>
<td>10.9245</td>
<td>8.8421</td>
</tr>
<tr>
<td/>
<td>EEG2</td>
<td>6.3654</td>
<td>15.7810</td>
<td>13.8437</td>
<td>12.5742</td>
<td>10.8920</td>
<td>8.6433</td>
</tr>
<tr>
<td/>
<td>EEG3</td>
<td>6.7382</td>
<td>15.5631</td>
<td>13.5351</td>
<td>12.4265</td>
<td>10.6342</td>
<td>8.4531</td>
</tr>
<tr>
<td/>
<td>EEG4</td>
<td>6.8365</td>
<td>15.5372</td>
<td>13.4523</td>
<td>12.3721</td>
<td>10.2755</td>
<td>8.1791</td>
</tr>
<tr>
<td/>
<td>EEG5</td>
<td>6.8436</td>
<td>15.0863</td>
<td>13.4437</td>
<td>12.0728</td>
<td>10.0264</td>
<td>8.1257</td>
</tr>
<tr>
<td/>
<td><bold>Average</bold></td>
<td><bold>6.6005</bold></td>
<td><bold>15.5850</bold></td>
<td><bold>13.6439</bold></td>
<td><bold>12.4638</bold></td>
<td><bold>10.5505</bold></td>
<td><bold>8.4487</bold></td>
</tr>
<tr>
<td>CSA</td>
<td>EEG1</td>
<td>4.9953</td>
<td>13.9872</td>
<td>12.9196</td>
<td>10.9257</td>
<td>9.8647</td>
<td>7.7742</td>
</tr>
<tr>
<td/>
<td>EEG2</td>
<td>4.9643</td>
<td>13.7995</td>
<td>12.8743</td>
<td>10.8430</td>
<td>9.8270</td>
<td>7.5631</td>
</tr>
<tr>
<td/>
<td>EEG3</td>
<td>4.5218</td>
<td>13.7436</td>
<td>12.6319</td>
<td>10.7341</td>
<td>9.6036</td>
<td>7.4972</td>
</tr>
<tr>
<td/>
<td>EEG4</td>
<td>4.3142</td>
<td>13.2432</td>
<td>12.5871</td>
<td>10.5631</td>
<td>9.5542</td>
<td>7.3268</td>
</tr>
<tr>
<td/>
<td>EEG5</td>
<td>4.0402</td>
<td>13.1151</td>
<td>12.4537</td>
<td>10.1547</td>
<td>9.0564</td>
<td>7.0146</td>
</tr>
<tr>
<td/>
<td><bold>Average</bold></td>
<td><bold>4.5672</bold></td>
<td><bold>13.5777</bold></td>
<td><bold>12.6933</bold></td>
<td><bold>10.6441</bold></td>
<td><bold>9.5812</bold></td>
<td><bold>7.4352</bold></td>
</tr>
<tr>
<td>EBA</td>
<td>EEG1</td>
<td>8.7531</td>
<td>18.7536</td>
<td>16.9114</td>
<td>15.7790</td>
<td>14.8749</td>
<td>11.8321</td>
</tr>
<tr>
<td/>
<td>EEG2</td>
<td>8.6563</td>
<td>18.7091</td>
<td>16.8542</td>
<td>15.6972</td>
<td>14.5967</td>
<td>11.7127</td>
</tr>
<tr>
<td/>
<td>EEG3</td>
<td>8.5546</td>
<td>18.5896</td>
<td>16.5826</td>
<td>15.5411</td>
<td>14.5163</td>
<td>11.5937</td>
</tr>
<tr>
<td/>
<td>EEG4</td>
<td>8.2761</td>
<td>18.4342</td>
<td>16.2745</td>
<td>15.3380</td>
<td>14.3164</td>
<td>11.4741</td>
</tr>
<tr>
<td/>
<td>EEG5</td>
<td>8.1598</td>
<td>18.3592</td>
<td>16.2531</td>
<td>15.1917</td>
<td>14.2364</td>
<td>11.1414</td>
</tr>
<tr>
<td/>
<td><bold>Average</bold></td>
<td><bold>8.4800</bold></td>
<td><bold>18.5691</bold></td>
<td><bold>16.5752</bold></td>
<td><bold>15.5094</bold></td>
<td><bold>14.5081</bold></td>
<td><bold>11.5508</bold></td>
</tr>
</tbody>
</table></table-wrap>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Performance measures in terms of EMSE [dBs], MSD [dimension less] and CHO [dimension less] for signal enhancement process</title>
</caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Noise</th>
<th>Measure</th>
<th>LMS</th>
<th>N<sup>2</sup>L<sup>2</sup>MS</th>
<th>MN<sup>2</sup>L<sup>2</sup>MS</th>
<th>MCN<sup>2</sup>L<sup>2</sup>MS</th>
<th>MSN<sup>2</sup>L<sup>2</sup>MS</th>
<th>MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS</th>
</tr>
</thead>
<tbody>
<tr>
<td>RA</td>
<td>Excess MSE</td>
<td>&#x2212;17.7383</td>
<td>&#x2212;36.8376</td>
<td>&#x2212;34.6194</td>
<td>&#x2212;32.5537</td>
<td>&#x2212;30.0053</td>
<td>&#x2212;27.9637</td>
</tr>
<tr>
<td/>
<td>Misadjustment</td>
<td>0.1868</td>
<td>0.08649</td>
<td>0.0975</td>
<td>0.1063</td>
<td>0.1366</td>
<td>0.1649</td>
</tr>
<tr>
<td/>
<td>Coherence</td>
<td>0.5687</td>
<td>0.9694</td>
<td>0.9248</td>
<td>0.8785</td>
<td>0.6003</td>
<td>0.5951</td>
</tr>
<tr>
<td>EMG</td>
<td>Excess MSE</td>
<td>&#x2212;16.5456</td>
<td>&#x2212;32.5791</td>
<td>&#x2212;30.1873</td>
<td>&#x2212;29.3341</td>
<td>&#x2212;28.8792</td>
<td>&#x2212;26.6649</td>
</tr>
<tr>
<td/>
<td>Misadjustment</td>
<td>0.7456</td>
<td>0.1137</td>
<td>0.2434</td>
<td>0.3438</td>
<td>0.4582</td>
<td>0.5342</td>
</tr>
<tr>
<td/>
<td>Coherence</td>
<td>0.4562</td>
<td>0.8872</td>
<td>0.8464</td>
<td>0.7982</td>
<td>0.5478</td>
<td>0.4864</td>
</tr>
<tr>
<td>CSA</td>
<td>Excess MSE</td>
<td>&#x2212;15.3754</td>
<td>&#x2212;29.5742</td>
<td>&#x2212;27.8467</td>
<td>&#x2212;26.7591</td>
<td>&#x2212;25.7539</td>
<td>&#x2212;23.1586</td>
</tr>
<tr>
<td/>
<td>Misadjustment</td>
<td>0.8945</td>
<td>0.1554</td>
<td>0.3564</td>
<td>0.4627</td>
<td>0.5225</td>
<td>0.6847</td>
</tr>
<tr>
<td/>
<td>Coherence</td>
<td>0.5478</td>
<td>0.8295</td>
<td>0.7946</td>
<td>0.7727</td>
<td>0.6651</td>
<td>0.5975</td>
</tr>
<tr>
<td>EBA</td>
<td>Excess MSE</td>
<td>&#x2212;18.4268</td>
<td>&#x2212;39.3572</td>
<td>&#x2212;37.8524</td>
<td>&#x2212;35.1866</td>
<td>&#x2212;32.7841</td>
<td>&#x2212;30.1379</td>
</tr>
<tr>
<td/>
<td>Misadjustment</td>
<td>0.6196</td>
<td>0.1452</td>
<td>0.2392</td>
<td>0.3315</td>
<td>0.4287</td>
<td>0.5205</td>
</tr>
<tr>
<td/>
<td>Coherence</td>
<td>0.6573</td>
<td>0.9349</td>
<td>0.8974</td>
<td>0.8659</td>
<td>0.7579</td>
<td>0.6876</td>
</tr>
</tbody>
</table></table-wrap>
<sec id="s3_1">
<label>3.1</label>
<title>Adaptive Artifact Elimination of Respiration Artifacts (RA) From EEG Signals</title>
<p>This experiment proves the RA elimination process from EEG component. The raw brain wave component is taken as input to the SEU as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, this input component is a combination of actual brain action potential and non-physiological noise contamination, it is designated as <inline-formula id="ieqn-26"><alternatives><inline-graphic xlink:href="ieqn-26.png"/><tex-math id="tex-ieqn-26"><![CDATA[${\boldsymbol{e}}_{\mathbf{1}}+{\boldsymbol{a}}_{\mathbf{1}}$]]></tex-math><mml:math id="mml-ieqn-26"><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mn>1</mml:mn></mml:mstyle></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mn>1</mml:mn></mml:mstyle></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The reference signal given to the adaptive FIR filter is <inline-formula id="ieqn-27"><alternatives><inline-graphic xlink:href="ieqn-27.png"/><tex-math id="tex-ieqn-27"><![CDATA[${\boldsymbol{a}}_{\mathbf{2}}$]]></tex-math><mml:math id="mml-ieqn-27"><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mn>2</mml:mn></mml:mstyle></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The adaptive algorithm trains the FIR filter coefficients, such that <inline-formula id="ieqn-28"><alternatives><inline-graphic xlink:href="ieqn-28.png"/><tex-math id="tex-ieqn-28"><![CDATA[${\boldsymbol{a}}_{\mathbf{2}}$]]></tex-math><mml:math id="mml-ieqn-28"><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mn>2</mml:mn></mml:mstyle></mml:mrow></mml:msub></mml:math></alternatives></inline-formula> becomes closer to <inline-formula id="ieqn-29"><alternatives><inline-graphic xlink:href="ieqn-29.png"/><tex-math id="tex-ieqn-29"><![CDATA[${\boldsymbol{a}}_{\mathbf{1}}$]]></tex-math><mml:math id="mml-ieqn-29"><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mstyle mathvariant="bold"><mml:mn>1</mml:mn></mml:mstyle></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The experimental results after artifact elimination is shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. From this figure, it is depicted that <xref ref-type="fig" rid="fig-5">Figs. 5e</xref> and <xref ref-type="fig" rid="fig-5">5f</xref> are showing high-resolution brain wave components than other subplots. These are results are obtained due to SEUs based on N<sup>2</sup>L<sup>2</sup>MS and its signum based variants. Again, by examine the performance measures in terms of convergence rate, SNR, excess mean square error, misadjustment, among the various algorithms N<sup>2</sup>L<sup>2</sup>MS based SEU achieves highest performance measures. But, among all the algorithms MCN<sup>2</sup>L<sup>2</sup>MS based SEU requires less amount of computational complexity in terms of multiplications by an amount of filter length, in this case it is &#x2018;L&#x2019;, shown in <xref ref-type="table" rid="table-1">Tab. 1</xref>. However, in terms of other performance measures MCN<sup>2</sup>L<sup>2</sup>MS is little bit inferior than N<sup>2</sup>L<sup>2</sup>MS algorithm based SEU. This fact is depicted by examine <xref ref-type="fig" rid="fig-5">Fig. 5</xref>, <xref ref-type="table" rid="table-2">Tabs. 2</xref> and <xref ref-type="table" rid="table-3">3</xref>. Therefore, as a tradeoff the little bit inferior performance of MCN<sup>2</sup>L<sup>2</sup>MS based SEU could be tolerated than SEU based on N<sup>2</sup>L<sup>2</sup>MS, as MCN<sup>2</sup>L<sup>2</sup>MS needs lesser number of multiplications by an amount &#x2018;L&#x2019;, which is filter length in this case. Hence, MCN<sup>2</sup>L<sup>2</sup>MS based SEU is suitable for elimination of artifacts from brain waves for EEG analysis in remote health care monitoring applications.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Adaptive artifact cancellation of RA from EEG signals: (a) noisy raw EEG component, (b) sample of RA component, (c) output from LMS based SEU, (d) output from N<sup>2</sup>L<sup>2</sup>MS based SEU, (e) output from MN<sup>2</sup>L<sup>2</sup>MS based SEU, (f) output from MCN<sup>2</sup>L<sup>2</sup>MS based SEU, (g) output from MSN<sup>2</sup>L<sup>2</sup>MS based SEU, (h) output from MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS based SEU (data values are shown on x-axis; signal amplitudes are shown on y-axis signal)</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-5.png"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Adaptive Artifact Elimination of Electro-Myo-Gram (EMG) and EEG Signals</title>
<p>This experiment proves the respiration artifact elimination process from EEG signal. The raw brain wave component is taken as input to the SEU as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, this input component is a combination of actual brain action potential and non-physiological noise contamination, it is designated as <inline-formula id="ieqn-30"><alternatives><inline-graphic xlink:href="ieqn-30.png"/><tex-math id="tex-ieqn-30"><![CDATA[$\mathrm{e}_{1}+\mathrm{a}_{1}$]]></tex-math><mml:math id="mml-ieqn-30"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The reference signal given to the adaptive FIR filter is <inline-formula id="ieqn-31"><alternatives><inline-graphic xlink:href="ieqn-31.png"/><tex-math id="tex-ieqn-31"><![CDATA[$\mathrm{a}_{2}$]]></tex-math><mml:math id="mml-ieqn-31"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The adaptive algorithm trains the FIR filter coefficients, such that <inline-formula id="ieqn-32"><alternatives><inline-graphic xlink:href="ieqn-32.png"/><tex-math id="tex-ieqn-32"><![CDATA[$\mathrm{a}_{2}$]]></tex-math><mml:math id="mml-ieqn-32"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula> becomes closer to <inline-formula id="ieqn-33"><alternatives><inline-graphic xlink:href="ieqn-33.png"/><tex-math id="tex-ieqn-33"><![CDATA[$\mathrm{a}_{1}$]]></tex-math><mml:math id="mml-ieqn-33"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The experimental results after artifact elimination is shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. From this figure, it is depicted that <xref ref-type="fig" rid="fig-6">Figs. 6e</xref> and <xref ref-type="fig" rid="fig-6">6f</xref> are showing high-resolution brain wave components than other subplots. These are results are obtained due to SEUs based on N<sup>2</sup>L<sup>2</sup>MS and its variants. Again, by examine the performance measures in terms of convergence rate, SNR, excess mean square error, misadjustment, among the various algorithms N<sup>2</sup>L<sup>2</sup>MS based SEU achieves highest performance measures. But, among all the algorithms MCN<sup>2</sup>L<sup>2</sup>MS based SEU requires less amount of computational complexity in terms of multiplications by an amount of filter length, in this case it is &#x2018;L&#x2019;, shown in <xref ref-type="table" rid="table-1">Tab. 1</xref>. However, in terms of other performance measures MCN<sup>2</sup>L<sup>2</sup>MS is little bit inferior than N2L2MS algorithm based SEU. This fact is depicted by examine <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, <xref ref-type="table" rid="table-2">Tabs. 2</xref> and <xref ref-type="table" rid="table-3">3</xref>. Therefore, as a tradeoff the little bit inferior performance of MCN<sup>2</sup>L<sup>2</sup>MS based SEU could be tolerated than SEU based on N<sup>2</sup>L<sup>2</sup>MS, as MCN<sup>2</sup>L<sup>2</sup>MS needs lesser number of multiplications by an amount &#x2018;L&#x2019;, which is filter length in this case. Hence, MCN<sup>2</sup>L<sup>2</sup>MS based SEU is suitable for elimination of artifacts from brain waves for EEG analysis in remote health care monitoring applications.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Adaptive artifact cancellation of EMG from EEG signals: (a) noisy raw EEG component, (b) sample of EMG component, (c) output from LMS based SEU, (d) output from N<sup>2</sup>L<sup>2</sup>MS based SEU, (e) output from MN<sup>2</sup>L<sup>2</sup>MS based SEU, (f) output from MCN<sup>2</sup>L<sup>2</sup>MS based SEU, (g) output from MSN<sup>2</sup>L<sup>2</sup>MS based SEU, (h) output from MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS based SEU (data values are shown on x-axis; signal amplitudes are shown on y-axis signal)</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-6.png"/>
</fig>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Adaptive Artifact Elimination of Cardiac Signal Artifact (CSA) and EEG Signals</title>
<p>This experiment proves the cardiac signa artifact elimination process from EEG component. The raw brain wave component is taken as input to the SEU as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, this input component is a combination of actual brain action potential and non-physiological noise contamination, it is designated as <inline-formula id="ieqn-34"><alternatives><inline-graphic xlink:href="ieqn-34.png"/><tex-math id="tex-ieqn-34"><![CDATA[$\mathrm{e}_{1}+\mathrm{a}_{1}$]]></tex-math><mml:math id="mml-ieqn-34"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The reference signal given to the adaptive FIR filter is <inline-formula id="ieqn-35"><alternatives><inline-graphic xlink:href="ieqn-35.png"/><tex-math id="tex-ieqn-35"><![CDATA[$\mathrm{a}_{2}$]]></tex-math><mml:math id="mml-ieqn-35"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The adaptive algorithm trains the FIR filter coefficients, such that <inline-formula id="ieqn-36"><alternatives><inline-graphic xlink:href="ieqn-36.png"/><tex-math id="tex-ieqn-36"><![CDATA[$\mathrm{a}_{2}$]]></tex-math><mml:math id="mml-ieqn-36"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula> becomes closer to <inline-formula id="ieqn-37"><alternatives><inline-graphic xlink:href="ieqn-37.png"/><tex-math id="tex-ieqn-37"><![CDATA[$\mathrm{a}_{1}$]]></tex-math><mml:math id="mml-ieqn-37"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The experimental results after artifact elimination is shown in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. From this figure, it is depicted that <xref ref-type="fig" rid="fig-7">Figs. 7e</xref> and <xref ref-type="fig" rid="fig-7">7f</xref> are showing high-resolution brain wave components than other sub plots. These are results are obtained due to SEUs based on N<sup>2</sup>L<sup>2</sup>MS and MCN<sup>2</sup>L<sup>2</sup>MS algorithms. Again, by examine the performance measures in terms of convergence rate, SNR, excess mean square error, misadjustment, among the various algorithms N<sup>2</sup>L<sup>2</sup>MS based SEU achieves highest performance measures. But, among all the algorithms MC N<sup>2</sup>L<sup>2</sup>MS based SEU requires less amount of computational complexity in terms of multiplications by an amount of filter length, in this case it is &#x2018;L&#x2019;, shown in <xref ref-type="table" rid="table-1">Tab. 1</xref>. However, in terms of other performance measures MCN<sup>2</sup>L<sup>2</sup>MS is little bit inferior than N<sup>2</sup>L<sup>2</sup>MS algorithm based SEU. This fact is depicted by examine <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, <xref ref-type="table" rid="table-2">Tabs. 2</xref> and <xref ref-type="table" rid="table-3">3</xref>. Therefore, as a tradeoff the little bit inferior performance of MCN<sup>2</sup>L<sup>2</sup>MS based SEU could be tolerated than SEU based on N<sup>2</sup>L<sup>2</sup>MS, as MCN<sup>2</sup>L<sup>2</sup>MS needs lesser number of multiplications by an amount &#x2018;L&#x2019;, which is filter length in this case. Hence, MC N<sup>2</sup>L<sup>2</sup>MS based SEU is suitable for elimination of artifacts from brain waves for EEG analysis in remote health care monitoring applications.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Adaptive artifact cancellation of CSA from EEG signals: (a) noisy raw EEG component, (b) sample of CSA component, (c) output from LMS based SEU, (d) output from N<sup>2</sup>L<sup>2</sup>MS based SEU, (e) output from MN<sup>2</sup>L<sup>2</sup>MS based SEU, (f) output from MCN<sup>2</sup>L<sup>2</sup>MS based SEU, (g) output from MSN<sup>2</sup>L<sup>2</sup>MS based SEU, (h) output from MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS based SEU (data values are shown on x-axis; signal amplitudes are shown on y-axis signal)</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-7.png"/>
</fig>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Adaptive Artifact Elimination of Eye Blink Artifact (EBA) from Brain Waves</title>
<p>This experiment proves the EBA elimination process from brain wave component. The raw brain wave component is taken as input to the SEU as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, this input component is a combination of actual brain action potential and non-physiological noise contamination, it is designated as <inline-formula id="ieqn-38"><alternatives><inline-graphic xlink:href="ieqn-38.png"/><tex-math id="tex-ieqn-38"><![CDATA[$\mathrm{e}_{1}+\mathrm{a}_{1}$]]></tex-math><mml:math id="mml-ieqn-38"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>e</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The reference signal given to the adaptive FIR filter is <inline-formula id="ieqn-39"><alternatives><inline-graphic xlink:href="ieqn-39.png"/><tex-math id="tex-ieqn-39"><![CDATA[$\mathrm{a}_{2}$]]></tex-math><mml:math id="mml-ieqn-39"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The adaptive algorithm trains the FIR filter coefficients,  such that <inline-formula id="ieqn-40"><alternatives><inline-graphic xlink:href="ieqn-40.png"/><tex-math id="tex-ieqn-40"><![CDATA[$\mathrm{a}_{2}$]]></tex-math><mml:math id="mml-ieqn-40"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula> becomes closer to <inline-formula id="ieqn-41"><alternatives><inline-graphic xlink:href="ieqn-41.png"/><tex-math id="tex-ieqn-41"><![CDATA[$\mathrm{a}_{1}$]]></tex-math><mml:math id="mml-ieqn-41"><mml:msub><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>a</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></alternatives></inline-formula>. The experimental results after artifact elimination is shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. From this figure, it is depicted that <xref ref-type="fig" rid="fig-8">Fig. 8e</xref> and <xref ref-type="fig" rid="fig-8">8f</xref> are showing high-resolution brain wave components than other subplots. These are results are obtained due to SEUs based on N<sup>2</sup>L<sup>2</sup>MS and its variant algorithms. Again, by examine the performance measures in terms of convergence rate, SNR, excess mean square error, misadjustment, among the various algorithms N<sup>2</sup>L<sup>2</sup>MS based SEU achieves highest performance measures. But, among all the algorithms MCN<sup>2</sup>L<sup>2</sup>MS based SEU requires less amount of computational complexity in terms of multiplications by an amount of filter length, in this case it is &#x2018;L&#x2019;, shown in <xref ref-type="table" rid="table-1">Tab. 1</xref>. However, in terms of other performance measures MCN<sup>2</sup>L<sup>2</sup>MS is little bit inferior than N<sup>2</sup>L<sup>2</sup>MS algorithm based SEU. This fact is depicted by examine <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, <xref ref-type="table" rid="table-2">Tabs. 2</xref> and <xref ref-type="table" rid="table-3">3</xref>. Therefore, as a tradeoff the little bit inferior performance of MCN<sup>2</sup>L<sup>2</sup>MS based SEU could be tolerated than SEU based on N<sup>2</sup>L<sup>2</sup>MS, as MCN<sup>2</sup>L<sup>2</sup>MS needs lesser number of multiplications by an amount &#x2018;L&#x2019;, which is filter length in this case. Hence, MCN<sup>2</sup>L<sup>2</sup>MS based SEU is suitable for elimination of artifacts from brain waves for EEG analysis in remote health care monitoring applications.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Adaptive artifact cancellation of EBA from EEG signals: (a) noisy raw EEG component, (b) sample of EBA component, (c) output from LMS based SEU, (d) output from N<sup>2</sup>L<sup>2</sup>MS based SEU, (e) output from MN<sup>2</sup>L<sup>2</sup>MS based SEU, (f) output from MCN<sup>2</sup>L<sup>2</sup>MS based SEU, (g) output from MSN<sup>2</sup>L<sup>2</sup>MS based SEU, (h) output from MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS based SEU (data values are shown on x-axis; signal amplitudes are shown on y-axis signal)</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-8.png"/>
</fig>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Conclusion</title>
<p>This research demonstrates a new method for developing adaptive artifact eliminator to facilitate high-resolution brain waves for wireless EEG monitoring, remote health care monitoring applications in the contest of BCI. The proposed N<sup>2</sup>L<sup>2</sup>MS based SEUs achieved good filtering ability, convergence rate, less computational complexity of the adaptive algorithms. To examine these characteristics various SEUs based on N<sup>2</sup>L<sup>2</sup>MS, MN<sup>2</sup>L<sup>2</sup>MS, MCN<sup>2</sup>L<sup>2</sup>MS, MSN<sup>2</sup>L<sup>2</sup>MS, MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS algorithms are developed and demonstrated the brain wave enhancement. These implementations are compared with the performance of SEUs based on conventional LMS algorithm. Among these implementations N<sup>2</sup>L<sup>2</sup>MS based SEU achieved highest values of performance measures like SNR, EMSE, misadjustment, convergence, except computational complexity. This is evident from <xref ref-type="fig" rid="fig-9">Figs. 9</xref>&#x2013;<xref ref-type="fig" rid="fig-12">12</xref>, <xref ref-type="table" rid="table-1">Tabs. 1</xref>&#x2013;<xref ref-type="table" rid="table-3">3</xref>. From the experimental results among LMS, N<sup>2</sup>L<sup>2</sup>MS and M N<sup>2</sup>L<sup>2</sup>MS based SEUs the N<sup>2</sup>L<sup>2</sup>MS out performs. Again, when comparing N2L2MS and its hybrid versions of sign algorithms the performance of MS<sup>2</sup>N<sup>2</sup>L<sup>2</sup>MS, diverges more than MN<sup>2</sup>L<sup>2</sup>MS due to error clipping, data error clipping. When we compare the performance measures of N<sup>2</sup>L<sup>2</sup>MS and MCN<sup>2</sup>L<sup>2</sup>MS based SEUs in terms of SNR, EMSE, misadjustemnt convergence rate, the performance of MCN<sup>2</sup>L<sup>2</sup>MS is little inferior than N<sup>2</sup>L<sup>2</sup>MS. But, the computational complexity of MCN<sup>2</sup>L<sup>2</sup>MS is &#x2018;L&#x2019; times less than N<sup>2</sup>L<sup>2</sup>MS. Hence, it becomes more attractive for wireless and remote health care monitoring applications.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Bar diagram illustrating the SNRI calculated using various SEUs</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-9.png"/>
</fig>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Bar diagram illustrating the EMAE calculated using various SEUs</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-10.png"/>
</fig>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Bar diagram illustrating the MSD calculated using various SEUs</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-11.png"/>
</fig>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Bar diagram illustrating coherence calculated using various SEUs</title>
</caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="fig-12.png"/>
</fig>
</sec>
</body>
<back>
<fn-group><fn fn-type="other"><p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p></fn></fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Chan</surname></string-name></person-group>, <chapter-title>Ten years in public health, 2007&#x2013;2017</chapter-title>. In: <source>World Health Organization</source>, <publisher-loc>Geneva</publisher-loc>: <publisher-name>World Health Organization</publisher-name>, <year>2017</year>, <comment>978-92-4-151244-2</comment>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><collab>World Health Organization</collab></person-group>, <source>The world health report: Research for universal health coverage</source>, <publisher-loc>Geneva</publisher-loc>: <publisher-name>World Health Organization</publisher-name>, <year>2017</year>, <comment>978-92-4-156459-5</comment>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><collab>World Health Organization</collab></person-group>, <chapter-title>World health statistics 2017: Monitoring, health for the SDGs</chapter-title>. In: <source>Sustainable Development Goals</source>, <publisher-loc>Geneva</publisher-loc>: <publisher-name>World Health Organization</publisher-name>, <year>2017</year>, <comment>978-92-4-156548-6</comment>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><collab>World Health Organization</collab></person-group>, <source>Communicating risk in public health emergencies: A WHO guideline for emergency risk communication (ERC) policy and practice</source>, <publisher-loc>Geneva</publisher-loc>: <publisher-name>World Health Organization</publisher-name>, <year>2017</year>, <comment>978-92-4-155020-8</comment>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>M. Z.</given-names> <surname>Ur Rahman</surname></string-name>, <string-name><given-names>R. A.</given-names> <surname>Shaik</surname></string-name> and <string-name><given-names>D. V. R. K.</given-names> <surname>Reddy</surname></string-name></person-group>, &#x201C;<article-title>Cancellation of artifacts in the ECG signals using block adaptive filtering techniques, Research book entitled Software Tools and Algorithms for Biological Systems</article-title>, <article-title>Software tools and algorithms for biological systems</article-title>, <source>Advances in Experimental Medicine and Biology</source>, vol. <volume>696</volume>, <publisher-loc>USA</publisher-loc>: <publisher-name>Springer Nature</publisher-name>, pp. <fpage>505</fpage>&#x2013;<lpage>513</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. S.</given-names> <surname>Mirza</surname></string-name> and <string-name><given-names>M. Z.</given-names> <surname>Ur Rahman</surname></string-name></person-group>, &#x201C;<article-title>Efficient adaptive filtering techniques for thoracic electrical bio-impedance analysis in health care systems</article-title>,&#x201D; <source>Journal of Medical Imaging and Heath Informatics</source>, vol. <volume>7</volume>, no. <issue>9</issue>, pp. <fpage>1126</fpage>&#x2013;<lpage>1138</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. Z.</given-names> <surname>Ur Rahman</surname></string-name> and <string-name><given-names>S. S.</given-names> <surname>Mirza</surname></string-name></person-group>, &#x201C;<article-title>Process techniques for human thoracic electrical bio-impedance signal in remote healthcare systems</article-title>,&#x201D; <source>IET Healthcare Technology Letters</source>, vol. <volume>3</volume>, no. <issue>2</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Soumya</surname></string-name>, <string-name><given-names>M. Z.</given-names> <surname>Ur Rahman</surname></string-name>, <string-name><given-names>D. V. R. K.</given-names> <surname>Reddy</surname></string-name> and <string-name><given-names>A. L.</given-names> <surname>Ekuakille</surname></string-name></person-group>, &#x201C;<article-title>Efficient block processing of long duration biotelemetric brain data for health care monitoring</article-title>,&#x201D; <source>Review of Scientific Instruments</source>, vol. <volume>86</volume>, no. <issue>3</issue>, pp. <fpage>35003</fpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.V.S.</given-names> <surname>Karthik</surname></string-name>, <string-name><given-names>S. Y.</given-names> <surname>Fathima</surname></string-name>, <string-name><given-names>M. Z.</given-names> <surname>Ur Rahman</surname></string-name>, <string-name><given-names>S. R.</given-names> <surname>Ahamed</surname></string-name> and <string-name><given-names>A. L.</given-names> <surname>Ekuakille</surname></string-name></person-group>, &#x201C;<article-title>Efficient signal conditioning techniques for brain activity in remote health monitoring network</article-title>,&#x201D; <source>IEEE Sensors Journal</source>, vol. <volume>13</volume>, no. <issue>9</issue>, pp. <fpage>3276</fpage>&#x2013;<lpage>3283</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. Z.</given-names> <surname>Ur Rahman</surname></string-name>, <string-name><given-names>S. R.</given-names> <surname>Ahamed</surname></string-name> and <string-name><given-names>D. V. R. K.</given-names> <surname>Reddy</surname></string-name></person-group>, &#x201C;<article-title>Efficient and simplified adaptive noise cancellers for ECG sensor based remote health monitoring</article-title>,&#x201D; <source>IEEE Sensors Journal</source>, vol. <volume>12</volume>, no. <issue>3</issue>, pp. <fpage>566</fpage>&#x2013;<lpage>573</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Nijholt</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Tan</surname></string-name></person-group>, &#x201C;<article-title>Brain-computer interfacing for intelligent systems</article-title>,&#x201D; <source>IEEE Intelligent Systems</source>, vol. <volume>23</volume>, no. <issue>3</issue>, pp. <fpage>72</fpage>&#x2013;<lpage>79</lpage>, <year>2008</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B. J.</given-names> <surname>Lance</surname></string-name>, <string-name><given-names>S. E.</given-names> <surname>Kerick</surname></string-name>, <string-name><given-names>A. J.</given-names> <surname>Ries</surname></string-name>, <string-name><given-names>K. S.</given-names> <surname>Oie</surname></string-name> and <string-name><given-names>K.</given-names> <surname>McDowell</surname></string-name></person-group>, &#x201C;<article-title>Brain computer interface technologies in the coming decades</article-title>,&#x201D; <source>Proceeding of the IEEE</source>, vol. <volume>100</volume>, no. <issue>13</issue>, pp. <fpage>1585</fpage>&#x2013;<lpage>1599</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>van Erp</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Lotte</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Tangermann</surname></string-name></person-group>, &#x201C;<article-title>Brain computer interfaces: Beyond medical applications</article-title>,&#x201D; <source>Computer</source>, vol. <volume>45</volume>, no. <issue>4</issue>, pp. <fpage>26</fpage>&#x2013;<lpage>34</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Schalk</surname></string-name> and <string-name><given-names>E. C.</given-names> <surname>Leuthardt</surname></string-name></person-group>, &#x201C;<article-title>Brain-computer interfaces using electrocorticographic signals</article-title>,&#x201D; <source>IEEE Reviews in Biomedical Engineering</source>, vol. <volume>4</volume>, pp. <fpage>140</fpage>&#x2013;<lpage>154</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>B. F.</given-names> <surname>Boroujeny</surname></string-name></person-group>, <source>Adaptive filters-theory and applications</source>. <publisher-loc>Chichester, U.K</publisher-loc>: <publisher-name>Wiley</publisher-name>, <year>1998</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. Z.</given-names> <surname>Ur Rahman</surname></string-name>, <string-name><given-names>S. R.</given-names> <surname>Ahamed</surname></string-name> and <string-name><given-names>D. V. R. K.</given-names> <surname>Reddy</surname></string-name></person-group>, &#x201C;<article-title>Efficient sign based normalized adaptive filtering techniques for cancelation of artefacts in ECG signals: Application to wireless biotelemetry</article-title>,&#x201D; <source>Signal Processing</source>, vol. <volume>91</volume>, no. <issue>2</issue>, pp. <fpage>225</fpage>&#x2013;<lpage>239</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Heiss</surname></string-name></person-group>, &#x201C;<article-title>Optimal dead-zone characteristic for minimizing the a-posteriori error in basis function networks</article-title>,&#x201D; in <conf-name>IEEE Proceedings of the 35th Conf. on Decision and Control</conf-name>, Kobe, Japan, pp. <fpage>476</fpage>&#x2013;<lpage>477</lpage>, <year>1996</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Heiss</surname></string-name></person-group>, &#x201C;<article-title>Error-minimizing dead zone for basis function networks</article-title>,&#x201D; <source>IEEE Transactions on Neural Networks</source>, vol. <volume>I</volume>, no. <issue>6</issue>, pp. <fpage>1503</fpage>&#x2013;<lpage>1506</lpage>, <year>1996</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M. Z.</given-names> <surname>Ur Rahman</surname></string-name>, <string-name><given-names>S. R.</given-names> <surname>Ahamed</surname></string-name> and <string-name><given-names>D. V. R. K.</given-names> <surname>Reddy</surname></string-name></person-group>, &#x201C;<article-title>A non-linearities based noise canceller for cardiac signal enhancement in wireless health care monitoring</article-title>,&#x201D; in <conf-name>IEEE Global Humanitarian Technology Conference</conf-name>, <publisher-loc>Seattle, WA, USA</publisher-loc>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>P. S. R.</given-names> <surname>Diniz</surname></string-name></person-group>, <source>Adaptive filtering, algorithms and practical implementation</source>. 3<inline-formula id="ieqn-42"><alternatives><inline-graphic xlink:href="ieqn-42.png"/><tex-math id="tex-ieqn-42"><![CDATA[$^{\mathrm{rd}}$]]></tex-math><mml:math id="mml-ieqn-42"><mml:msup><mml:mrow></mml:mrow><mml:mrow><mml:mstyle mathvariant="normal"><mml:mi>r</mml:mi><mml:mi>d</mml:mi></mml:mstyle></mml:mrow></mml:msup></mml:math></alternatives></inline-formula> ed., <publisher-loc>Switzerland</publisher-loc>: <publisher-name>Springer Publishers</publisher-name>, <year>2008</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Haykin</surname></string-name></person-group>, <source>Adaptive filter theory</source>. <publisher-loc>Eaglewood Clirs, NJ</publisher-loc>: <publisher-name>Prentice-Hall</publisher-name>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. E.</given-names> <surname>Greenberg</surname></string-name></person-group>, &#x201C;<article-title>Modified LMS algorithms for speech processing with an adaptive noise canceller</article-title>,&#x201D; <source>IEEE Transactions on Speech and Audio Processing</source>, vol. <volume>6</volume>, no. <issue>4</issue>, pp. <fpage>338</fpage>&#x2013;<lpage>351</lpage>, <year>1998</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. C.</given-names> <surname>Douglas</surname></string-name></person-group>, &#x201C;<article-title>A family of normalized LMS algorithms</article-title>,&#x201D; <source>IEEE Signal Processing Letters</source>, vol. <volume>1</volume>, pp. <fpage>1352</fpage>&#x2013;<lpage>1365</lpage>, <year>1994</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Emotiv</surname></string-name></person-group>, <article-title>Brain computer interface technology</article-title>, <publisher-name>EMOTIV Inc.</publisher-name>: <publisher-loc>San Francisco, CA, USA</publisher-loc>, <uri>http://emotiv.com</uri>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Malmivuo</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Plonsey</surname></string-name></person-group>, <source>Bioelectromagnetism: Principles and applications of bioelectric and biomagnetic fields</source>. <publisher-loc>Oxford, U.K</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>, <year>1995</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>