Yuhui Song | Searcharxiv

arXiv2024

Channel Estimation, Interpolation and Extrapolation in Doubly-dispersive Channels

The OTFS (Orthogonal Time Frequency Space) is widely acknowledged for its ability to combat Doppler spread in time-varying channels. In this paper, another advantage of OTFS over OFDM (Orthogonal Frequency Division Multiplexing) will be demonstrated: much reduced channel training overhead. Specifically, the sparsity of the channel in delay-Doppler (D-D) domain implies strong correlation of channel gains in time-frequency (T-F) domain, which can be harnessed to reduce channel training overhead through interpolation. An immediate question is how much training overhead is needed in doubly-dispersive channels? A conventional belief is that the overhead is only dependent on the product of delay and Doppler spreads, but we will show that it's also dependent on the T-F window size. The finite T-F window leads to infinite spreading in D-D domain, and aliasing will be inevitable after sampling in T-F domain. Two direct consequences of the aliasing are increased channel training overhead and interference. Another factor contributing to channel estimation error is the inter-symbol-carrier-interference (ISCI), resulting from the uncertainty principle. Both aliasing and ISCI are considered in channel modelling, a low-complexity algorithm is proposed for channel estimation and interpolation through FFT. A large T-F window is necessary for reduced channel training overhead and aliasing, but increases processing delay. Fortunately, we show that the proposed algorithm can be implemented in a pipeline fashion. Further more, we showed that data-aided channel tracking is possible in D-D domain to further reduce the channel estimation frequency, i.e., channel extrapolation. The impacts of aliasing and ISCI on channel interpolation error are analyzed.

eess.SP↗

arXiv2022

AGMR-Net: Attention Guided Multiscale Recovery framework for stroke segmentation

Automatic and accurate lesion segmentation is critical for clinically estimating the lesion statuses of stroke diseases and developing appropriate diagnostic systems. Although existing methods have achieved remarkable results, further adoption of the models is hindered by: (1) inter-class indistinction, the normal brain tissue resembles the lesion in appearance. (2) intra-class inconsistency, large variability exists between different areas of the lesion. To solve these challenges in stroke segmentation, we propose a novel method, namely Attention Guided Multiscale Recovery framework (AGMR-Net) in this paper. Firstly, a coarse-grained patch attention module in the encoding is adopted to get a patch-based coarse-grained attention map in a multi-stage explicitly supervised way, enabling target spatial context saliency representation with a patch-based weighting technique that eliminates the effect of intra-class inconsistency. Secondly, to obtain a more detailed boundary partitioning to solve the challenge of the inter-class indistinction, a newly designed cross-dimensional feature fusion module is used to capture global contextual information to further guide the selective aggregation of 2D and 3D features, which can compensate for the lack of boundary learning capability of 2D convolution. Lastly, in the decoding stage, an innovative designed multi-scale deconvolution upsampling instead of linear interpolation enhances the recovery of target space and boundary information. The AGMR-Net is evaluated on the open dataset Anatomical Tracings of Lesions-After-Stroke (ATLAS), achieving the highest dice similarity coefficient (DSC) score of 0.594, Hausdorff distance of 27.005 mm, and average symmetry surface distance of 7.137 mm, which demonstrate that our proposed method outperforms other state-of-the-art methods and has great potential in the diagnosis of stroke.

cs.CV↗