pith. sign in

arxiv: 1906.10848 · v1 · pith:RGQQSBBMnew · submitted 2019-06-26 · 📡 eess.SP · cs.IT· math.IT

Low-Complexity Equalization of MIMO-OSDM

Jing Han , Shengqian Ma , Yujie Wang , Geert Leus This is my paper

Pith reviewed 2026-05-25 15:36 UTC · model grok-4.3

classification 📡 eess.SP cs.ITmath.IT
keywords MIMO-OSDMlow-complexity equalizationchannel matrix structuretime-invariant channelstime-varying channelslinear complexityper-vector equalizationblock equalization
0
0 comments X

The pith

MIMO-OSDM equalization algorithms achieve linear complexity by exploiting channel matrix structures for both time-invariant and time-varying channels.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper addresses the high computational cost of direct equalization in MIMO-OSDM systems, which otherwise offer benefits in peak-to-average power ratio reduction and spectral efficiency over OFDM. It proposes per-vector equalization for time-invariant channels and block equalization for time-varying channels. These methods reduce complexity from cubic to linear in the transformed domain by using the inherent structures of the MIMO-OSDM channel matrices. Simulations confirm that the reduced-complexity approaches maintain performance comparable to full-complexity methods.

Core claim

Low-complexity per-vector and block equalization algorithms are derived for MIMO-OSDM that achieve only linear complexity in the transformed domain by exploiting the specific structures present in the channel matrix for time-invariant and time-varying channels respectively.

What carries the argument

The channel matrix structures of MIMO-OSDM that permit per-vector and block equalization with linear complexity in the transformed domain.

If this is right

  • Per-vector equalization suffices for time-invariant MIMO-OSDM channels at linear cost.
  • Block equalization suffices for time-varying MIMO-OSDM channels at linear cost.
  • The linear-complexity methods remain valid across the channel conditions tested in the simulations.
  • MIMO-OSDM becomes more feasible for hardware implementations that cannot afford cubic complexity.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same matrix-structure approach could be tested on other multicarrier schemes that share similar block-diagonal or circulant properties.
  • Hardware prototypes could measure actual power savings when replacing cubic equalizers with these linear ones in real-time MIMO-OSDM links.
  • If the structures generalize, the method might apply to related systems such as MIMO-OFDM variants with analogous channel representations.

Load-bearing premise

The MIMO-OSDM channel matrices contain exploitable structures that allow the proposed algorithms to reach linear complexity while preserving the performance of direct cubic-complexity equalization on the targeted channel types.

What would settle it

A direct comparison on the same MIMO-OSDM channels showing that the linear-complexity algorithms produce substantially higher symbol error rates than a full cubic-complexity matrix inversion would falsify the claim.

Figures

Figures reproduced from arXiv: 1906.10848 by Geert Leus, Jing Han, Shengqian Ma, Yujie Wang.

