One4All-ST: Unified Spatio-Temporal Framework

• One4All-ST is a unified framework that addresses arbitrary modifiable areal units by using a single hierarchical model to eliminate inconsistencies in spatio-temporal prediction.
• It integrates multi-scale network design with dynamic programming and extended quad-tree indexing to achieve efficient and precise region-wise predictions.
• In wireless communications, the One4All-ST principle underpins full-rate space-time block coding, ensuring robust performance across varied receive antenna counts and hybrid deployments.

One4All-ST denotes a unification strategy for ST problems in which a single model or code is designed to remain effective across heterogeneous operating conditions without switching schemes. In explicit contemporary usage, One4All-ST is a framework for spatio-temporal prediction over arbitrary Modifiable Areal Units (MAUs) that uses one hierarchical multi-scale network, a dynamic-programming optimal-combination solver, and an extended quad-tree index (Chen et al., 2024). In wireless communications, the same unification idea appears in a single 4-transmit space-time block code (STBC) that remains full-rate for arbitrary $n_r$ through puncturing (Srinath et al., 2010), and in algebraic hybrid satellite–terrestrial space-time designs whose broader interpretation aligns with a One4All-ST philosophy, although that paper itself uses the term algebraic hybrid ST/SF codes rather than “One4All-ST” (Hollanti et al., 2011).

1. Terminological scope and unifying idea

In the spatio-temporal prediction literature, One4All-ST is the name of a unified framework that answers prediction queries for arbitrary MAUs using only one model and an auxiliary index. Its motivation is explicit: fixed-partition ST models require multiple models for different region specifications and scales, and predictions produced under different partitions can conflict because of the Modifiable Areal Unit Problem (MAUP) (Chen et al., 2024).

In the MIMO coding literature, the same phrase is not used uniformly in paper titles, but the underlying design objective is analogous. A 4-transmit full-rate STBC is described as a single “One4All” encoder $S_4(s_1,\dots,s_{16})$ that serves any number of receive antennas by puncturing layers, while preserving rate $\min(4,n_r)$ and reduced ML-decoding complexity (Srinath et al., 2010). In hybrid satellite–terrestrial broadcasting, the 4×2 code $L2$ and the 3×2 code $L3$ are presented as robust algebraic constructions for SFN deployment, and the accompanying summary explicitly states that they instantiate a One4All-ST principle through explicit SAT–TER layering, joint non-vanishing determinant (NVD), and robustness under SAT–TER power imbalance, even though the original paper does not use the label itself (Hollanti et al., 2011).

A plausible common denominator is universality under operational variation. In the urban-prediction setting, the variation is over query regions and scales; in the STBC setting, it is over receive-antenna counts; in hybrid broadcasting, it is over SAT–TER coverage balance, SFN/MFN operation, and site-specific attenuation.

2. Arbitrary-MAU spatio-temporal prediction problem

One4All-ST for prediction is defined on a hierarchical grid. The area of interest is evenly partitioned into atomic grids forming Layer 1 with resolution $H \times W$. Lower-resolution layers are constructed by merging $K \times K$ adjacent grids with stride $K$, producing Layer $l$ with resolution $H_l \times W_l$ and scale factor $S_4(s_1,\dots,s_{16})$0. The hierarchy is written as $S_4(s_1,\dots,s_{16})$1, where $S_4(s_1,\dots,s_{16})$2 denotes the atomic scale and $S_4(s_1,\dots,s_{16})$3 is the coarsest scale (Chen et al., 2024).

At time $S_4(s_1,\dots,s_{16})$4 and layer $S_4(s_1,\dots,s_{16})$5, citywide crowd flow is represented as $S_4(s_1,\dots,s_{16})$6, where $S_4(s_1,\dots,s_{16})$7 is the number of flow measurements per grid. An arbitrary polygon region $S_4(s_1,\dots,s_{16})$8 is rasterized against the atomic grid through a binary assignment matrix $S_4(s_1,\dots,s_{16})$9, with

$\min(4,n_r)$0

The notation $\min(4,n_r)$1 makes the rasterization explicit (Chen et al., 2024).

The multi-scale learning target is to predict citywide flows at every scale in the hierarchy:

$\min(4,n_r)$2

The region-query problem is stricter. Given arbitrary rasterized regions $\min(4,n_r)$3, the aim is to minimize

$\min(4,n_r)$4

where $\min(4,n_r)$5 is produced by optimally combining multi-scale predictions over subregions that tile $\min(4,n_r)$6 (Chen et al., 2024).

