<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">ojapps</journal-id>
      <journal-title-group>
        <journal-title>Open Journal of Applied Sciences</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2165-3925</issn>
      <issn pub-type="ppub">2165-3917</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/ojapps.2026.163048</article-id>
      <article-id pub-id-type="publisher-id">ojapps-150089</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Biomedical</subject>
          <subject>Life Sciences</subject>
          <subject>Chemistry</subject>
          <subject>Materials Science</subject>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
          <subject>Engineering</subject>
          <subject>Physics</subject>
          <subject>Mathematics</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>UWB NLOS Signal Recognition Based on Deep Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Li</surname>
            <given-names>Guanhui</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Wei</surname>
            <given-names>Guoliang</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Xi</surname>
            <given-names>Zhuang</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> School of Optical-Electrical Computer Engineering, University of Shanghai for Science and Technology, Shanghai, China </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>05</day>
        <month>03</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>03</month>
        <year>2026</year>
      </pub-date>
      <volume>16</volume>
      <issue>03</issue>
      <fpage>779</fpage>
      <lpage>797</lpage>
      <history>
        <date date-type="received">
          <day>10</day>
          <month>02</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>09</day>
          <month>03</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>12</day>
          <month>03</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/ojapps.2026.163048">https://doi.org/10.4236/ojapps.2026.163048</self-uri>
      <abstract>
        <p>Ultra-wide band (UWB) positioning technology has attracted increasing attention due to its high ranging accuracy. However, in indoor environments, non-line-of-sight (NLOS) signals significantly degrade the ranging performance of UWB positioning systems compared with line-of-sight (LOS) signals. Therefore, accurate identification of LOS and NLOS signals is essential before adopting effective measures to improve UWB positioning accuracy. In this paper, a deep learning-based classification algorithm for UWB NLOS signal identification is proposed. Convolutional neural networks are employed to enhance the model’s feature extraction capability, while long short-term memory networks are used to capture temporal dependencies in the time-series data. Furthermore, a self-attention mechanism is introduced to further strengthen feature representation, thereby improving the recognition accuracy of NLOS signals. Experimental results demonstrate that the proposed method achieves an overall accuracy of 89.95%, with a precision and specificity of 91.07% and 91.33%, respectively, indicating superior comprehensive performance.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Ultra-Wide Band</kwd>
        <kwd>Non-Line-of-Sight</kwd>
        <kwd>Deep Learning</kwd>
        <kwd>Convolutional Neural Network</kwd>
        <kwd>Long Short-Term Memory</kwd>
        <kwd>Self-Attention Mechanism</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>In recent years, the demand for real-time and high-accuracy indoor positioning has been growing rapidly. However, in indoor environments, positioning systems often suffer from signal blockage caused by obstacles, leading to signal instability and, in some cases, positioning failure [<xref ref-type="bibr" rid="B1">1</xref>]. To address this challenge, extensive research efforts have been devoted to indoor localization, and various positioning solutions have been proposed [<xref ref-type="bibr" rid="B2">2</xref>]. Technologies such as infrared, ultrasonic, Bluetooth, Wi-Fi, radio-frequency identification (RFID), and UWB have been applied to indoor positioning systems [<xref ref-type="bibr" rid="B3">3</xref>].</p>
      <p>Among these technologies, UWB is considered particularly promising due to its high power efficiency, strong penetration capability, and robust performance in harsh multipath environments. UWB-based ranging systems can achieve an accuracy of up to ±10 cm [<xref ref-type="bibr" rid="B4">4</xref>]. As a result, UWB positioning has become one of the most widely adopted indoor localization technologies, owing to its high positioning accuracy and strong anti-interference capability [<xref ref-type="bibr" rid="B5">5</xref>]. However, in practical applications, UWB-based indoor positioning still faces several challenges, among which the NLOS problem is one of the most critical issues. NLOS conditions generally occur when the direct propagation path between the transmitter and receiver is obstructed. Under NLOS conditions, signal propagation delays are introduced, resulting in biased distance estimation between the transmitter and receiver. Since most ranging algorithms assume LOS conditions, distance errors caused by NLOS propagation can lead to a sharp degradation in positioning accuracy. Compared with other positioning technologies, UWB-based ranging systems are more severely affected by NLOS conditions [<xref ref-type="bibr" rid="B6">6</xref>]. Therefore, effective handling of the NLOS problem is of great significance for improving indoor positioning accuracy.</p>
      <p>With the rapid development of UWB positioning technology, extensive research has been conducted on NLOS state identification, providing strong support for enhancing indoor localization performance. In [<xref ref-type="bibr" rid="B7">7</xref>], a Kalman filter-based NLOS identification method was proposed, which determines the channel state by analyzing variations in the signal propagation cross-section. However, this method is sensitive to environmental changes and exhibits limited stability. In [<xref ref-type="bibr" rid="B8">8</xref>], a feature selection strategy was adopted to optimize NLOS identification, leading to performance improvement to some extent; nevertheless, its recognition performance varies significantly across different scenarios, indicating limited generalization capability. A prior-knowledge-free and environment-insensitive identification method was proposed in [<xref ref-type="bibr" rid="B9">9</xref>], which is able to extract partial NLOS channel features, but its recognition accuracy remains insufficient in complex environments. In [<xref ref-type="bibr" rid="B10">10</xref>], a weighted K-nearest neighbor (KNN) algorithm based on channel impulse response (CIR) features was proposed by incorporating feature saturation and feature selection optimization. Although this method improves recognition accuracy while maintaining low computational complexity, it relies heavily on manually designed features and may still overlook potentially informative characteristics.</p>
      <p>However, methods based on handcrafted feature extraction typically involve complex processing pipelines and inevitably introduce subjective factors, which may result in the loss of valuable information. With the continuous advancement of deep learning, end-to-end NLOS/LOS identification methods have attracted increasing attention. These approaches enable automatic feature learning and classification by directly modeling UWB signals. In [<xref ref-type="bibr" rid="B11">11</xref>], reversible transform denoising was combined with a convolutional neural network (CNN), achieving a recognition accuracy of 81.68% on the public eWINE dataset. Furthermore, CNNs were integrated with long short-term memory (LSTM) networks in [<xref ref-type="bibr" rid="B12">12</xref>], improving the recognition accuracy to 82.14%, although the overall performance gain remained limited. A fully convolutional network (FCN)-based method was proposed in [<xref ref-type="bibr" rid="B13">13</xref>], further increasing the classification accuracy to 88.24%. In addition, studies in [<xref ref-type="bibr" rid="B14">14</xref>] and [<xref ref-type="bibr" rid="B15">15</xref>] explored transforming one-dimensional CIR data into two-dimensional images and applying deep learning models for classification. However, such methods are sensitive to the image transformation process and parameter settings and typically incur high computational complexity, making them less suitable for real-time applications.</p>
      <p>To further improve NLOS/LOS classification performance in UWB environments, this paper proposes a deep learning-based NLOS identification method, referred to as the CL-Attention algorithm. The proposed approach organically integrates convolutional neural networks, long short-term memory networks, and a self-attention mechanism to construct an end-to-end feature learning and classification framework. In the proposed model, CNNs are employed to extract local features from UWB CIR signals, while LSTM networks model the temporal correlations of the signals. A self-attention mechanism is further introduced to adaptively weight and enhance temporal features, thereby improving the model’s capability to capture critical information. Experimental validation is conducted on a public UWB CIR dataset, and the results demonstrate that, compared with several existing models, the proposed method achieves more stable and competitive improvements in classification performance.</p>
    </sec>
    <sec id="sec2">
      <title>2. Model Overall Architecture Design</title>
      <p>This section presents the design and implementation of a deep learning-based UWB NLOS signal classification model. The proposed model focuses on modeling the feature differences of UWB signals under LOS and NLOS propagation environments to enable effective discrimination between LOS and NLOS states. The overall architecture of the proposed model is illustrated in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p>
      <fig id="fig1">
        <label>Figure 1</label>
        <graphic xlink:href="https://html.scirp.org/file/2313680-rId13.jpeg?20260312022606" />
      </fig>
      <p>Figure 1. Schematic diagram of overall model architecture.</p>
      <sec id="sec2dot1">
        <title>2.1. Convolutional Feature Extraction Module</title>
        <p>To fully exploit the spatial structural characteristics embedded in UWB CIR data, a spatial feature extraction module based on one-dimensional convolutional neural network (1DCNN) is designed and implemented. This module takes normalized raw CIR sequences as input and performs hierarchical feature extraction through multiple one-dimensional convolutional operations, providing discriminative high-dimensional representations for subsequent temporal modeling.</p>
        <p>One-dimensional convolution is capable of effectively capturing signal variation patterns within local temporal windows as well as multipath energy distribution characteristics, thereby extracting spatial structural information that is highly relevant to LOS/NLOS discrimination. After each convolutional layer, batch normalization (BN) and rectified linear unit (ReLU) activation functions are introduced to enhance training stability, accelerate convergence, and improve the nonlinear representation capability of the network.</p>
        <p>To further reduce feature dimensionality and suppress redundant information, a max pooling operation is incorporated into the convolutional module to downsample the convolutional features. This operation reduces computational complexity while preserving essential information. By stacking multiple basic units consisting of “Conv1D-BN-ReLU,” the model progressively extracts spatial feature representations from shallow to deep levels directly from the raw CIR data, thereby enhancing its ability to characterize differences in multipath structures under various propagation conditions. The architecture of the convolutional feature extraction module is shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>.</p>
        <fig id="fig2">
          <label>Figure 2</label>
          <graphic xlink:href="https://html.scirp.org/file/2313680-rId14.jpeg?20260312022606" />
        </fig>
        <p>Figure 2. Convolutional feature extraction module.</p>
        <p>Let <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mi> X </mml:mi><mml:mi> l </mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> denote the input of the <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> l </mml:mi><mml:mtext> -th </mml:mtext></mml:mrow></mml:math></inline-formula> basic block in the CNN. The local features extracted by the <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> l </mml:mi><mml:mtext> -th </mml:mtext></mml:mrow></mml:math></inline-formula> block can be computed as follows:</p>
        <disp-formula id="FD1">
          <label>(1)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>Y</mml:mi>
                <mml:mrow>
                  <mml:mi>C</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>v</mml:mi>
                </mml:mrow>
                <mml:mi>l</mml:mi>
              </mml:msubsup>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mi>W</mml:mi>
                <mml:mi>l</mml:mi>
              </mml:msup>
              <mml:mo>⊗</mml:mo>
              <mml:msup>
                <mml:mi>X</mml:mi>
                <mml:mi>l</mml:mi>
              </mml:msup>
              <mml:mo>+</mml:mo>
              <mml:msup>
                <mml:mi>b</mml:mi>
                <mml:mi>l</mml:mi>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD2">
          <label>(2)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>Y</mml:mi>
                <mml:mrow>
                  <mml:mi>B</mml:mi>
                  <mml:mi>N</mml:mi>
                </mml:mrow>
                <mml:mi>l</mml:mi>
              </mml:msubsup>
              <mml:mo>=</mml:mo>
              <mml:mi>B</mml:mi>
              <mml:msub>
                <mml:mi>N</mml:mi>
                <mml:mi>l</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mi>Y</mml:mi>
                    <mml:mrow>
                      <mml:mi>C</mml:mi>
                      <mml:mi>o</mml:mi>
                      <mml:mi>v</mml:mi>
                    </mml:mrow>
                    <mml:mi>l</mml:mi>
                  </mml:msubsup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD3">
          <label>(3)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>Y</mml:mi>
                <mml:mrow>
                  <mml:mi>C</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>v</mml:mi>
                </mml:mrow>
                <mml:mi>l</mml:mi>
              </mml:msubsup>
              <mml:mo>=</mml:mo>
              <mml:msup>
                <mml:mi>W</mml:mi>
                <mml:mi>l</mml:mi>
              </mml:msup>
              <mml:mo>⊗</mml:mo>
              <mml:msup>
                <mml:mi>X</mml:mi>
                <mml:mi>l</mml:mi>
              </mml:msup>
              <mml:mo>+</mml:mo>
              <mml:msup>
                <mml:mi>b</mml:mi>
                <mml:mi>l</mml:mi>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mi> W </mml:mi><mml:mi> l </mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> denotes the convolution kernel in the basic block, <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mi> b </mml:mi><mml:mi> l </mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> represents the bias parameter of the convolutional layer, and <inline-formula><mml:math display="inline"><mml:mo> ⊗ </mml:mo></mml:math></inline-formula> denotes the convolution operation.</p>
        <p>To reduce the dimensionality of the extracted features while preserving feature invariance, a max pooling operation is applied in the feature extraction stage. The adopted pooling function is a one-dimensional max pooling layer, which can be expressed as follows:</p>
        <disp-formula id="FD4">
          <label>(4)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>f</mml:mi>
                <mml:mrow>
                  <mml:mtext>maxpool</mml:mtext>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi>max</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mrow>
                      <mml:mtext>stride</mml:mtext>
                      <mml:mo>×</mml:mo>
                      <mml:mi>k</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mi>i</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mrow>
                      <mml:mtext>stride</mml:mtext>
                      <mml:mo>×</mml:mo>
                      <mml:mi>k</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mi>i</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:mo>⋯</mml:mo>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mrow>
                      <mml:mtext>stride</mml:mtext>
                      <mml:mo>×</mml:mo>
                      <mml:mi>k</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mi>i</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mi>m</mml:mi>
                      <mml:mo>−</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mi> m </mml:mi></mml:math></inline-formula> denotes the length of the pooling window, and <inline-formula><mml:math display="inline"><mml:mrow><mml:mtext> stride </mml:mtext></mml:mrow></mml:math></inline-formula> represents the stride of the pooling operation along the input feature sequence. By controlling the sliding manner of the pooling window, this operation enables effective feature downsampling while retaining key information.</p>
        <p>The input data <inline-formula><mml:math display="inline"><mml:mi> X </mml:mi></mml:math></inline-formula> correspond to CIR sequences consisting of 1016 samples for each measurement. The detailed parameters of the convolutional layers are listed in <bold>Table 1</bold>.</p>
        <p>Table 1. Detailed parameters of the convolutional layer.</p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <table>
            <tbody>
              <tr>
                <td>Layer Type</td>
                <td>Input channel</td>
                <td>Output channel</td>
                <td>Kernel size</td>
                <td>Stride</td>
                <td>Output shape</td>
              </tr>
              <tr>
                <td>Input</td>
                <td>
                </td>
                <td>
                </td>
                <td>
                </td>
                <td>
                </td>
                <td>1 × 1016</td>
              </tr>
              <tr>
                <td>Convolution 1</td>
                <td>1</td>
                <td>64</td>
                <td>11</td>
                <td>1</td>
                <td>64 × 1006</td>
              </tr>
              <tr>
                <td>BN</td>
                <td>64</td>
                <td>64</td>
                <td>
                </td>
                <td>
                </td>
                <td>64 × 1006</td>
              </tr>
              <tr>
                <td>Activation</td>
                <td>64</td>
                <td>64</td>
                <td>
                </td>
                <td>
                </td>
                <td>64 × 1006</td>
              </tr>
              <tr>
                <td>Convolution 2</td>
                <td>64</td>
                <td>64</td>
                <td>9</td>
                <td>1</td>
                <td>64 × 998</td>
              </tr>
              <tr>
                <td>BN</td>
                <td>64</td>
                <td>64</td>
                <td>
                </td>
                <td>
                </td>
                <td>64 × 998</td>
              </tr>
              <tr>
                <td>Activation</td>
                <td>64</td>
                <td>64</td>
                <td>
                </td>
                <td>
                </td>
                <td>64 × 998</td>
              </tr>
              <tr>
                <td>MaxPool</td>
                <td>
                </td>
                <td>
                </td>
                <td>2</td>
                <td>2</td>
                <td>64 × 499</td>
              </tr>
              <tr>
                <td>Convolution 3</td>
                <td>64</td>
                <td>128</td>
                <td>7</td>
                <td>1</td>
                <td>128 × 493</td>
              </tr>
              <tr>
                <td>BN</td>
                <td>128</td>
                <td>128</td>
                <td>
                </td>
                <td>
                </td>
                <td>128 × 493</td>
              </tr>
              <tr>
                <td>Activation</td>
                <td>128</td>
                <td>128</td>
                <td>
                </td>
                <td>
                </td>
                <td>128 × 493</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec2dot2">
        <title>2.2. Temporal Feature Modeling Module</title>
        <p>After completing the extraction of spatial features from UWB signals, a temporal feature modeling module is further designed to model the temporal dependencies of the feature sequences output by the convolutional network. This module is built upon LSTM networks and aims to characterize the dynamic evolution of UWB signals during the propagation process from a temporal perspective, thereby providing more discriminative feature representations for subsequent LOS/NLOS classification. The basic structure of an LSTM unit is illustrated in <xref ref-type="fig" rid="fig3">Figure 3</xref>.</p>
        <fig id="fig3">
          <label>Figure 3</label>
          <graphic xlink:href="https://html.scirp.org/file/2313680-rId41.jpeg?20260312022607" />
        </fig>
        <p>Figure 3. Long short-term memory network structure.</p>
        <p>Specifically, an LSTM network mainly consists of an input gate, a forget gate, and an output gate, whose core function is to selectively memorize and update sequential information. The input gate controls the extent to which the current input information influences the cell state, the forget gate regulates the retention of historical memory from the previous time step, and the output gate determines the contribution of the current cell state to the external output.</p>
        <p>At time step <inline-formula><mml:math><mml:mi> t </mml:mi></mml:math></inline-formula> , the input gate first computes the gating coefficient based on the current input vector <inline-formula><mml:math><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> x </mml:mi></mml:mstyle><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and the hidden state from the previous time step <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> h </mml:mi></mml:mstyle><mml:mrow><mml:mi> t </mml:mi><mml:mo> − </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> . The expression is given as follows:</p>
        <disp-formula id="FD5">
          <label>(5)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mstyle mathvariant="bold" mathsize="normal">
                  <mml:mi>f</mml:mi>
                </mml:mstyle>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mstyle mathvariant="bold" mathsize="normal">
                      <mml:mi>W</mml:mi>
                    </mml:mstyle>
                    <mml:mi>f</mml:mi>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>h</mml:mi>
                        </mml:mstyle>
                        <mml:mrow>
                          <mml:mi>t</mml:mi>
                          <mml:mo>−</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>,</mml:mo>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>x</mml:mi>
                        </mml:mstyle>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>]</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mstyle mathvariant="bold" mathsize="normal">
                      <mml:mi>b</mml:mi>
                    </mml:mstyle>
                    <mml:mi>f</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>here <inline-formula><mml:math display="inline"><mml:mi> σ </mml:mi></mml:math></inline-formula> denotes the sigmoid activation function, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> W </mml:mi></mml:mstyle><mml:mi> f </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents the weight matrix, and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> b </mml:mi></mml:mstyle><mml:mi> f </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the bias vector. The output of the forget gate determines the proportion of information retained from the previous cell state <inline-formula><mml:math><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> C </mml:mi></mml:mstyle><mml:mrow><mml:mi> t </mml:mi><mml:mo> − </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> .</p>
        <p>The input gate is responsible for incorporating new input features, and its computation can be expressed as:</p>
        <disp-formula id="FD6">
          <label>(6)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mstyle mathvariant="bold" mathsize="normal">
                  <mml:mi>i</mml:mi>
                </mml:mstyle>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mstyle mathvariant="bold" mathsize="normal">
                      <mml:mi>W</mml:mi>
                    </mml:mstyle>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>h</mml:mi>
                        </mml:mstyle>
                        <mml:mrow>
                          <mml:mi>t</mml:mi>
                          <mml:mo>−</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>,</mml:mo>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>x</mml:mi>
                        </mml:mstyle>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>]</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mstyle mathvariant="bold" mathsize="normal">
                      <mml:mi>b</mml:mi>
                    </mml:mstyle>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The candidate cell state is obtained through a nonlinear transformation, which can be expressed as:</p>
        <disp-formula id="FD7">
          <label>(7)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mstyle mathvariant="bold" mathsize="normal">
                <mml:mover accent="true">
                  <mml:mi>C</mml:mi>
                  <mml:mo>^</mml:mo>
                </mml:mover>
              </mml:mstyle>
              <mml:mo>=</mml:mo>
              <mml:mi>tanh</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mstyle mathvariant="bold" mathsize="normal">
                      <mml:mi>W</mml:mi>
                    </mml:mstyle>
                    <mml:mi>c</mml:mi>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>h</mml:mi>
                        </mml:mstyle>
                        <mml:mrow>
                          <mml:mi>t</mml:mi>
                          <mml:mo>−</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>,</mml:mo>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>x</mml:mi>
                        </mml:mstyle>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>]</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mstyle mathvariant="bold" mathsize="normal">
                      <mml:mi>b</mml:mi>
                    </mml:mstyle>
                    <mml:mi>c</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> W </mml:mi></mml:mstyle><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> W </mml:mi></mml:mstyle><mml:mi> c </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denote the weight matrices of the input gate and the candidate state, respectively, and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> b </mml:mi></mml:mstyle><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> b </mml:mi></mml:mstyle><mml:mi> c </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are the corresponding bias terms. The candidate cell state <inline-formula><mml:math display="inline"><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mover accent="true"><mml:mi> C </mml:mi><mml:mo> ^ </mml:mo></mml:mover></mml:mstyle></mml:math></inline-formula> is used to store newly extracted feature information at the current time step.</p>
        <p>By jointly considering the regulatory effects of the forget gate and the input gate, the cell state at the current time step is updated as:</p>
        <disp-formula id="FD8">
          <label>(8)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mstyle mathvariant="bold" mathsize="normal">
                  <mml:mi>C</mml:mi>
                </mml:mstyle>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mstyle mathvariant="bold" mathsize="normal">
                  <mml:mi>f</mml:mi>
                </mml:mstyle>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>⊙</mml:mo>
              <mml:msub>
                <mml:mstyle mathvariant="bold" mathsize="normal">
                  <mml:mi>C</mml:mi>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>−</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mstyle mathvariant="bold" mathsize="normal">
                  <mml:mi>i</mml:mi>
                </mml:mstyle>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>⊙</mml:mo>
              <mml:mstyle mathvariant="bold" mathsize="normal">
                <mml:mover accent="true">
                  <mml:mi>C</mml:mi>
                  <mml:mo>^</mml:mo>
                </mml:mover>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mo> ⊙ </mml:mo></mml:math></inline-formula> denotes the element-wise multiplication operation.</p>
        <p>Finally, the output gate is employed to control the influence of the cell state on the hidden layer output, and its computation is given by:</p>
        <disp-formula id="FD9">
          <label>(9)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mstyle mathvariant="bold" mathsize="normal">
                  <mml:mi>o</mml:mi>
                </mml:mstyle>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mstyle mathvariant="bold" mathsize="normal">
                      <mml:mi>W</mml:mi>
                    </mml:mstyle>
                    <mml:mi>o</mml:mi>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>[</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>h</mml:mi>
                        </mml:mstyle>
                        <mml:mrow>
                          <mml:mi>t</mml:mi>
                          <mml:mo>−</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>,</mml:mo>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>x</mml:mi>
                        </mml:mstyle>
                        <mml:mi>t</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>]</mml:mo>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mstyle mathvariant="bold" mathsize="normal">
                      <mml:mi>b</mml:mi>
                    </mml:mstyle>
                    <mml:mi>o</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The corresponding hidden state output is given by:</p>
        <disp-formula id="FD10">
          <label>(10)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mstyle mathvariant="bold" mathsize="normal">
                  <mml:mi>h</mml:mi>
                </mml:mstyle>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>−</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mstyle mathvariant="bold" mathsize="normal">
                  <mml:mi>o</mml:mi>
                </mml:mstyle>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mo>⊙</mml:mo>
              <mml:mi>tanh</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mstyle mathvariant="bold" mathsize="normal">
                      <mml:mi>C</mml:mi>
                    </mml:mstyle>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>In the proposed model, the output of the convolutional feature extraction module is organized as a temporally ordered feature sequence and fed into the long short-term memory network. Through the selective information transmission and update mechanisms of the input, forget, and output gates, the LSTM units are able to suppress irrelevant disturbances while retaining effective historical information. As a result, the network can accurately capture the intrinsic temporal evolution patterns of UWB signals.</p>
        <p>This architecture exhibits significant advantages in distinguishing the continuous and stable signal characteristics under line-of-sight conditions from the non-stationary temporal features induced by multipath effects in non-line-of-sight environments.</p>
      </sec>
      <sec id="sec2dot3">
        <title>2.3. Self-Attention Feature Enhancement Module</title>
        <p>In this study, a self-attention mechanism is introduced to model the temporal features of UWB channel impulse responses, thereby enhancing the ability to capture their global contextual relationships. In this module, the input is the feature sequence obtained after convolutional feature extraction and temporal modeling by the LSTM network. The feature representations at each time step are no longer processed independently; instead, they interact with other positions in the sequence through the self-attention mechanism, yielding feature representations that incorporate global contextual information.</p>
        <p>Essentially, the self-attention mechanism performs a weighted mapping process, where the queries, keys, and values are all derived from the same input feature sequence [<xref ref-type="bibr" rid="B16">16</xref>]. In this way, the model can adaptively emphasize the most critical temporal segments for LOS/NLOS classification while suppressing redundant or irrelevant features, thereby effectively enhancing the discriminative power of the feature representations. The structure of the self-attention feature enhancement module is illustrated in <xref ref-type="fig" rid="fig4">Figure 4</xref>.</p>
        <fig id="fig4">
          <label>Figure 4</label>
          <graphic xlink:href="https://html.scirp.org/file/2313680-rId80.jpeg?20260312022608" />
        </fig>
        <p>Figure 4. Schematic diagram of self-attention structure.</p>
        <p>Assume the input data <inline-formula><mml:math><mml:mrow><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> X </mml:mi></mml:mstyle><mml:mo> = </mml:mo><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mn> 3 </mml:mn></mml:msub><mml:mo> , </mml:mo><mml:mo> ⋯ </mml:mo><mml:mo> , </mml:mo><mml:msub><mml:mi> x </mml:mi><mml:mi> N </mml:mi></mml:msub></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the temporal feature sequence output from LSTM network. The queries <inline-formula><mml:math><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> Q </mml:mi></mml:mstyle></mml:math></inline-formula> , keys <inline-formula><mml:math><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> K </mml:mi></mml:mstyle></mml:math></inline-formula> , and values <inline-formula><mml:math><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> V </mml:mi></mml:mstyle></mml:math></inline-formula> are computed using independent convolutional functions <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> X </mml:mi></mml:mstyle><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> 、<inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> X </mml:mi></mml:mstyle><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mn> 3 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> X </mml:mi></mml:mstyle><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , respectively.</p>
        <p>The computation process is as follows:</p>
        <disp-formula id="FD11">
          <label>(11)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mrow>
                <mml:mo>{</mml:mo>
                <mml:mtable columnalign="left">
                  <mml:mtr>
                    <mml:mtd>
                      <mml:mstyle mathvariant="bold" mathsize="normal">
                        <mml:mi>Q</mml:mi>
                      </mml:mstyle>
                      <mml:mo>=</mml:mo>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:mn>1</mml:mn>
                      </mml:msub>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>X</mml:mi>
                        </mml:mstyle>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>=</mml:mo>
                      <mml:mstyle displaystyle="true">
                        <mml:mo>∑</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mstyle mathvariant="bold" mathsize="normal">
                              <mml:mi>W</mml:mi>
                            </mml:mstyle>
                            <mml:mn>1</mml:mn>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mstyle>
                      <mml:mstyle mathvariant="bold" mathsize="normal">
                        <mml:mi>X</mml:mi>
                      </mml:mstyle>
                      <mml:mo>+</mml:mo>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>B</mml:mi>
                        </mml:mstyle>
                        <mml:mn>1</mml:mn>
                      </mml:msub>
                    </mml:mtd>
                  </mml:mtr>
                  <mml:mtr>
                    <mml:mtd>
                      <mml:mstyle mathvariant="bold" mathsize="normal">
                        <mml:mi>K</mml:mi>
                      </mml:mstyle>
                      <mml:mo>=</mml:mo>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>X</mml:mi>
                        </mml:mstyle>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>=</mml:mo>
                      <mml:mstyle displaystyle="true">
                        <mml:mo>∑</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mstyle mathvariant="bold" mathsize="normal">
                              <mml:mi>W</mml:mi>
                            </mml:mstyle>
                            <mml:mn>2</mml:mn>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mstyle>
                      <mml:mstyle mathvariant="bold" mathsize="normal">
                        <mml:mi>X</mml:mi>
                      </mml:mstyle>
                      <mml:mo>+</mml:mo>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>B</mml:mi>
                        </mml:mstyle>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                    </mml:mtd>
                  </mml:mtr>
                  <mml:mtr>
                    <mml:mtd>
                      <mml:mstyle mathvariant="bold" mathsize="normal">
                        <mml:mi>V</mml:mi>
                      </mml:mstyle>
                      <mml:mo>=</mml:mo>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:mn>3</mml:mn>
                      </mml:msub>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>X</mml:mi>
                        </mml:mstyle>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>=</mml:mo>
                      <mml:mstyle displaystyle="true">
                        <mml:mo>∑</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mstyle mathvariant="bold" mathsize="normal">
                              <mml:mi>W</mml:mi>
                            </mml:mstyle>
                            <mml:mn>3</mml:mn>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mstyle>
                      <mml:mstyle mathvariant="bold" mathsize="normal">
                        <mml:mi>X</mml:mi>
                      </mml:mstyle>
                      <mml:mo>+</mml:mo>
                      <mml:msub>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>B</mml:mi>
                        </mml:mstyle>
                        <mml:mn>3</mml:mn>
                      </mml:msub>
                    </mml:mtd>
                  </mml:mtr>
                </mml:mtable>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> Q </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> K </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> f </mml:mi><mml:mi> V </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are three convolutional functions, and their detailed parameters are listed in <bold>Table 2</bold>. The parameters of these three convolutional functions are independent and can be adaptively learned during training.</p>
        <p>Table 2. Detailed parameters of the convolutional layer.</p>
        <table-wrap id="tbl2">
          <label>Table 2</label>
          <table>
            <tbody>
              <tr>
                <td>Layer Type</td>
                <td>Input channel</td>
                <td>Output channel</td>
                <td>Kernel size</td>
                <td>Stride</td>
                <td>Output shape</td>
              </tr>
              <tr>
                <td>Input data</td>
                <td>
                </td>
                <td>
                </td>
                <td>
                </td>
                <td>
                </td>
                <td>128 × 493</td>
              </tr>
              <tr>
                <td>Convolution function f1</td>
                <td>128</td>
                <td>16</td>
                <td>1</td>
                <td>1</td>
                <td>16 × 493</td>
              </tr>
              <tr>
                <td>Convolution function f2</td>
                <td>128</td>
                <td>16</td>
                <td>1</td>
                <td>1</td>
                <td>16 × 493</td>
              </tr>
              <tr>
                <td>Convolution function f3</td>
                <td>128</td>
                <td>16</td>
                <td>1</td>
                <td>1</td>
                <td>16 × 493</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>The output of the attention mechanism is calculated as:</p>
        <disp-formula id="FD12">
          <label>(12)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>S</mml:mi>
              <mml:mi>c</mml:mi>
              <mml:mi>o</mml:mi>
              <mml:mi>r</mml:mi>
              <mml:mi>e</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mstyle mathvariant="bold" mathsize="normal">
                    <mml:mi>Q</mml:mi>
                  </mml:mstyle>
                  <mml:mo>,</mml:mo>
                  <mml:mstyle mathvariant="bold" mathsize="normal">
                    <mml:mi>K</mml:mi>
                  </mml:mstyle>
                  <mml:mo>,</mml:mo>
                  <mml:mstyle mathvariant="bold" mathsize="normal">
                    <mml:mi>V</mml:mi>
                  </mml:mstyle>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mtext>softmax</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mfrac>
                    <mml:mrow>
                      <mml:mstyle mathvariant="bold" mathsize="normal">
                        <mml:mi>Q</mml:mi>
                      </mml:mstyle>
                      <mml:msup>
                        <mml:mstyle mathvariant="bold" mathsize="normal">
                          <mml:mi>K</mml:mi>
                        </mml:mstyle>
                        <mml:mtext>T</mml:mtext>
                      </mml:msup>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:msqrt>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>d</mml:mi>
                            <mml:mstyle mathvariant="bold" mathsize="normal">
                              <mml:mi>K</mml:mi>
                            </mml:mstyle>
                          </mml:msub>
                        </mml:mrow>
                      </mml:msqrt>
                    </mml:mrow>
                  </mml:mfrac>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mstyle mathvariant="bold" mathsize="normal">
                <mml:mi>V</mml:mi>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> d </mml:mi><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> K </mml:mi></mml:mstyle></mml:msub></mml:mrow></mml:math></inline-formula> is the dimensionality of each <inline-formula><mml:math display="inline"><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> K </mml:mi></mml:mstyle></mml:math></inline-formula> vector, and the softmax function is a generalization function that maps the elements of the input vector to corresponding values in the range of 0 to 1. Its computation is expressed as:</p>
        <disp-formula id="FD13">
          <label>(13)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mtext>softmax</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msup>
                    <mml:mtext>e</mml:mtext>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>x</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                  </mml:msup>
                </mml:mrow>
                <mml:mrow>
                  <mml:mstyle displaystyle="true">
                    <mml:mo>∑</mml:mo>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mtext>e</mml:mtext>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                      </mml:msup>
                    </mml:mrow>
                  </mml:mstyle>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is an element of the input vector, and <inline-formula><mml:math display="inline"><mml:mtext> e </mml:mtext></mml:math></inline-formula> is the base of the natural logarithm.</p>
      </sec>
      <sec id="sec2dot4">
        <title>2.4. Fully Connected Classification Module</title>
        <p>The fully connected (FC) layer is used to integrate and discriminate the feature vectors output by the attention mechanism, producing the final predicted labels corresponding to LOS/NLOS scenarios and outputting the classification results. The overall structure of this module is illustrated in <xref ref-type="fig" rid="fig5">Figure 5</xref>.</p>
        <fig id="fig5">
          <label>Figure 5</label>
          <graphic xlink:href="https://html.scirp.org/file/2313680-rId115.jpeg?20260312022608" />
        </fig>
        <p>Figure 5. Schematic diagram of the fully connected layer structure.</p>
        <p>In the implementation, a flattening layer first reshapes the features output from the self-attention feature enhancement module to prepare them for subsequent fully connected operations. Next, the first linear layer performs a linear mapping of the input vector through matrix operations, extracting higher-level feature representations. A dropout layer is then introduced, which randomly masks a portion of the neurons’ outputs with a certain probability, effectively mitigating overfitting. Subsequently, a second linear layer further maps the features, projecting the high-dimensional representations into the target classification space.</p>
        <p>The final layer contains two neurons corresponding to the NLOS and LOS classes, respectively, and employs the softmax activation function to output the class probability distribution. Let the input feature vector be <inline-formula><mml:math display="inline"><mml:mstyle mathvariant="bold" mathsize="normal"><mml:mi> x </mml:mi></mml:mstyle></mml:math></inline-formula> ; then the classification output of the fully connected layer can be expressed as:</p>
        <disp-formula id="FD14">
          <label>(14)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi mathvariant="normal">label</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mtext>argmax</mml:mtext>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mtext>softmax</mml:mtext>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi mathvariant="normal">f</mml:mi>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mtext>Dropout</mml:mtext>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mrow>
                              <mml:msub>
                                <mml:mi mathvariant="normal">f</mml:mi>
                                <mml:mn>1</mml:mn>
                              </mml:msub>
                              <mml:mrow>
                                <mml:mo>(</mml:mo>
                                <mml:mstyle mathvariant="bold" mathsize="normal">
                                  <mml:mi>x</mml:mi>
                                </mml:mstyle>
                                <mml:mo>)</mml:mo>
                              </mml:mrow>
                            </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:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal"> f </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal"> f </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> denote two linear transformation functions with learnable weights and biases. The Dropout operation randomly discards a portion of the input features to enhance the model’s generalization ability. The softmax function normalizes the network outputs to obtain the probability distribution of the sample belonging to the LOS and NLOS classes. Finally, the argmax function is used to select the class with the highest probability as the model’s predicted result.</p>
      </sec>
    </sec>
    <sec id="sec3">
      <title>3. Experiments and Results</title>
      <sec id="sec3dot1">
        <title>3.1. Data Description</title>
        <p>UWB channel impulse response data collected in indoor environments are used for LOS/NLOS scenario classification. CIR data can effectively capture the multipath propagation characteristics of UWB signals between the transmitter and receiver. The energy distribution and arrival delays of different propagation paths contain rich information about the channel environment, making CIR suitable for distinguishing between LOS and NLOS conditions.</p>
        <p>From a physical perspective, the CIR characterizes the impulse response of the wireless channel. Its baseband equivalent model can be represented as a superposition of multipath components [<xref ref-type="bibr" rid="B17">17</xref>]:</p>
        <disp-formula id="FD15">
          <label>(15)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>h</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>l</mml:mi>
                    <mml:mtext>=1</mml:mtext>
                  </mml:mrow>
                  <mml:mi>L</mml:mi>
                </mml:munderover>
                <mml:mrow>
                  <mml:mstyle displaystyle="true">
                    <mml:munderover>
                      <mml:mo>∑</mml:mo>
                      <mml:mrow>
                        <mml:mi>k</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mtext>1</mml:mtext>
                      </mml:mrow>
                      <mml:mi>K</mml:mi>
                    </mml:munderover>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>α</mml:mi>
                        <mml:mrow>
                          <mml:mi>k</mml:mi>
                          <mml:mo>,</mml:mo>
                          <mml:mi>l</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                    </mml:mrow>
                  </mml:mstyle>
                  <mml:msup>
                    <mml:mtext>e</mml:mtext>
                    <mml:mrow>
                      <mml:mi>j</mml:mi>
                      <mml:msub>
                        <mml:mi>θ</mml:mi>
                        <mml:mrow>
                          <mml:mi>k</mml:mi>
                          <mml:mo>,</mml:mo>
                          <mml:mi>l</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                    </mml:mrow>
                  </mml:msup>
                  <mml:mi>δ</mml:mi>
                </mml:mrow>
              </mml:mstyle>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mi>T</mml:mi>
                    <mml:mi>l</mml:mi>
                  </mml:msub>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mi>τ</mml:mi>
                    <mml:mrow>
                      <mml:mi>k</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>l</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mi> L </mml:mi></mml:math></inline-formula> denotes the number of received UWB signal clusters, and <inline-formula><mml:math display="inline"><mml:mi> K </mml:mi></mml:math></inline-formula> represents the number of multipath components within the <inline-formula><mml:math display="inline"><mml:mi> l </mml:mi></mml:math></inline-formula> -th cluster; <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> α </mml:mi><mml:mrow><mml:mi> k </mml:mi><mml:mo> , </mml:mo><mml:mi> l </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> θ </mml:mi><mml:mrow><mml:mi> k </mml:mi><mml:mo> , </mml:mo><mml:mi> l </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> denote the path gain and phase of the <inline-formula><mml:math display="inline"><mml:mi> k </mml:mi></mml:math></inline-formula> -th multipath component in the <inline-formula><mml:math display="inline"><mml:mi> l </mml:mi></mml:math></inline-formula> -th cluster, respectively; <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> T </mml:mi><mml:mi> l </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the arrival time of the <inline-formula><mml:math display="inline"><mml:mi> l </mml:mi></mml:math></inline-formula> -th cluster, and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> τ </mml:mi><mml:mrow><mml:mi> k </mml:mi><mml:mo> , </mml:mo><mml:mi> l </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the delay of the <inline-formula><mml:math display="inline"><mml:mi> k </mml:mi></mml:math></inline-formula> -th multipath component relative to the cluster arrival time.</p>
        <p>The CIR data of UWB essentially constitute a sequence of multipath responses sampled along the time-delay axis, which can describe the temporal distribution of signal energy. As shown in <xref ref-type="fig" rid="fig6">Figure 6</xref> and <xref ref-type="fig" rid="fig7">Figure 7</xref>, typical examples of UWB CIRs under NLOS and LOS scenarios are presented. It can be clearly observed that the two propagation environments exhibit significant differences in terms of the first-path energy, delay spread, and multipath structure. </p>
        <p>The experimental data used in this study are derived from the eWINE project, which collected UWB channel impulse response datasets using the DW1000 UWB module [<xref ref-type="bibr" rid="B18">18</xref>]. Measurements were conducted under various transmitter-receiver distance conditions, and each CIR record contains 1016 time samples.</p>
        <p>Due to variations in measurement conditions (e.g., transmission distance, obstacles, and environmental structures), the amplitude scale of the CIR signals differs across samples. Directly feeding the raw CIR amplitudes into the model may lead to unstable training. To eliminate amplitude scale discrepancies and enhance the model’s sensitivity to structural features, the MAX_NOISE factor provided in the dataset was used to normalize the CIR signals. This normalization strategy reduces the influence of amplitude differences across measurement scenarios, improves the model’s ability to capture multipath structure and first-path characteristics, and enhances both training stability and generalization performance.</p>
        <p>The dataset includes a total of 42,000 valid CIR samples, encompassing both NLOS and LOS channel measurements. To ensure fairness and generalization in model training and evaluation, the dataset was split into training, validation, and test sets in a 70%:15%:15% ratio, corresponding to 29,400, 6300, and 6300 CIR records, respectively.</p>
        <fig id="fig6">
          <label>Figure 6</label>
          <graphic xlink:href="https://html.scirp.org/file/2313680-rId148.jpeg?20260312022610" />
        </fig>
        <p>Figure 6. UWB CIR data in LOS scenarios.</p>
        <fig id="fig7">
          <label>Figure 7</label>
          <graphic xlink:href="https://html.scirp.org/file/2313680-rId149.jpeg?20260312022610" />
        </fig>
        <p>Figure 7. UWB CIR data in NLOS scenarios.</p>
        <p>The training set is used for learning the model parameters, the validation set is employed for hyperparameter tuning and monitoring overfitting during training, and the test set is reserved for the final evaluation of the model’s classification performance. In the test set, the number of NLOS and LOS samples is balanced, with 3150 records for each class, which facilitates an objective assessment of the model’s performance under different channel propagation conditions. All experimental results are statistically analyzed based on the classification outputs of the test set.</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Experimental Setup</title>
        <p>To evaluate the effectiveness of the proposed model in the LOS/NLOS classification task of UWB CIR signals, several representative deep learning models were selected for comparison, including CNN [<xref ref-type="bibr" rid="B11">11</xref>], LSTM [<xref ref-type="bibr" rid="B6">6</xref>], CNN-LSTM [<xref ref-type="bibr" rid="B12">12</xref>], FCN [<xref ref-type="bibr" rid="B13">13</xref>], and LSTM-FCN [<xref ref-type="bibr" rid="B19">19</xref>].</p>
        <p>During model training, the training data were divided into mini-batches, each containing 64 CIR records. The models were optimized using the Adam optimizer to improve training stability and convergence speed. The maximum number of training epochs was set to 100. During training, the validation set was used for hyperparameter tuning, and the model achieving the best validation performance was selected for final testing. All experiments were conducted under the same software and hardware environment to ensure fairness in comparison.</p>
        <p>The experiments were conducted on a server running Windows 11 with 16 GB of system memory and equipped with an NVIDIA GeForce RTX 3050 GPU. The deep learning framework used in this study was PyTorch 2.5.0. The model architecture and training hyperparameters were configured as follows. At the model level, the LSTM module adopts a two-layer stacked structure, with 128 hidden units in the first layer and 64 hidden units in the second layer, enabling hierarchical extraction of temporal features while gradually reducing feature dimensionality. The attention mechanism employs Scaled Dot-Product Self-Attention tailored for sequential feature modeling. To mitigate overfitting, Dropout regularization is applied with a dropout rate of 0.5, and L2 regularization is incorporated through a weight decay coefficient of 1 × 10<sup>−</sup><sup>4</sup>.</p>
        <p>During training, the Adam optimizer was utilized with an initial learning rate of 1 × 10<sup>−</sup><sup>4</sup>. A ReduceLROnPlateau learning rate scheduling strategy was adopted, using the validation F1 score as the monitoring metric. When the validation F1 score failed to improve for five consecutive epochs, the learning rate was reduced to 0.5 times its current value, with a minimum learning rate threshold set to 1 × 10<sup>−</sup><sup>6</sup>. To prevent overfitting and improve training efficiency, an early stopping mechanism based on the best validation F1 score was employed. Training was terminated if no performance improvement was observed for 15 consecutive epochs. The maximum number of training epochs was set to 100.</p>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. Evaluation Metrics</title>
        <p>LOS/NLOS channel identification is a binary classification problem, and the classification results can be categorized into four cases:</p>
        <p>True Positive (TP): LOS CIR data correctly classified as LOS.</p>
        <p>True Negative (TN): NLOS CIR data correctly classified as NLOS.</p>
        <p>False Positive (FP): NLOS CIR data incorrectly classified as LOS.</p>
        <p>False Negative (FN): LOS CIR data incorrectly classified as NLOS.</p>
        <p>In the experiments, five performance metrics were used to evaluate the classification algorithms: accuracy (ACC), precision, recall, specificity, and F1-score. The formulas for computing these metrics are as follows:</p>
        <disp-formula id="FD16">
          <label>(16)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mtext>ACC</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mtext>TP</mml:mtext>
                  <mml:mo>+</mml:mo>
                  <mml:mtext>TN</mml:mtext>
                </mml:mrow>
                <mml:mrow>
                  <mml:mtext>TP</mml:mtext>
                  <mml:mo>+</mml:mo>
                  <mml:mtext>TN</mml:mtext>
                  <mml:mo>+</mml:mo>
                  <mml:mtext>FP</mml:mtext>
                  <mml:mo>+</mml:mo>
                  <mml:mtext>FN</mml:mtext>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD17">
          <label>(17)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mtext>Precision</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mtext>TP</mml:mtext>
                </mml:mrow>
                <mml:mrow>
                  <mml:mtext>TP</mml:mtext>
                  <mml:mo>+</mml:mo>
                  <mml:mtext>FP</mml:mtext>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD18">
          <label>(18)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mtext>Recall</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mtext>TP</mml:mtext>
                </mml:mrow>
                <mml:mrow>
                  <mml:mtext>TP</mml:mtext>
                  <mml:mo>+</mml:mo>
                  <mml:mtext>FN</mml:mtext>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD19">
          <label>(19)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mtext>Specificity</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mtext>TN</mml:mtext>
                </mml:mrow>
                <mml:mrow>
                  <mml:mtext>TN</mml:mtext>
                  <mml:mo>+</mml:mo>
                  <mml:mtext>FP</mml:mtext>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD20">
          <label>(20)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mtext>F1-Score</mml:mtext>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mtext>2TP</mml:mtext>
                </mml:mrow>
                <mml:mrow>
                  <mml:mtext>2TP</mml:mtext>
                  <mml:mo>+</mml:mo>
                  <mml:mtext>FP</mml:mtext>
                  <mml:mo>+</mml:mo>
                  <mml:mtext>FN</mml:mtext>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
      </sec>
      <sec id="sec3dot4">
        <title>3.4. Ablation Study</title>
        <p>To verify the effectiveness of each key module in the proposed model, an ablation study was conducted. Specifically, the CNN feature extraction module, the LSTM temporal modeling module, and the self-attention module were individually removed, and the resulting performance changes were compared under identical experimental conditions. The results of this study are presented in <bold>Table 3</bold>. The corresponding classification confusion matrices are shown in <xref ref-type="fig" rid="fig8">Figure 8</xref>.</p>
        <p>Table 3. Performance metrics of the ablation study.</p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <table>
            <tbody>
              <tr>
                <td>Model Variant</td>
                <td>CNN Module</td>
                <td>LSTM Module</td>
                <td>Self-Attention Module</td>
                <td>Accuracy</td>
                <td>Precision</td>
                <td>Recall</td>
                <td>F1-Score</td>
              </tr>
              <tr>
                <td>CNN Only</td>
                <td>
                  <bold>√</bold>
                </td>
                <td>
                  <bold>×</bold>
                </td>
                <td>
                  <bold>×</bold>
                </td>
                <td>0.8233</td>
                <td>0.8306</td>
                <td>0.8124</td>
                <td>0.8214</td>
              </tr>
              <tr>
                <td>LSTM Only</td>
                <td>
                  <bold>×</bold>
                </td>
                <td>
                  <bold>√</bold>
                </td>
                <td>
                  <bold>×</bold>
                </td>
                <td>0.8002</td>
                <td>0.8053</td>
                <td>0.7917</td>
                <td>0.7985</td>
              </tr>
              <tr>
                <td>CNN + LSTM</td>
                <td>
                  <bold>√</bold>
                </td>
                <td>
                  <bold>√</bold>
                </td>
                <td>
                  <bold>×</bold>
                </td>
                <td>0.8775</td>
                <td>0.8843</td>
                <td>0.8686</td>
                <td>0.8764</td>
              </tr>
              <tr>
                <td>CNN + Attention</td>
                <td>
                  <bold>√</bold>
                </td>
                <td>
                  <bold>×</bold>
                </td>
                <td>
                  <bold>√</bold>
                </td>
                <td>0.8541</td>
                <td>0.8614</td>
                <td>0.8441</td>
                <td>0.8527</td>
              </tr>
              <tr>
                <td>LSTM + Attention</td>
                <td>
                  <bold>×</bold>
                </td>
                <td>
                  <bold>√</bold>
                </td>
                <td>
                  <bold>√</bold>
                </td>
                <td>0.8452</td>
                <td>0.8509</td>
                <td>0.8371</td>
                <td>0.8440</td>
              </tr>
              <tr>
                <td>Full Model</td>
                <td>
                  <bold>√</bold>
                </td>
                <td>
                  <bold>√</bold>
                </td>
                <td>
                  <bold>√</bold>
                </td>
                <td>0.8995</td>
                <td>0.9107</td>
                <td>0.8857</td>
                <td>0.8981</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec3dot5">
        <title>3.5. Comparative Experiments and Analysis</title>
        <p>To further validate the effectiveness of the proposed model, comparative experiments were conducted with several other algorithms. <bold>Table 4</bold> presents the classification results of each method. From the data in <bold>Table 4</bold> and <bold>Table 5</bold>, it can be observed that the overall performance of different models in the NLOS/LOS classification task is comparable, but differences still exist in terms of misclassification distribution and class balance.</p>
        <p>Based on the statistical results, the proposed method maintains high levels of both true positives and true negatives, while the number of false positives is </p>
        <fig id="fig8">
          <label>Figure 8</label>
          <graphic xlink:href="https://html.scirp.org/file/2313680-rId160.jpeg?20260312022612" />
        </fig>
        <p>Figure 8. Confusion matrices of the ablation study.</p>
        <p>Table 4. NLOS/LOS classification result.</p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <table>
            <tbody>
              <tr>
                <td>algorithm</td>
                <td>TP</td>
                <td>TN</td>
                <td>FP</td>
                <td>FN</td>
              </tr>
              <tr>
                <td>CNN</td>
                <td>2819</td>
                <td>2626</td>
                <td>558</td>
                <td>297</td>
              </tr>
              <tr>
                <td>LSTM</td>
                <td>2776</td>
                <td>2437</td>
                <td>747</td>
                <td>340</td>
              </tr>
              <tr>
                <td>CNN-LSTM</td>
                <td>2753</td>
                <td>2484</td>
                <td>699</td>
                <td>364</td>
              </tr>
              <tr>
                <td>FCN</td>
                <td>2821</td>
                <td>2663</td>
                <td>521</td>
                <td>295</td>
              </tr>
              <tr>
                <td>LSTM-FCN</td>
                <td>2808</td>
                <td>2664</td>
                <td>520</td>
                <td>308</td>
              </tr>
              <tr>
                <td>Ours</td>
                <td>2790</td>
                <td>2877</td>
                <td>273</td>
                <td>360</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>significantly lower than most of the compared models. This indicates that the proposed approach has a clear advantage in reducing the risk of misclassifying NLOS samples as LOS. Although the proposed model does not show an exaggerated improvement in classification performance compared with conventional methods such as CNN and LSTM, its overall performance is more stable, demonstrating better robustness in distinguishing CIRs under complex propagation environments.</p>
        <p>To further understand the classification performance of the proposed model, an error analysis was conducted on the FP and FN in the test set. It was observed that false positives primarily occur in scenarios where the first-path energy is weak or the signal is partially obstructed, causing NLOS signals to be misclassified as LOS. False negatives mainly arise in short-distance scenarios or under severe multipath interference, where LOS signals with significant multipath components are mistakenly classified as NLOS. These error modes may affect downstream ranging or positioning applications. For example, misclassifying NLOS as LOS could lead to underestimation of ranging errors, whereas misclassifying LOS as NLOS might trigger overly conservative interference mitigation strategies, reducing positioning efficiency. Understanding these FP and FN patterns can guide the design of more robust weighting or filtering strategies in positioning algorithms, thereby mitigating the impact of classification uncertainty on system performance.</p>
        <p>As shown in <bold>Table 5</bold>, the proposed algorithm demonstrates balanced performance across multiple evaluation metrics. In particular, the precision and specificity reach 91.07% and 91.33%, respectively, the highest among all compared methods, indicating a clear advantage in reducing misclassification and improving discriminative reliability. Meanwhile, the accuracy and F1-score also remain at high levels, further confirming the overall effectiveness of the proposed approach.</p>
        <p>Table 5. Evaluation indicators for each algorithm.</p>
        <table-wrap id="tbl5">
          <label>Table 5</label>
          <table>
            <tbody>
              <tr>
                <td>algorithm</td>
                <td>Accuracy</td>
                <td>Precision</td>
                <td>Recall</td>
                <td>specificity</td>
                <td>F1-Score</td>
              </tr>
              <tr>
                <td>CNN</td>
                <td>0.8635</td>
                <td>0.8347</td>
                <td>0.9047</td>
                <td>0.8248</td>
                <td>0.8690</td>
              </tr>
              <tr>
                <td>LSTM</td>
                <td>0.8289</td>
                <td>0.7881</td>
                <td>0.8909</td>
                <td>0.7653</td>
                <td>0.8365</td>
              </tr>
              <tr>
                <td>CNN-LSTM</td>
                <td>0.8329</td>
                <td>0.7975</td>
                <td>0.8832</td>
                <td>0.7802</td>
                <td>0.8383</td>
              </tr>
              <tr>
                <td>FCN</td>
                <td>0.8673</td>
                <td>0.8439</td>
                <td>0.9053</td>
                <td>0.8360</td>
                <td>0.8735</td>
              </tr>
              <tr>
                <td>LSTM-FCN</td>
                <td>0.8654</td>
                <td>0.8437</td>
                <td>0.9012</td>
                <td>0.8361</td>
                <td>0.8715</td>
              </tr>
              <tr>
                <td>Ours</td>
                <td>
                  <bold>0.8995</bold>
                </td>
                <td>
                  <bold>0.9107</bold>
                </td>
                <td>0.8857</td>
                <td>
                  <bold>0.9133</bold>
                </td>
                <td>0.8981</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>Based on the evaluation of discriminative capability, Gaussian noise with standard deviations of 0.01, 0.05, 0.10, and 0.20 was added to the test set to assess the model’s robustness under noisy conditions. Comparisons were made with CNN, LSTM, CNN-LSTM, FCN, and LSTM-FCN models. The experimental results are shown in <xref ref-type="fig" rid="fig9">Figure 9</xref>.</p>
        <p>The results indicate that when the noise standard deviation reaches 0.20 or 0.30, the performance of all models significantly decreases as the noise intensity increases. However, the proposed model maintains a relatively high accuracy even under the strongest noise, with only a 1.8% decrease. This performance surpasses that of other models, demonstrating its notable robustness and stability, as well as strong potential for practical applications.</p>
        <p>In addition, <xref ref-type="fig" rid="fig10">Figure 10</xref> presents the receiver operating characteristic (ROC) curves for CNN, LSTM, CNN-LSTM, FCN, and LSTM-FCN on the dataset to further evaluate model effectiveness. It is evident that the area under the curve (AUC) of the proposed model is higher than that of the other five models.</p>
        <fig id="fig9">
          <label>Figure 9</label>
          <graphic xlink:href="https://html.scirp.org/file/2313680-rId161.jpeg?20260312022612" />
        </fig>
        <p>Figure 9. Comparison of model accuracy under different noise levels.</p>
        <fig id="fig10">
          <label>Figure 10</label>
          <graphic xlink:href="https://html.scirp.org/file/2313680-rId162.jpeg?20260312022612" />
        </fig>
        <p>Figure 10. ROC curves of different models.</p>
        <p>As shown in <xref ref-type="fig" rid="fig11">Figure 11</xref>, the experimental training loss curves, validation loss curves, and accuracy curves on the training and validation sets indicate that the proposed model achieves superior classification performance compared with the other models.</p>
        <p>The above experiments and evaluation metrics indicate that, on the eWINE dataset, the proposed algorithm outperforms the other compared methods. Overall, </p>
        <fig id="fig11">
          <label>Figure 11</label>
          <graphic xlink:href="https://html.scirp.org/file/2313680-rId163.jpeg?20260312022612" />
        </fig>
        <p>Figure 11. Experimental result curves.</p>
        <p>the proposed algorithm not only maintains strong overall classification performance but also demonstrates superior control of misclassifications and result stability, thereby validating its effectiveness and practical value in UWB NLOS signal recognition tasks.</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Conclusions</title>
      <p>In summary, the deep learning-based UWB signal LOS/NLOS recognition method proposed in this study demonstrates strong classification performance on the eWINE dataset. The proposed approach achieves high levels across multiple evaluation metrics, including accuracy, precision, specificity, and F1-score, and maintains stable and competitive performance compared with various mainstream neural network models. This method can effectively extract discriminative features from UWB CIR signals and reliably identify LOS and NLOS conditions in complex propagation environments, validating the effectiveness and practical applicability of the proposed model for UWB scenario perception tasks.</p>
      <p>Although the proposed method achieves promising results in the LOS/NLOS classification task, there remain areas for further improvement. First, the experimental validation is primarily based on a publicly available dataset, which has limited scale and scene diversity. The model’s generalization capability in more complex or large-scale real-world environments requires further investigation. Future work could incorporate multi-scene, multi-device, and diverse indoor-structure datasets to enhance the model’s robustness and adaptability. Second, this study focuses mainly on LOS/NLOS state recognition itself, without deeply integrating the results with specific UWB indoor positioning algorithms. Future research could incorporate the recognition results into positioning error modeling and weighted localization frameworks, further improving indoor positioning accuracy and stability. Moreover, there is still room for optimization in terms of computational complexity and real-time performance, highlighting the need to explore more efficient network architectures to meet practical system deployment requirements.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Xue, W.L., Zhao, D. and Zhang, Y.C. (2020) Review of Research on Indoor Positioning. <italic>Computer and Modernization</italic>, No. 5, 80-88.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Xue, W.L.</string-name>
              <string-name>Zhao, D.</string-name>
              <string-name>Zhang, Y.C.</string-name>
              <string-name>Modernization, N</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Review of Research on Indoor Positioning</article-title>
            <source>Computer and Modernization</source>
            <volume>80</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Dai, Y.P. and Liu, T.Y. (2024) Review and Development Prospect of Indoor Positioning Technology. <italic>Digital Communication World</italic>, No. 8, 89-91, 100.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Dai, Y.P.</string-name>
              <string-name>Liu, T.Y.</string-name>
              <string-name>World, N</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Review and Development Prospect of Indoor Positioning Technology</article-title>
            <source>Digital Communication World</source>
            <volume>89</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Moon, S. and Youn, W. (2022) A Novel Movable UWB Localization System Using UAVs. <italic>IEEE Access</italic>, 10, 41303-41312. https://doi.org/10.1109/access.2022.3164701 <pub-id pub-id-type="doi">10.1109/access.2022.3164701</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/access.2022.3164701">https://doi.org/10.1109/access.2022.3164701</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Moon, S.</string-name>
              <string-name>Youn, W.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>A Novel Movable UWB Localization System Using UAVs</article-title>
            <source>IEEE Access</source>
            <volume>10</volume>
            <pub-id pub-id-type="doi">10.1109/access.2022.3164701</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Morón, P.T., Salimpour, S., Fu, L., Yu, X., Queralta, J.P. and Westerlund, T. (2023) Benchmarking UWB-Based Infrastructure-Free Positioning and Multi-Robot Relative Localization: Dataset and Characterization. 2023 <italic>IEEE Sensors Applications Symposium</italic> ( <italic>SAS</italic>), Ottawa, 18-20 July 2023, 1-6. https://doi.org/10.1109/sas58821.2023.10254018 <pub-id pub-id-type="doi">10.1109/sas58821.2023.10254018</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/sas58821.2023.10254018">https://doi.org/10.1109/sas58821.2023.10254018</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Salimpour, S.</string-name>
              <string-name>Fu, L.</string-name>
              <string-name>Yu, X.</string-name>
              <string-name>Queralta, J.P.</string-name>
              <string-name>Westerlund, T.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Benchmarking UWB-Based Infrastructure-Free Positioning and Multi-Robot Relative Localization: Dataset and Characterization</article-title>
            <source>2023 IEEE Sensors Applications Symposium (SAS)</source>
            <volume>18</volume>
            <pub-id pub-id-type="doi">10.1109/sas58821.2023.10254018</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Cong, F.Y., Hong, Z.H., Tang, Z., <italic>et al.</italic> (2022) An Optimization Method of UWB Ranging Based on Pulse Response Disambiguation and Reconstruction. <italic>Chinese Journal of Sc</italic><italic>ientific Instrument</italic>, 43, 13-21.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Cong, F.Y.</string-name>
              <string-name>Hong, Z.H.</string-name>
              <string-name>Tang, Z.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>An Optimization Method of UWB Ranging Based on Pulse Response Disambiguation and Reconstruction</article-title>
            <source>Chinese Journal of Scientific Instrument</source>
            <volume>43</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Kim, D., Farhad, A. and Pyun, J. (2023) UWB Positioning System Based on LSTM Classification with Mitigated NLOS Effects. <italic>IEEE Internet of Things Journal</italic>, 10, 1822-1835. https://doi.org/10.1109/jiot.2022.3209735 <pub-id pub-id-type="doi">10.1109/jiot.2022.3209735</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/jiot.2022.3209735">https://doi.org/10.1109/jiot.2022.3209735</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Kim, D.</string-name>
              <string-name>Farhad, A.</string-name>
              <string-name>Pyun, J.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>UWB Positioning System Based on LSTM Classification with Mitigated NLOS Effects</article-title>
            <source>IEEE Internet of Things Journal</source>
            <volume>10</volume>
            <pub-id pub-id-type="doi">10.1109/jiot.2022.3209735</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Lee, K., Oh, J. and You, K. (2016) Closed-Form Solution of TDOA-Based Geolocation and Tracking: A Recursive Weighted Least Square Approach. <italic>Wireless Personal Communicati</italic><italic>ons</italic>, 94, 3451-3464. https://doi.org/10.1007/s11277-016-3785-8 <pub-id pub-id-type="doi">10.1007/s11277-016-3785-8</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s11277-016-3785-8">https://doi.org/10.1007/s11277-016-3785-8</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Lee, K.</string-name>
              <string-name>Oh, J.</string-name>
              <string-name>You, K.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Closed-Form Solution of TDOA-Based Geolocation and Tracking: A Recursive Weighted Least Square Approach</article-title>
            <source>Wireless Personal Communications</source>
            <volume>94</volume>
            <pub-id pub-id-type="doi">10.1007/s11277-016-3785-8</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Yang, X., Zhao, F. and Chen, T. (2018) NLOS Identification for UWB Localization Based on Import Vector Machine. <italic>AEU</italic>— <italic>International Journal of Electronics and Communications</italic>, 87, 128-133. https://doi.org/10.1016/j.aeue.2018.02.003 <pub-id pub-id-type="doi">10.1016/j.aeue.2018.02.003</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.aeue.2018.02.003">https://doi.org/10.1016/j.aeue.2018.02.003</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Yang, X.</string-name>
              <string-name>Zhao, F.</string-name>
              <string-name>Chen, T.</string-name>
            </person-group>
            <year>2018</year>
            <article-title>NLOS Identification for UWB Localization Based on Import Vector Machine</article-title>
            <source>AEU—International Journal of Electronics and Communications</source>
            <volume>87</volume>
            <pub-id pub-id-type="doi">10.1016/j.aeue.2018.02.003</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Yu, K., Wen, K., Li, Y., Zhang, S. and Zhang, K. (2019) A Novel NLOS Mitigation Algorithm for UWB Localization in Harsh Indoor Environments. <italic>IEEE Transactions on Vehicular Technology</italic>, 68, 686-699. https://doi.org/10.1109/tvt.2018.2883810 <pub-id pub-id-type="doi">10.1109/tvt.2018.2883810</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tvt.2018.2883810">https://doi.org/10.1109/tvt.2018.2883810</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Yu, K.</string-name>
              <string-name>Wen, K.</string-name>
              <string-name>Li, Y.</string-name>
              <string-name>Zhang, S.</string-name>
              <string-name>Zhang, K.</string-name>
            </person-group>
            <year>2019</year>
            <article-title>A Novel NLOS Mitigation Algorithm for UWB Localization in Harsh Indoor Environments</article-title>
            <source>IEEE Transactions on Vehicular Technology</source>
            <volume>68</volume>
            <pub-id pub-id-type="doi">10.1109/tvt.2018.2883810</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wei, Z.H., Liao, G., Li, M.X., <italic>et al.</italic> (2024) NLOS Identification Technique Based on K-Means Clustering Algorithm Improved by ISODATA. <italic>Electronic Measurement Technology</italic>, 47, 172-180.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wei, Z.H.</string-name>
              <string-name>Liao, G.</string-name>
              <string-name>Li, M.X.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>NLOS Identification Technique Based on K-Means Clustering Algorithm Improved by ISODATA</article-title>
            <source>Electronic Measurement Technology</source>
            <volume>47</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Jiang, C., Chen, S., Chen, Y., Liu, D. and Bo, Y. (2020) An UWB Channel Impulse Response De-Noising Method for NLOS/LOS Classification Boosting. <italic>IEEE Communications Letters</italic>, 24, 2513-2517. https://doi.org/10.1109/lcomm.2020.3009659 <pub-id pub-id-type="doi">10.1109/lcomm.2020.3009659</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/lcomm.2020.3009659">https://doi.org/10.1109/lcomm.2020.3009659</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Jiang, C.</string-name>
              <string-name>Chen, S.</string-name>
              <string-name>Chen, Y.</string-name>
              <string-name>Liu, D.</string-name>
              <string-name>Bo, Y.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>An UWB Channel Impulse Response De-Noising Method for NLOS/LOS Classification Boosting</article-title>
            <source>IEEE Communications Letters</source>
            <volume>24</volume>
            <pub-id pub-id-type="doi">10.1109/lcomm.2020.3009659</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Jiang, C., Shen, J., Chen, S., Chen, Y., Liu, D. and Bo, Y. (2020) UWB NLOS/LOS Classification Using Deep Learning Method. <italic>IEEE Communications Letters</italic>, 24, 2226-2230. https://doi.org/10.1109/lcomm.2020.2999904 <pub-id pub-id-type="doi">10.1109/lcomm.2020.2999904</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/lcomm.2020.2999904">https://doi.org/10.1109/lcomm.2020.2999904</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Jiang, C.</string-name>
              <string-name>Shen, J.</string-name>
              <string-name>Chen, S.</string-name>
              <string-name>Chen, Y.</string-name>
              <string-name>Liu, D.</string-name>
              <string-name>Bo, Y.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>UWB NLOS/LOS Classification Using Deep Learning Method</article-title>
            <source>IEEE Communications Letters</source>
            <volume>24</volume>
            <pub-id pub-id-type="doi">10.1109/lcomm.2020.2999904</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Pei, Y., Chen, R., Li, D., Xiao, X. and Zheng, X. (2023) FCN-Attention: A Deep Learning UWB NLOS/LOS Classification Algorithm Using Fully Convolution Neural Network with Self-Attention Mechanism. <italic>Geo-Spatial</italic><italic>Information Science</italic>, 27, 1162-1181. https://doi.org/10.1080/10095020.2023.2178334 <pub-id pub-id-type="doi">10.1080/10095020.2023.2178334</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/10095020.2023.2178334">https://doi.org/10.1080/10095020.2023.2178334</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Pei, Y.</string-name>
              <string-name>Chen, R.</string-name>
              <string-name>Li, D.</string-name>
              <string-name>Xiao, X.</string-name>
              <string-name>Zheng, X.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>FCN-Attention: A Deep Learning UWB NLOS/LOS Classification Algorithm Using Fully Convolution Neural Network with Self-Attention Mechanism</article-title>
            <source>Geo-Spatial Information Science</source>
            <volume>27</volume>
            <pub-id pub-id-type="doi">10.1080/10095020.2023.2178334</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Cui, Z., Gao, Y., Hu, J., Tian, S. and Cheng, J. (2021) LOS/NLOS Identification for Indoor UWB Positioning Based on Morlet Wavelet Transform and Convolutional Neural Networks. <italic>IEEE Communications Letters</italic>, 25, 879-882. https://doi.org/10.1109/lcomm.2020.3039251 <pub-id pub-id-type="doi">10.1109/lcomm.2020.3039251</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/lcomm.2020.3039251">https://doi.org/10.1109/lcomm.2020.3039251</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Cui, Z.</string-name>
              <string-name>Gao, Y.</string-name>
              <string-name>Hu, J.</string-name>
              <string-name>Tian, S.</string-name>
              <string-name>Cheng, J.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>LOS/NLOS Identification for Indoor UWB Positioning Based on Morlet Wavelet Transform and Convolutional Neural Networks</article-title>
            <source>IEEE Communications Letters</source>
            <volume>25</volume>
            <pub-id pub-id-type="doi">10.1109/lcomm.2020.3039251</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wang, J., Yu, K., Bu, J., Lin, Y. and Han, S. (2022) Multi-Classification of UWB Signal Propagation Channels Based on One-Dimensional Wavelet Packet Analysis and CNN. <italic>IEE</italic><italic>E Transactions on Vehicular Technology</italic>, 71, 8534-8547. https://doi.org/10.1109/tvt.2022.3172863 <pub-id pub-id-type="doi">10.1109/tvt.2022.3172863</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tvt.2022.3172863">https://doi.org/10.1109/tvt.2022.3172863</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wang, J.</string-name>
              <string-name>Yu, K.</string-name>
              <string-name>Bu, J.</string-name>
              <string-name>Lin, Y.</string-name>
              <string-name>Han, S.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Multi-Classification of UWB Signal Propagation Channels Based on One-Dimensional Wavelet Packet Analysis and CNN</article-title>
            <source>IEEE Transactions on Vehicular Technology</source>
            <volume>71</volume>
            <pub-id pub-id-type="doi">10.1109/tvt.2022.3172863</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Hwang, H., Jeong, S. and Hwang, W. (2025) Ultrawideband Non-Line-Of-Sight Classification Using Transformer-Convolutional Neural Networks. <italic>IEEE Access</italic>, 13, 86323-86332. https://doi.org/10.1109/access.2025.3568830 <pub-id pub-id-type="doi">10.1109/access.2025.3568830</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/access.2025.3568830">https://doi.org/10.1109/access.2025.3568830</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Hwang, H.</string-name>
              <string-name>Jeong, S.</string-name>
              <string-name>Hwang, W.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Ultrawideband Non-Line-Of-Sight Classification Using Transformer-Convolutional Neural Networks</article-title>
            <source>IEEE Access</source>
            <volume>13</volume>
            <pub-id pub-id-type="doi">10.1109/access.2025.3568830</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Al-Sammna, A.M., Hadri Azmi, M. and Abd Rahman, T. (2018) Time-Varying Ultra-Wideband Channel Modeling and Prediction. <italic>Symmetry</italic>, 10, Article 631. https://doi.org/10.3390/sym10110631 <pub-id pub-id-type="doi">10.3390/sym10110631</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/sym10110631">https://doi.org/10.3390/sym10110631</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Al-Sammna, A.M.</string-name>
              <string-name>Azmi, M.</string-name>
              <string-name>Rahman, T.</string-name>
            </person-group>
            <year>2018</year>
            <article-title>Time-Varying Ultra-Wideband Channel Modeling and Prediction</article-title>
            <source>Symmetry</source>
            <volume>10</volume>
            <elocation-id>631</elocation-id>
            <pub-id pub-id-type="doi">10.3390/sym10110631</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Bregar, K. and Mohorcic, M. (2018) Improving Indoor Localization Using Convolutional Neural Networks on Computationally Restricted Devices. <italic>IEEE Access</italic>, 6, 17429-17441. https://doi.org/10.1109/access.2018.2817800 <pub-id pub-id-type="doi">10.1109/access.2018.2817800</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/access.2018.2817800">https://doi.org/10.1109/access.2018.2817800</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Bregar, K.</string-name>
              <string-name>Mohorcic, M.</string-name>
            </person-group>
            <year>2018</year>
            <article-title>Improving Indoor Localization Using Convolutional Neural Networks on Computationally Restricted Devices</article-title>
            <source>IEEE Access</source>
            <volume>6</volume>
            <pub-id pub-id-type="doi">10.1109/access.2018.2817800</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Karim, F., Majumdar, S., Darabi, H. and Chen, S. (2018) LSTM Fully Convolutional Networks for Time Series Classification. <italic>IEEE Access</italic>, 6, 1662-1669. https://doi.org/10.1109/access.2017.2779939 <pub-id pub-id-type="doi">10.1109/access.2017.2779939</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/access.2017.2779939">https://doi.org/10.1109/access.2017.2779939</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Karim, F.</string-name>
              <string-name>Majumdar, S.</string-name>
              <string-name>Darabi, H.</string-name>
              <string-name>Chen, S.</string-name>
            </person-group>
            <year>2018</year>
            <article-title>LSTM Fully Convolutional Networks for Time Series Classification</article-title>
            <source>IEEE Access</source>
            <volume>6</volume>
            <pub-id pub-id-type="doi">10.1109/access.2017.2779939</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>