Figure 1
Figure 1. Figure 1: An example of the TI channel matrix structures of [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 3
Figure 3. Figure 3: An example of the TV channel matrix structures with [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: BER performance of MIMO-OSDM equalization over TI channels. [PITH_FULL_IMAGE:figures/full_fig_p004_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: BER performance of MIMO-OSDM equalization over TV channels. [PITH_FULL_IMAGE:figures/full_fig_p004_5.png] view at source ↗
read the original abstract

Orthogonal signal-division multiplexing (OSDM) is an attractive alternative to conventional orthogonal frequency-division multiplexing (OFDM) due to its enhanced ability in peak-to-average power ratio (PAPR) reduction. Combining OSDM with multiple-input multiple-output (MIMO) signaling has the potential to achieve high spectral and power efficiency. However, a direct channel equalization in this case incurs a cubic complexity, which may be expensive for practical use. To solve the problem, low-complexity per-vector and block equalization algorithms of MIMO-OSDM are proposed in this paper for time-invariant and time-varying channels, respectively. By exploiting the channel matrix structures, these algorithms have only a linear complexity in the transformed domain. Simulation results demonstrate their validity and the related performance comparisons.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The manuscript proposes low-complexity per-vector and block equalization algorithms for MIMO-OSDM systems. For time-invariant channels a per-vector equalizer is derived; for time-varying channels a block equalizer is derived. Both are claimed to achieve linear complexity in the transformed domain by exploiting special structures present in the MIMO-OSDM channel matrix, with simulation results offered as validation.

Significance. If the claimed linear-complexity equalizers can be shown to preserve the performance of direct (cubic-complexity) equalization, the work would be of practical value for MIMO-OSDM deployments, especially in scenarios where cubic complexity is prohibitive.

major comments (1)
  1. [Abstract] Abstract: the central claim that the algorithms attain only linear complexity 'by exploiting the channel matrix structures' is presented without any explicit matrix form, transformation, or complexity-counting argument. Because the reduction from O(N^3) to O(N) is the load-bearing contribution, the absence of this derivation leaves the claim unsupported.
minor comments (1)
  1. [Abstract] The abstract mentions 'simulation results' but supplies neither the channel models, SNR ranges, nor any quantitative performance metrics; these details should appear in the abstract or be cross-referenced to a results section.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for highlighting the need for clarity in the abstract regarding the complexity reduction. The detailed derivations appear in the body of the manuscript; we address the specific point below and indicate where a revision is appropriate.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claim that the algorithms attain only linear complexity 'by exploiting the channel matrix structures' is presented without any explicit matrix form, transformation, or complexity-counting argument. Because the reduction from O(N^3) to O(N) is the load-bearing contribution, the absence of this derivation leaves the claim unsupported.

    Authors: The abstract is a high-level summary. The explicit MIMO-OSDM channel matrix after the OSDM transform, the resulting diagonal (time-invariant case) or block-diagonal (time-varying case) structures, and the O(N) complexity count via element-wise operations are derived and counted in Sections III and IV. These sections show that the per-vector equalizer reduces to N independent scalar divisions and the block equalizer to N independent small-matrix inversions whose size is independent of N. We agree that a brief reference to the key transformation could strengthen the abstract and will add one sentence to that effect. revision: partial

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper derives low-complexity per-vector and block equalizers for MIMO-OSDM by exploiting explicit structures in the channel matrix after basis transformation, yielding linear complexity for both time-invariant and time-varying cases. This follows standard linear-algebraic reductions (diagonalization or block-diagonalization) that are independent of the target result and do not reduce to fitted parameters, self-citations, or definitional equivalence. No load-bearing step in the abstract or described approach collapses by construction to its own inputs; the claim remains externally falsifiable via simulation on the stated channel types.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No free parameters, axioms, or invented entities are identifiable from the abstract; the work is algorithmic and relies on standard linear algebra assumptions implicit in equalization.

pith-pipeline@v0.9.0 · 5659 in / 1051 out tokens · 18951 ms · 2026-05-25T15:36:20.016735+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

9 extracted references · 9 canonical work pages

  1. [1]

    An overview of MIMO communications - a key to gigabit wireless,

    A. J. Paulraj, D. A. Gore, R. U. Nabar, and H. Bolcskei, “An overview of MIMO communications - a key to gigabit wireless,” Proc. IEEE, vol. 92, no. 2, pp. 198–218, Feb. 2004

    work page 2004

  2. [2]

    An ADMM approach for PAPR reduction for large-scale MIMO-OFDM systems,

    H. Bao, J. Fang, Q. Wan, Z. Chen, and T. Jiang, “An ADMM approach for PAPR reduction for large-scale MIMO-OFDM systems,” IEEE Trans. V eh. Technol., vol. 67, no. 8, pp. 7407–7418, Aug 2018

    work page 2018

  3. [3]

    Underwater acoustic communication with an orthogonal signal division multiplexing scheme in doubly spread channels,

    T. Ebihara and K. Mizutani, “Underwater acoustic communication with an orthogonal signal division multiplexing scheme in doubly spread channels,” IEEE J. Ocean. Eng. , vol. 39, no. 1, pp. 47–58, Jan. 2014

    work page 2014

  4. [4]

    Doppler-resilient orthogonal signal-division multiplexing for underwater acoustic communication,

    T. Ebihara and G. Leus, “Doppler-resilient orthogonal signal-division multiplexing for underwater acoustic communication,” IEEE J. Ocean. Eng., vol. 41, no. 2, pp. 408–427, Apr. 2016

    work page 2016

  5. [5]

    Iterative per-vector equal- ization for orthogonal signal-division multiplexing over time-varying underwater acoustic channels,

    J. Han, S. Chepuri, Q. Zhang, and G. Leus, “Iterative per-vector equal- ization for orthogonal signal-division multiplexing over time-varying underwater acoustic channels,” IEEE J. Ocean. Eng. , vol. 44, no. 1, pp. 240–255, Jan. 2019

    work page 2019

  6. [6]

    Low-complexity equalization of orthogonal signal-division multiplexing in doubly-selective channels,

    J. Han, L. Zhang, Q. Zhang, and G. Leus, “Low-complexity equalization of orthogonal signal-division multiplexing in doubly-selective channels,” IEEE Trans. Signal Process. , vol. 67, no. 4, pp. 915–929, Feb. 2019

    work page 2019

  7. [7]

    On performance of vector OFDM with linear receivers,

    Y . Li, I. Ngebani, X.-G. Xia, and A. Host-Madsen, “On performance of vector OFDM with linear receivers,” IEEE Trans. Signal Process., vol. 60, no. 10, pp. 5268–5280, Oct. 2012

    work page 2012

  8. [8]

    Space-time and space-frequency block coded vector OFDM modulation,

    J. Han and G. Leus, “Space-time and space-frequency block coded vector OFDM modulation,” IEEE Commun. Lett. , vol. 21, no. 1, pp. 204–207, Jan. 2017

    work page 2017

  9. [9]

    Underwater acoustic commu- nication using multiple-input multiple-output doppler-resilient orthogonal signal division multiplexing,

    T. Ebihara, G. Leus, and H. Ogasawara, “Underwater acoustic commu- nication using multiple-input multiple-output doppler-resilient orthogonal signal division multiplexing,” in Proc. OCEANS Conf. , May 2018, pp. 1–4

    work page 2018