This formulation directly targets the two pitfalls of fixed partitions. Aggregating predictions from a single fine-grained model tends to underperform compared with direct predictions at coarse scales, while training separate models per scale is costly and may produce inconsistent outputs. One4All-ST addresses both issues by constructing one hierarchical predictor and a separate optimal-combination layer that assembles predictions for arbitrary MAUs (Chen et al., 2024).

3. Network architecture and scale-balanced learning

The One4All-ST network consists of four modules: Temporal Modeling, Hierarchical Spatial Modeling, Cross-scale Modeling, and Multi-task Learning with Scale Normalization (Chen et al., 2024).

Temporal Modeling follows a closeness/period/trend decomposition. Three temporal slices are formed from atomic-scale observations:

$\min(4,n_r)$7

$\min(4,n_r)$8

$\min(4,n_r)$9

Each slice is processed by a non-shared convolutional block to $L2$0 channels, and the outputs are concatenated:

$L2$1

The reported implementation uses 17 historical observations: 6 closeness, 7 daily at 24-hour intervals, and 4 weekly at 144-hour intervals (Chen et al., 2024).

Hierarchical Spatial Modeling proceeds layer by layer. The scale merging layer groups features in each $L2$2 block and applies a linear reduction implemented as $L2$3 with kernel $L2$4 and stride $L2$5, denoted $L2$6. A spatial modeling block then processes the merged representation. The paper adopts an SEBlock, although ConvBlock and ResBlock are discussed as alternatives. For scale $L2$7,

$L2$8

This yields the set of multi-scale features $L2$9 (Chen et al., 2024).

Cross-scale Modeling adds a top-down pathway in Feature Pyramid Network style:

$L3$0

with $L3$1. Each scale then has its own MLP head, without parameter sharing across scales:

$L3$2

The reported hierarchy is $L3$3 with merging window $L3$4 (Chen et al., 2024).

A central technical issue is that coarse-scale targets are much larger in magnitude than fine-scale targets. Instead of manual task weighting, One4All-ST uses scale-wise normalization:

$L3$5

The total training loss is then

$L3$6

and inference reverses the normalization by $L3$7 in original units (Chen et al., 2024).

4. Optimal combination, dynamic programming, and extended quad-tree indexing

The query-time problem is not merely to aggregate predictions but to choose the best multi-scale decomposition for a given MAU. One4All-ST formalizes this through a scale-wise assignment set $L3$8, where each $L3$9 is mapped to atomic resolution by

$H \times W$0

Here $H \times W$1 denotes inclusion by union, $H \times W$2 denotes inclusion by subtraction, and $H \times W$3 denotes exclusion. The combination must reconstruct the rasterized region exactly:

$H \times W$4

The optimal combination minimizes the region prediction error subject to this reconstruction constraint (Chen et al., 2024).

The analysis begins with the union-only case. If a rasterized region $H \times W$5 is decomposed into fine-grained non-overlapping hierarchical grids $H \times W$6 using a coarse-to-fine procedure that prevents mergeability into coarser ones, Theorem 1 states:

$H \times W$7

This converts the original global combinatorial search into searches over individual hierarchical grids (Chen et al., 2024).

For a quad-tree node $H \times W$8 at scale $H \times W$9, let $K \times K$0 be the predicted error of using that coarse grid directly, and let $K \times K$1 be the minimal error over all exact coverings of $K \times K$2. The dynamic-programming recurrence is

$K \times K$3

with base case $K \times K$4 at the finest scale. The lemma on search order shows that once $K \times K$5 is known at layer $K \times K$6, computing $K \times K$7 at layer $K \times K$8 requires only the comparison between “use $K \times K$9 directly” and “sum of children.” The resulting complexity is $K$0, compared with a naive union-only search of $K$1 (Chen et al., 2024).

One4All-ST then augments the search space with subtraction. Each non-leaf node may include not only 4 single-grid children but also 8 multi-grid children, for a total of up to 12 children. For a multi-grid $K$2,

$K$3

Theorem 2 states that allowing subtraction produces solutions that are at least as good as union-only, because the candidate set is a strict superset (Chen et al., 2024).

