Multi-Block UAMP-Based Detection for OTFS With Rectangular Waveform

Liu, Fei; Yuan, Zhengdao; Guo, Qinghua; Wang, Zhongyong; Sun, Peng

doi:10.1109/lwc.2021.3126871

Cited by 11 publications

(6 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the nonlinear method, we consider three message-passing based equalization methods, which are marked as "mp," "uamp," and "vamp" in the figures, respectively. For the sphere-decoding based methods, we consider the three versions which are marked as "sd0," "sd1," and "sd2" in the 3 "uamp" The UAMP method [13] 4 "vamp" The VAMP method [14] 5 "sd0-bf" The proposed Algorithm 1 with breadth-first tree-search 6 "sd0-df" The proposed Algorithm 1 with depth-first tree-search 7 "sd0-mf" The proposed Algorithm 1 with metric-first tree-search 8 "sd1-bf" The proposed Algorithm 2 with breadth-first tree-search 9 "sd2-bf" The proposed Algorithm 3 with breadth-first tree-search figures, respectively. Additionally, we consider all these treesearch strategies and mark them as "b," "df," and "mf" in the figures, respectively.…”

Section: Simulation Settingsmentioning

confidence: 99%

“…So the complexity of each iteration of the “mp” method is actually

\mathcal {O}(N^2M^2Q)

for the parameter configurations considered in this work. For the “uamp” or “vamp” method, the complexity of each iteration is

\mathcal {O}(NM^2 + NMQ)

[13, 14]. We compare the complexity functions (that is, the parts in the parentheses) of these methods in Figure 7, where the horizontal axis represents the number of iterations, and the parameters are

M=16

N=4

Q=16

, and

K=100

.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…The second category is the nonlinear methods. Most proposed nonlinear method are the message-passing based methods, for example, the message passing (MP) method [2], the unitary approximate message passing (UAMP) method [13], the variational approximate message passing (VAMP) method [14], etc. This work will mainly consider the nonlinear methods.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Sphere‐decoding based equalization for reduced‐zero‐padding orthogonal time frequency space modulation

Zhang

2022

IET Communications

View full text Add to dashboard Cite

This work studies the equalization methods for the reduced zero-padding version of the orthogonal time frequency space modulation. Here, the focus is on applications in low data rate scenarios such as the Internet of Things, and the case where the number of subcarriers and time slots are small will be considered. First, the system equation is established to model the inter-subcarrier and inter-slot interference phenomena. Based on the system model, three sphere-decoding based equalization methods are proposed. The first method is to directly apply the sphere-decoding algorithm on the full-scale system model; for the second method, the transmitter needs to perform the triangular precoding; and for the third method, the transmitter needs to perform the diagonal precoding. Simulation results show that the proposed sphere-decoding based methods achieve better bit error rate performance than the state-of-the-art methods like message passing, unitary approximate message passing, and variational approximate message passing, especially when the channel has severe inter-slot interference. INTRODUCTIONOrthogonal time frequency space (OTFS) has been proposed as a promising modulation technology for high-mobility scenarios [1], which spreads data symbols over both the delay and Doppler domain, resulting in better performance compared with orthogonal frequency division multiplexing (OFDM). Many studies have been conducted covering various aspects of OTFS [2-6] such as receiver design, channel estimation, performance analysis, and multi-antenna combination, etc. Similar to OFDM, OTFS also needs to use the prefix. Basically, there are two versions of OTFS according to the way of This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

Section: Simulation Settingsmentioning

confidence: 99%

“…So the complexity of each iteration of the “mp” method is actually

\mathcal {O}(N^2M^2Q)

for the parameter configurations considered in this work. For the “uamp” or “vamp” method, the complexity of each iteration is

\mathcal {O}(NM^2 + NMQ)

M=16

N=4

Q=16

, and

K=100

.…”

Section: Performance Evaluationmentioning

confidence: 99%

See 1 more Smart Citation

Sphere‐decoding based equalization for reduced‐zero‐padding orthogonal time frequency space modulation

Zhang

2022

IET Communications

View full text Add to dashboard Cite

show abstract

“…Next-generation wireless communication systems are expected to communicate reliably via high-mobility channels even in the face of severe inter-carrier interference (ICI) and inter-symbol interference (ISI) [5], [17]. With this in mind, orthogonal time-frequency space (OTFS) modulation has been proposed as an attractive candidate for next-generation wireless communications [4], [8], [13], [19], where the information bits are modulated in the delay-Doppler (DD) domain. Then the two-dimensional orthogonal basis functions of inverse fast Fourier transform (IFFT) and FFT are employed along in the delay and Doppler domains, respectively, for spreading the DD domain symbols across the whole time-frequency (TF) domain.…”

Section: Introductionmentioning

confidence: 99%

Performance Analysis and Approximate Message Passing Detection of Orthogonal Time Sequency Multiplexing Modulation

Sui

Yan

Zhang

et al. 2024

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

In orthogonal time sequency multiplexing (OTSM) modulation, the information symbols are conveyed in the delaysequency domain upon exploiting the inverse Walsh Hadamard transform (IWHT). It has been shown that OTSM is capable of attaining a bit error ratio (BER) similar to that of orthogonal time-frequency space (OTFS) modulation at a lower complexity, since the saving of multiplication operations in the IWHT. Hence we provide its BER performance analysis and characterize its detection complexity. We commence by deriving its generalized input-output relationship and its unconditional pairwise error probability (UPEP). Then, its BER upper bound is derived in closed form under both ideal and imperfect channel estimation conditions, which is shown to be tight at moderate to high signal-to-noise ratios (SNRs). Moreover, a novel approximate message passing (AMP) aided OTSM detection framework is proposed. Specifically, to circumvent the high residual BER of the conventional AMP detector, we proposed a vector AMP-based expectation-maximization (VAMP-EM) detector for performing joint data detection and noise variance estimation. The variance auto-tuning algorithm based on the EM algorithm is designed for the VAMP-EM detector to further improve the convergence performance. The simulation results illustrate that the VAMP-EM detector is capable of striking an attractive BER vs. complexity trade-off than the state-of-the-art schemes as well as providing a better convergence. Finally, we propose AMP and VAMP-EM turbo receivers for low-density parity-check (LDPC)coded OTSM systems. It is demonstrated that our proposed VAMP-EM turbo receiver is capable of providing both BER and convergence performance improvements over the conventional AMP solution.

show abstract

“…Moreover, in [11], an improved approximate message passing (AMP) detection algorithm was conceived, which outperforms the traditional AMP algorithm. In [12], a multi-block unitary approximate message passing (UAMP) detection algorithm was designed by partitioning a large timedomain channel matrix into several sub-matrices. In [13], a maximal ratio combining receiver was proposed to blockwisely detect symbols.…”

Section: Introductionmentioning

confidence: 99%

Optimal Low-Complexity Orthogonal Block Based Detection of OTFS for Low-Dispersion Channels

Liu

Ding

et al. 2023

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Orthogonal time frequency space (OTFS) modulation constitutes a promising technology for high-mobility scenarios. However, the detection of OTFS systems imposes substantial complexity. Hence, we propose a novel orthogonal block (OB) based detection scheme for significantly reducing the OTFS detection complexity without any performance loss with integer Doppler shifts. This is achieved by recognizing that the received signal can be partitioned into multiple parallel orthogonal blocks. Therefore, the detection of data symbols within an orthogonal block only depends on the signals received within this orthogonal block with reduced dimension. Explicitly, we propose a graph theory based orthogonal block identification algorithm, which models the relationship between the received signal and the original information symbols as a bipartite graph, where a depth first search (DFS) algorithm is invoked for partitioning the received signals into orthogonal blocks. For each orthogonal block, the existing detection algorithms can be used. Since the size of orthogonal blocks may be much lower than that of the original received signals, the detection complexity can be significantly reduced. For example, the complexity of the OB based MMSE detector is approximately a factor 4096 lower than that of the traditional MMSE detector for a channel having two paths.

show abstract

Multi-Block UAMP-Based Detection for OTFS With Rectangular Waveform

Cited by 11 publications

References 17 publications

Sphere‐decoding based equalization for reduced‐zero‐padding orthogonal time frequency space modulation

Sphere‐decoding based equalization for reduced‐zero‐padding orthogonal time frequency space modulation

Performance Analysis and Approximate Message Passing Detection of Orthogonal Time Sequency Multiplexing Modulation

Optimal Low-Complexity Orthogonal Block Based Detection of OTFS for Low-Dispersion Channels

Contact Info

Product

Resources

About