The search functionality is under construction.

Author Search Result

[Author] Tao LIU(20hit)

1-20hit
  • Joint Timing and Channel Estimation for Ultra-Wideband Signals

    Tao LIU  Shihua ZHU  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E92-B No:2
      Page(s):
    499-506

    This paper is concerned with timing synchronization of high rates UWB signals operating in a dense multipath environment, where access must tackle inter-frame interference (IFI), inter-symbol interference (ISI) and even multi-user interference (MUI). A training-based joint timing and channel estimation scheme is proposed, which is resilient to IFI, ISI, MUI and pulse distortion. A low-complexity detection scheme similar to transmit-reference (TR) scheme comes out as a by-product. For saving the training symbols, we further develop an extended decision-directed (DD) scheme. A lower bound on the probability of correct detection is derived which agrees well with the simulated result for moderate to high SNR values. The results show that the proposed algorithm achieves a significant performance gain in terms of mean square error and bit error rate in comparison to the "timing with dirty templates" (TDT) algorithms.

  • Constructions of Low/Zero Correlation Zone Sequence Sets and Their Application in Grant-Free Non-Orthogonal Multiple Access System

    Tao LIU  Meiyue WANG  Dongyan JIA  Yubo LI  

     
    PAPER-Information Theory

      Pubricized:
    2022/12/16
      Vol:
    E106-A No:6
      Page(s):
    907-915

    In the massive machine-type communication scenario, aiming at the problems of active user detection and channel estimation in the grant-free non-orthogonal multiple access (NOMA) system, new sets of non-orthogonal spreading sequences are proposed by using the zero/low correlation zone sequence set with low correlation among multiple sets. The simulation results show that the resulting sequence set has low coherence, which presents reliable performance for channel estimation and active user detection based on compressed sensing. Compared with the traditional Zadoff-Chu (ZC) sequences, the new non-orthogonal spreading sequences have more flexible lengths, and lower peak-to-average power ratio (PAPR) and smaller alphabet size. Consequently, these sequences will effectively solve the problem of high PAPR of time domain signals and are more suitable for low-cost devices in massive machine-type communication.

  • A Driver Fatigue Detection Algorithm Based on Dynamic Tracking of Small Facial Targets Using YOLOv7

    Shugang LIU  Yujie WANG  Qiangguo YU  Jie ZHAN  Hongli LIU  Jiangtao LIU  

     
    PAPER-Image Recognition, Computer Vision

      Pubricized:
    2023/08/21
      Vol:
    E106-D No:11
      Page(s):
    1881-1890

    Driver fatigue detection has become crucial in vehicle safety technology. Achieving high accuracy and real-time performance in detecting driver fatigue is paramount. In this paper, we propose a novel driver fatigue detection algorithm based on dynamic tracking of Facial Eyes and Yawning using YOLOv7, named FEY-YOLOv7. The Coordinate Attention module is inserted into YOLOv7 to enhance its dynamic tracking accuracy by focusing on coordinate information. Additionally, a small target detection head is incorporated into the network architecture to promote the feature extraction ability of small facial targets such as eyes and mouth. In terms of compution, the YOLOv7 network architecture is significantly simplified to achieve high detection speed. Using the proposed PERYAWN algorithm, driver status is labeled and detected by four classes: open_eye, closed_eye, open_mouth, and closed_mouth. Furthermore, the Guided Image Filtering algorithm is employed to enhance image details. The proposed FEY-YOLOv7 is trained and validated on RGB-infrared datasets. The results show that FEY-YOLOv7 has achieved mAP of 0.983 and FPS of 101. This indicates that FEY-YOLOv7 is superior to state-of-the-art methods in accuracy and speed, providing an effective and practical solution for image-based driver fatigue detection.

  • Inverse Distance Weighting Method Based on a Dynamic Voronoi Diagram for Thermal Reconstruction with Limited Sensor Data on Multiprocessors

    Xin LI  Mengtian RONG  Tao LIU  Liang ZHOU  

     
    PAPER-Electronic Components

      Vol:
    E94-C No:8
      Page(s):
    1295-1301

    With exponentially increasing power densities due to technology scaling and ever increasing demand for performance, chip temperature has become an important issue that limits the performance of computer systems. Typically, it is essential to use a set of on-chip thermal sensors to monitor temperatures during the runtime. The runtime thermal measurements are then employed by dynamic thermal management techniques to manage chip performance appropriately. In this paper, we propose an inverse distance weighting method based on a dynamic Voronoi diagram for the reconstruction of full thermal characterization of integrated circuits with non-uniform thermal sensor placements. Firstly we utilize the proposed method to transform the non-uniformly spaced samples to virtual uniformly spaced data. Then we apply three classical interpolation algorithms to reconstruct the full thermal signals in the uniformly spaced samples mode. To evaluate the effectiveness of our method, we develop an experiment for reconstructing full thermal status of a 16-core processor. Experimental results show that the proposed method significantly outperforms spectral analysis techniques, and can obtain full thermal characterization with an average absolute error of 1.72% using 9 thermal sensors per core.

  • Reduced Complexity Algorithm for QC-LDPC Coded Blind Frame Synchronization

    Yinghao QI  Tao LIU  Mengtian RONG  

     
    LETTER-Fundamental Theories for Communications

      Vol:
    E94-B No:4
      Page(s):
    1057-1061

    In this paper, we propose a reduced complexity algorithm for blind frame synchronization based on code-constraints in a quasi-cyclic low density parity check (QC-LDPC) coded system. It can be used for both hard and soft synchronizers. For soft synchronizers, we present a modified algorithm that achieves better performance at high signal to noise ratio (SNR). Analysis indicates that the proposed algorithm has low complexity for hardware implementation.

  • OTHR Impulsive Interference Suppression in Strong Clutter Background

    Tao LIU  Yu GONG  Yaohuan GONG  

     
    PAPER-Digital Signal Processing

      Vol:
    E92-A No:11
      Page(s):
    2866-2873

    External interferences can severely degrade the performance of an Over-the-horizon radar (OTHR), so suppression of external interferences in strong clutter environment is the prerequisite for the target detection. The traditional suppression solutions usually began with clutter suppression in either time or frequency domain, followed by the interference detection and suppression. Based on this traditional solution, this paper proposes a method characterized by joint clutter suppression and interference detection: by analyzing eigenvalues in a short-time moving window centered at different time position, clutter is suppressed by discarding the maximum three eigenvalues at every time position and meanwhile detection is achieved by analyzing the remained eigenvalues at different position. Then, restoration is achieved by forward-backward linear prediction using interference-free data surrounding the interference position. In the numeric computation, the eigenvalue decomposition (EVD) is replaced by singular values decomposition (SVD) based on the equivalence of these two processing. Data processing and experimental results show its efficiency of noise floor falling down about 10-20 dB.

  • An Edge Dependent Weighted Filter for Video Deinterlacing

    Hao ZHANG  Mengtian RONG  Tao LIU  

     
    LETTER-Image

      Vol:
    E98-A No:2
      Page(s):
    788-791

    In this letter, we propose a new intra-field deinterlacing algorithm based on an edge dependent weighted filter (EDWF). The proposed algorithm consists of three steps: 1) calculating the gradients of three directions (45°, 90°, and 135°) in the local working window; 2) achieving the weights of the neighboring pixels by exploiting the edge information in the pixel gradients; 3) interpolating the missing pixel using the proposed EDWF interpolator. Compared with existing deinterlacing methods on different images and video sequences, the proposed algorithm improves the peak signal-to-noise-ratio (PSNR) while achieving better subjective quality.

  • Recursive Frequency Offset Estimation for MIMO System in Flat-Fading Channels

    Xiaoxu CHEN  Tao LIU  Yaohuan GONG  

     
    LETTER-Digital Signal Processing

      Vol:
    E92-A No:8
      Page(s):
    2124-2128

    This letter presents recursive frequency offset estimation for MIMO (Multiple Input Multiple Output) system in flat-fading channels. With the recursive estimation, the frequency offset range in MIMO system can be extended compared with normal estimation. Simulation results show that the recursive frequency offset estimation is valid for large frequency offset.

  • An Energy-Balancing Unequal Clustering and TDMA-Like Scheduling Mechanism in Wireless Sensor Networks

    Tao LIU  

     
    LETTER-Network

      Vol:
    E95-B No:12
      Page(s):
    3882-3885

    In wireless sensor networks, unbalanced energy consumption and transmission collisions are two inherent problems and can significantly reduce network lifetime. This letter proposes an unequal clustering and TDMA-like scheduling mechanism (UCTSM) based on a gradient sinking model in wireless sensor networks. It integrates unequal clustering and TDMA-like transmission scheduling to balance the energy consumption among cluster heads and reduce transmission collisions. Simulation results show that UCTSM balances the energy consumption among the cluster heads, saves nodes' energy and so improves the network lifetime.

  • A Distributed TDMA-Based Data Gathering Scheme for Wireless Sensor Networks

    Tao LIU  Tianrui LI  Yihong CHEN  

     
    LETTER-Information Network

      Vol:
    E96-D No:9
      Page(s):
    2135-2138

    In this letter, a distributed TDMA-based data gathering scheme for wireless sensor networks, called DTDGS, is proposed in order to avoid transmission collisions, achieve high levels of power conservation and improve network lifetime. Our study is based on corona-based network division and a distributed TDMA-based scheduling mechanism. Different from a centralized algorithm, DTDGS does not need a centralized gateway to assign the transmission time slots and compute the route for each node. In DTDGS, each node selects its transmission slots and next-hop forwarding node according to the information gathered from neighbor nodes. It aims at avoiding transmission collisions and balancing energy consumption among nodes in the same corona. Compared with previous data gathering schemes, DTDGS is highly scalable and energy efficient. Simulation results show high the energy efficiency of DTDGS.

  • An Optimized Low-Power Optical Memory Access Network for Kilocore Systems

    Tao LIU  Huaxi GU  Yue WANG  Wei ZOU  

     
    LETTER-Computer System

      Pubricized:
    2019/02/04
      Vol:
    E102-D No:5
      Page(s):
    1085-1088

    An optimized low-power optical memory access network is proposed to alleviate the cost of microring resonators (MRs) in kilocore systems, such as the pass-by loss and integration difficulty. Compared with traditional electronic bus interconnect, the proposed network reduces power consumption and latency by 80% to 89% and 21% to 24%. Moreover, the new network decreases the number of MRs by 90.6% without an increase in power consumption and latency when making a comparison with Optical Ring Network-on-Chip (ORNoC).

  • Novel Parallel Acceleration Technique for Shooting-and-Bouncing Ray Launching Algorithm

    Haitao LIU  Binhong LI  Dongsheng QI  

     
    LETTER

      Vol:
    E87-C No:9
      Page(s):
    1463-1466

    A novel parallel acceleration technique is proposed based on intrinsic parallelism characteristics of shooting-and-bouncing ray launching (SBR) algorithm, which has been implemented using the MPI parallel library on common PC cluster instead of dedicated parallel machines. The results reveal that the new technique achieves very large speedup gains and could be the efficient and low-cost propagation prediction solution.

  • New Perfect Gaussian Integer Sequences from Cyclic Difference Sets

    Tao LIU  Chengqian XU  Yubo LI  Kai LIU  

     
    LETTER-Information Theory

      Vol:
    E100-A No:12
      Page(s):
    3067-3070

    In this letter, three constructions of perfect Gaussian integer sequences are constructed based on cyclic difference sets. Sufficient conditions for constructing perfect Gaussian integer sequences are given. Compared with the constructions given by Chen et al. [12], the proposed constructions relax the restrictions on the parameters of the cyclic difference sets, and new perfect Gaussian integer sequences will be obtained.

  • Interim CRC: A Novel Method to Read Large-Size Data from Tags in RFID Systems

    Xiaodong DENG  Mengtian RONG  Tao LIU  

     
    PAPER-Network

      Vol:
    E95-B No:1
      Page(s):
    152-159

    Large capacity tags are becoming available to meet the demands of industry, but the UHF RFID protocol is unable to reliably and efficiently read large data sets from tags. First of all, large data sets are not well protected. The tag merely relies on 16-bit CRC for ensuring the validity of up to 4,096-bit user-specific data in EPCglobal C1G2 protocol. Furthermore, the reliability will be even worse if large capacity tags are implemented using semi-active technology which is likely to prevail among sensor-integrated RFID tags. Since semi-active tags greatly alleviate the performance limitation imposed by the turn-on power of the tag chip, backscattering signal of semi-active tags could be a serious challenge for most readers because it is much weaker than signals emitted by passive tags due to longer reading distance. In this paper, Interim CRC is presented to enhance transmission reliability and efficiency when the tag is backscattering a large data set. By taking advantage of Interim CRC, the large data set can be divided into several blocks, and 16-bit checksum is calculated over each block. The tag backscatters all blocks at the first time and only retransmits certain blocks if CRC error occurs in those blocks. The result of simulation shows that the reading error rate can be confined to a preset threshold and the accumulative total of transmitted data are greatly reduced if optimal block size and transmission times are complied with. The simulation also conclusively proves that semi-active tags derive even longer reading range from Interim CRC. In addition, Interim CRC is totally compliant with the EPCglobal C1G2 protocol. It fully makes use of CRC-16 encoder and does not involve any other data encoding schematics and hardware modifications.

  • Energy Consumption Analysis on Gradient Sinking Model in Wireless Sensor Networks

    Tao LIU  Zhishu LI  

     
    LETTER-Network

      Vol:
    E95-B No:2
      Page(s):
    607-610

    In a wireless sensor network based on the gradient sinking model, unbalanced energy consumption is an inherent problem and can significantly reduce the network lifetime. In this letter, we propose a subcorona-based scheme to analyze the amount of received data and energy consumption of nodes on gradient sinking model. We then design an algorithm to compute the energy consumption of nodes in different subcoronas. Simulation results indicate the correctness of our proposed algorithm.

  • Connectivity of Ad Hoc Networks with Random Mobility Models

    Yan-tao LIU  Ying TIAN  Jian-ping AN  Heng LIU  

     
    PAPER-Network

      Vol:
    E97-B No:5
      Page(s):
    952-959

    We analyze the connectivity of simulation ad hoc networks, which use random mobility models. Based on the theorem of minimum degree, the study of connectivity probability is converted into an analysis of the probability of minimum node degree. Detailed numerical analyses are performed for three mobility models: random waypoint model, random direction model, and random walk model. For each model, the connectivity probability is calculated and its relations with the communication range r and the node number n are illustrated. Results of the analyses show that with the same network settings, the connectivity performance decreases in the following order: random walk model, random direction model, and random waypoint model. This is because of the non-uniform node distribution in the last two models. Our work can be used by researchers to choose, modify, or apply a reasonable mobility model for network simulations.

  • Constructions of Zero Correlation Zone Sequence Sets with Low Cross-Correlation Property

    Tao LIU  Chengqian XU  Yubo LI  

     
    LETTER-Information Theory

      Vol:
    E100-A No:7
      Page(s):
    1583-1587

    This letter proposes a class of polyphase zero correlation zone (ZCZ) sequence sets with low inter-set cross-correlation property. The proposed ZCZ sequence sets are constructed from DFT matrices and r-coincidence sequences. Each ZCZ sequence set is optimal, and the absolute value of the cross-correlation function of sequences from different sets is less than or equal to $rsqrt{N}$, where N denotes the length of each sequence. These ZCZ sequence sets are suitable for multiuser environments.

  • A Reliable Tag Anti-Collision Algorithm for Mobile Tags

    Xiaodong DENG  Mengtian RONG  Tao LIU  

     
    LETTER-Information Network

      Vol:
    E95-D No:5
      Page(s):
    1527-1530

    As RFID technology is being more widely adopted, it is fairly common to read mobile tags using RFID systems, such as packages on conveyer belt and unit loads on pallet jack or forklift truck. In RFID systems, multiple tags use a shared medium for communicating with a reader. It is quite possible that tags will exit the reading area without being read, which results in tag leaking. In this letter, a reliable tag anti-collision algorithm for mobile tags is proposed. It reliably estimates the expectation of the number of tags arriving during a time slot when new tags continually enter the reader's reading area and no tag leaves without being read. In addition, it gives priority to tags that arrived early among read cycles and applies the expectation of the number of tags arriving during a time slot to the determination of the number of slots in the initial inventory round of the next read cycle. Simulation results show that the reliability of the proposed algorithm is close to that of DFSA algorithm when the expectation of the number of tags entering the reading area during a time slot is a given, and is better than that of DFSA algorithm when the number of time slots in the initial inventory round of next read cycle is set to 1 assuming that the number of tags arriving during a time slot follows Poisson distribution.

  • New Constructions of Multiple Binary ZCZ Sequence Sets with Inter-Set Zero Cross-Correlation Zone

    Tao LIU  Chengqian XU  Yubo LI  Xiaoyu CHEN  

     
    PAPER-Information Theory

      Vol:
    E100-A No:12
      Page(s):
    3007-3015

    In this correspondence, two types of multiple binary zero correlation zone (ZCZ) sequence sets with inter-set zero cross-correlation zone (ZCCZ) are constructed. Based on orthogonal matrices with order N×N, multiple binary ZCZ sequence sets with inter-set even and odd ZCCZ lengthes are constructed, each set is an optimal ZCZ sequence set with parameters (2N2, N, N+1)-ZCZ, among these ZCZ sequence sets, sequences possess ideal cross-correlation property within a zone of length 2Z or 2Z+1. These resultant multiple ZCZ sequence sets can be used in quasi-synchronous CDMA systems to remove the inter-cell interference (ICI).

  • Analysis to Random Direction Model of Ad-Hoc Networks

    Yan-tao LIU  Ji-hua LU  Heng LIU  

     
    LETTER-Network

      Vol:
    E93-B No:10
      Page(s):
    2773-2776

    The asymptotic properties of node distribution and speed distribution in random direction model were analyzed, respectively, by the tools of geometric probability and palm calculus. The probability density function for node distribution in circular regions was obtained which indicated that mobile nodes tended to disperse as simulation advancing. The speed decay phenomenon was confirmed in this model. Moreover, the hypostasis of speed decay was proved to be the correlation between speed and duration within any movement period.