The serving structure is an extended quad-tree. Each node stores a unique grid code; metadata including scale $K$4, spatial extent, $K$5 and $K$6; the precomputed $K$7; its predicted error cost $K$8; and pointers to child codes. After training, dynamic programming runs offline, and the optimal combinations together with normalization parameters are stored in HBase. Query resolution for an arbitrary polygon consists of rasterization, coarse-to-fine decomposition, grid-code encoding, $K$9 retrieval from the extended quad-tree, inverse normalization of the required scale predictions, union/subtraction materialization, and final summation into $l$0 (Chen et al., 2024).

By construction, exact tilings and exact complements under the hierarchy ensure that the resulting multi-scale composition covers the rasterized query region exactly. This is the mechanism by which the framework addresses scale inconsistency in the MAUP setting (Chen et al., 2024).

5. Empirical results, efficiency, and stated limitations of the prediction framework

The empirical study uses two real-world datasets. Taxi NYC contains 36M records from January to March 2013, with hourly demand on an atomic 128×128 grid at 150m×150m resolution. Freight Transport contains 7M orders from October 2020 to August 2021, also on a 128×128 grid at 150m×150m. The hierarchy is $l$1 with $l$2. Evaluations are reported as RMSE and MAPE across four MAU tasks per dataset (Chen et al., 2024).

On Taxi NYC, One4All-ST reports RMSE 17.48 and MAPE 0.104 on Task 1, RMSE 22.74 and MAPE 0.099 on Task 2, RMSE 44.45 and MAPE 0.099 on Task 3, and RMSE 110.2 and MAPE 0.082 on Task 4. The paper states that Task 3 shows up to 10.6% RMSE improvement over the best baseline, exemplified by GraphWaveNet at RMSE 49.72 and MAPE 0.104. On Freight Transport, the reported results are RMSE 1.649 and MAPE 0.330 on Task 1, RMSE 1.798 and MAPE 0.331 on Task 2, RMSE 2.181 and MAPE 0.336 on Task 3, and RMSE 3.778 and MAPE 0.275 on Task 4 (Chen et al., 2024).

The baseline set includes ST-ResNet, GraphWaveNet, ST-MGCN, GMAN, STRN, STMeta, XGBoost, History Mean, and the bi-scale baseline MC-STGCN. The paper also evaluates enhanced multi-scale variants M-ST-ResNet and M-STRN, which are trained separately per scale and then combined with One4All-ST’s optimal-combination solver (Chen et al., 2024).

Efficiency is a prominent part of the claim set. For the six-scale hierarchy, One4All-ST has about 0.72M parameters, compared with STRN at 0.88M, MC-STGCN at 1.68M, M-ST-ResNet at $l$3, and M-STRN at $l$4. On Taxi NYC, training takes 25.54 sec/epoch and inference 3.65 sec. Query-time response with decomposition plus indexing has mean latency under 2 ms and maximum latency below 20 ms across tasks and both datasets. The extended quad-tree index is approximately 66 MB for NYC and approximately 64 MB for Freight, which the paper characterizes as suitable for single-server deployment (Chen et al., 2024).

Ablation studies isolate two components. Removing hierarchical spatial modeling degrades coarse-scale performance; on Taxi NYC Task 4, RMSE rises from 110.2 to 125.0, approximately 11.8% worse. Replacing per-scale normalization with a single normalization across all scales severely harms fine-scale performance; on Taxi NYC Task 1, RMSE increases from 17.48 to 34.59. The comparison of query-decomposition strategies shows average RMSE improvements from Direct to Union and then to Union + Subtraction, for example on Task 4: 113.8 → 110.6 → 110.2 (Chen et al., 2024).

The paper also states explicit assumptions and limitations. The method assumes a pre-decided hierarchical grid structure based on regular $l$5 merging, here $l$6, and stationarity of normalization parameters over training and inference periods. Subtraction augmentation only considers complements under the parent grid, not arbitrary polygonal complements. The model uses Euclidean grid convolutions and does not incorporate irregular partitions or explicit long-range graph relations. Proposed extensions include learning optimal hierarchical structures under resource constraints, integrating graph-based modules, adding dynamic external covariates, probabilistic prediction with uncertainty quantification, and adaptive indexing for evolving cities and streaming queries (Chen et al., 2024).

6. Full-rate 4-transmit STBC as a one-for-all space-time design

In the 4-transmit MIMO setting, the “one-for-all” interpretation refers to a single 4-antenna STBC design that serves arbitrary receive-antenna counts through puncturing while retaining full rate $l$7 complex symbols per channel use (Srinath et al., 2010). The system uses block length $l$8, so the transmitted codeword is a 4×4 matrix. The schedule is $l$9 complex symbols for $H_l \times W_l$0, $H_l \times W_l$1 for $H_l \times W_l$2, $H_l \times W_l$3 for $H_l \times W_l$4, and $H_l \times W_l$5 for $H_l \times W_l$6 (Srinath et al., 2010).

The construction is based on four pairwise anticommuting, unitary, skew-Hermitian 4×4 matrices $H_l \times W_l$7 from Clifford algebra, satisfying

$H_l \times W_l$8

These generators induce a real basis for the matrix algebra and support a linear-dispersion design with reduced interference structure in the equivalent real system (Srinath et al., 2010).

The base building block is a rate-1 Single-Symbol-Decodable Coordinate Interleaved Orthogonal Design (CIOD) for 4 transmit antennas. Full diversity for the CIOD layer is obtained by rotating the QAM constellation by $H_l \times W_l$9. Four such SSD layers are then multiplexed to obtain rates 1 through 4. The resulting rate-2, rate-3, and rate-4 codes are

$S_4(s_1,\dots,s_{16})$00

$S_4(s_1,\dots,s_{16})$01

$S_4(s_1,\dots,s_{16})$02

Puncturing is straightforward: for $S_4(s_1,\dots,s_{16})$03, the last layers are set to zero, with no change to the weight matrices besides zeroing the absent layers (Srinath et al., 2010).

The ML metric is

$S_4(s_1,\dots,s_{16})$04

A key result is the worst-case ML-decoding complexity order. For general QAM, the exponent is

$S_4(s_1,\dots,s_{16})$05

while the Perfect code has $S_4(s_1,\dots,s_{16})$06. The stated reduction is therefore by a factor of $S_4(s_1,\dots,s_{16})$07 for any $S_4(s_1,\dots,s_{16})$08. For square QAM, the complexity becomes $S_4(s_1,\dots,s_{16})$09 because of independent real/imaginary decoding and quantization gains (Srinath et al., 2010).

Performance is differentiated by receive-antenna count. For $S_4(s_1,\dots,s_{16})$10, the rate-2 code $S_4(s_1,\dots,s_{16})$11 has full diversity with the phase scalar $S_4(s_1,\dots,s_{16})$12 and minimum determinant $S_4(s_1,\dots,s_{16})$13 under the normalization $S_4(s_1,\dots,s_{16})$14, compared with $S_4(s_1,\dots,s_{16})$15 for the punctured Perfect code. For $S_4(s_1,\dots,s_{16})$16 and $S_4(s_1,\dots,s_{16})$17, the designs are not full-diversity and have minimum determinant zero, but they embed full-diversity subcodes and show near-Perfect performance at low and medium SNR. The paper reports higher ergodic capacity than the punctured Perfect code for 4×2 and 4×3 systems, equality with the Perfect code for 4×4 because the generator matrix is unitary, equality with EAST and superiority to DjABBA and the punctured Perfect code in 4×2 SER, slight advantage over the punctured Perfect code in 4×3 at low/medium SNR, and near-Perfect 4×4 SER with lower complexity (Srinath et al., 2010).

7. Hybrid satellite–terrestrial algebraic codes and the broader One4All-ST philosophy

The hybrid broadcasting setting considers SFN transmission in which a signal is sent from both a satellite site and a terrestrial site in order to improve coverage in suburban and rural areas. The two configurations emphasized are 4×2, with two SAT transmit antennas and two TER transmit antennas, and 3×2, with one SAT transmit antenna and two TER transmit antennas. The design target is robustness under strong SAT–TER power imbalance, because received powers from the two sites can differ substantially (Hollanti et al., 2011).

The algebraic framework defines a space-time code as a set of $S_4(s_1,\dots,s_{16})$18 complex matrices and uses full diversity and determinant criteria. Joint SFN full diversity requires

$S_4(s_1,\dots,s_{16})$19

and NVD requires the minimum determinant to remain bounded away from zero independently of constellation size. For MFN-friendly behavior, a stronger split-site criterion is used:

$S_4(s_1,\dots,s_{16})$20

where $S_4(s_1,\dots,s_{16})$21 and $S_4(s_1,\dots,s_{16})$22 are the SAT and TER submatrices (Hollanti et al., 2011).

For 4×2 transmission, the principal constructions are an intermediate-rate $S_4(s_1,\dots,s_{16})$23 code, the rate-one code $S_4(s_1,\dots,s_{16})$24, and the rate-two code $S_4(s_1,\dots,s_{16})$25. The $S_4(s_1,\dots,s_{16})$26 matrix has block length $S_4(s_1,\dots,s_{16})$27, rate $S_4(s_1,\dots,s_{16})$28, top two rows transmitted by SAT and bottom two rows by TER, and is based on the division algebra $S_4(s_1,\dots,s_{16})$29 with $S_4(s_1,\dots,s_{16})$30 and $S_4(s_1,\dots,s_{16})$31. The paper attributes to $S_4(s_1,\dots,s_{16})$32 joint NVD, parallel NVD, full diversity, and robustness improvements under power imbalance due to additional delay. The $S_4(s_1,\dots,s_{16})$33 code has rate $S_4(s_1,\dots,s_{16})$34, block length $S_4(s_1,\dots,s_{16})$35, cyclic-division-algebra structure, and joint NVD but not necessarily parallel NVD; its complexity is described as similar to the double-layer 3D code (Hollanti et al., 2011).

For 3×2 transmission, two constructions are highlighted. A simple rate-one hybrid code places one SAT row above a TER Alamouti block and satisfies the determinant bounds

$S_4(s_1,\dots,s_{16})$36

The intermediate-rate code $S_4(s_1,\dots,s_{16})$37 has rate $S_4(s_1,\dots,s_{16})$38, block length $S_4(s_1,\dots,s_{16})$39, and codeword

$S_4(s_1,\dots,s_{16})$40

with $S_4(s_1,\dots,s_{16})$41, $S_4(s_1,\dots,s_{16})$42, and $S_4(s_1,\dots,s_{16})$43. Using $S_4(s_1,\dots,s_{16})$44, the paper derives explicit lower bounds on $S_4(s_1,\dots,s_{16})$45 in the cases $S_4(s_1,\dots,s_{16})$46, $S_4(s_1,\dots,s_{16})$47, and $S_4(s_1,\dots,s_{16})$48, thereby demonstrating joint NVD and full diversity in the parallel channel (Hollanti et al., 2011).

The received-signal model is

$S_4(s_1,\dots,s_{16})$49

and ML decoding uses

$S_4(s_1,\dots,s_{16})$50

All proposed codes are lattice-based and support sphere decoding. The paper states that $S_4(s_1,\dots,s_{16})$51 has lower decoding complexity than the double-layer 3D code, $S_4(s_1,\dots,s_{16})$52 remains tractable because of small $S_4(s_1,\dots,s_{16})$53 and partial SAT/TER structure, and $S_4(s_1,\dots,s_{16})$54 has relatively high complexity similar to 3D (Hollanti et al., 2011).

The simulation setup uses i.i.d. Rayleigh fading with perfect CSIR, OFDM with FFT size 2048 and sampling frequency 9.14 MHz, convolutional coding rates $S_4(s_1,\dots,s_{16})$55 with generator polynomials $S_4(s_1,\dots,s_{16})$56, and QPSK, 16-QAM, and 64-QAM constellations. Required $S_4(s_1,\dots,s_{16})$57 is compared at BER $S_4(s_1,\dots,s_{16})$58 over power imbalance $S_4(s_1,\dots,s_{16})$59 from $S_4(s_1,\dots,s_{16})$60 to $S_4(s_1,\dots,s_{16})$61 dB. The reported qualitative findings are that 2-Tx Alamouti and 4-Tx $S_4(s_1,\dots,s_{16})$62 have almost the same performance across $S_4(s_1,\dots,s_{16})$63, that $S_4(s_1,\dots,s_{16})$64 achieves acceptable performance in the 1 SAT + 2 TER setting while maintaining robustness as $S_4(s_1,\dots,s_{16})$65 grows, and that double-Alamouti and 4-Tx repetition require higher $S_4(s_1,\dots,s_{16})$66 and are consistently outperformed by $S_4(s_1,\dots,s_{16})$67 and $S_4(s_1,\dots,s_{16})$68 (Hollanti et al., 2011).

The paper identifies DVB-NGH and DVB-SH as target standards and notes that $S_4(s_1,\dots,s_{16})$69 and $S_4(s_1,\dots,s_{16})$70 are cited as DVB-NGH baseline or candidate codes. It also states that parallel NVD makes the constructions functional in MFN, because devices receiving only TER or only SAT still benefit from strong determinants. This suggests that, in the hybrid-SFN literature, One4All-ST is best understood not as a fixed code name but as a design criterion: explicit SAT–TER layering, algebraic determinant guarantees, and resilience to site imbalance without repeated code switching (Hollanti et al., 2011).