betaFeedback

WorksEngineering

Learning Joint Synchronization, Channel Estimation, and Decoding: Comparison with a Finite-Blocklength Achievability Bound

Abstract

Learned schemes that jointly perform tasks such as synchronization and decoding have achieved promising results for short-packet communication. However, it remains unclear how close their performance is to information-theoretic bounds. To investigate this question, we extend the turbo autoencoder (TurboAE) proposed in Dörner et al. (2023) to a single-input single-output waveform channel with an unknown delay and memoryless block fading, for which an achievability bound from finite-blocklength information theory is available. Our extension incorporates a pilot-free, model-guided neural synchronizer and enables joint synchronization, channel estimation, and decoding. At a blocklength of 6464 complex symbols and a rate of one bit per channel use, the proposed TurboAE achieves a lower bit error rate (BER) than all evaluated pilot-assisted 5G baselines, with gains of 1.91.9 dB at a BER of 10−310^{-3} over a baseline involving a low-density parity-check (LDPC) code and 1.71.7 dB over a baseline involving a polar code and successive cancellation list decoding (list size 88). In terms of block error rate (BLER), the TurboAE outperforms the LDPC-coded baseline, but lags behind the polar-coded baseline by about 0.80.8 dB at a BLER of 10−310^{-3}. Moreover, all evaluated schemes remain at least 2.12.1 dB away from a pilot-assisted achievability bound, indicating substantial room for improved designs.

Introduction

Modern coding schemes, such as low-density parity-check (LDPC) and polar codes [1], [2], achieve excellent error-correction performance at long blocklengths. However, their performance degrades significantly in the short-blocklength regime, for two main reasons. First, short blocklengths limit the ability of these codes to fully exploit their structural properties. Second, when the blocklength is short, the finite symbol budget must be shared among synchronization, channel estimation, and data transmission. This introduces a critical trade-off between pilot symbols and payload in conventional pilot-assisted communication systems.

Finite-blocklength information-theoretic analyses show that short-packet transmission can benefit from joint synchronization, packet detection, channel estimation, and decoding. Specifically, joint synchronization and decoding without pilots achieves nearly the same coding rate as decoding with perfect synchronization, which suggests that pilot-assisted schemes may incur a rate loss [3]. Similarly, joint packet detection and decoding achieves higher coding rates than pilot-based detection followed by decoding [4], and noncoherent transmission without explicit channel estimation is more energy efficient than pilot-assisted transmission [5]. However, how to design practical joint schemes that realize these gains remains an open question.

One promising approach to optimize the transmitter and receiver for short-packet communication is end-to-end learning using autoencoders [6]. However, the original autoencoder proposed in [6] is limited to relatively short messages of up to about 10 bits. To solve this problem, more sophisticated architectures have been proposed, such as the turbo autoencoder (TurboAE) [7] and its serial extension [8], inspired by the parallel/serial encoding and iterative decoding of turbo codes [9], [10]. In the analysis of both schemes, however, perfect frame synchronization was assumed [7], [8]. This assumption was later removed in [11], in which the serial TurboAE is extended to unsynchronized multipath channels, where it jointly performs packet detection, synchronization, equalization, and decoding. The TurboAE in [11] outperforms a pilot-assisted LDPC baseline for short blocklengths up to around 100 channel uses. However, it remains unclear how close the performance of such a learned scheme is to information-theoretic bounds.

In this paper, we address this question by considering a continuous-time waveform channel with an unknown delay and memoryless block fading, for which a finite-blocklength pilot-assisted achievability bound is available [12]. We adapt the TurboAE in [11] to this channel by extending the encoder, synchronizer, decoder, and training strategy. The resulting learned scheme achieves a lower bit error rate (BER) than all evaluated pilot-assisted 5G baselines. However, both the TurboAE and the 5G baselines remain at least 2.1 dB from the finite-blocklength bound for a block error rate (BLER) of 10−310^{-3}, indicating substantial room for improved designs.

System Model

We use the same single-input single-output waveform model as in [12], which is illustrated in Figure 1. The goal is to transmit kk information bits u∈{0,1}k\boldsymbol{u} \in\{0,1\}^{k} within a packet x∈Cn\boldsymbol{x} \in\mathbb{C}^{n} comprising nn complex-valued channel uses. The packet is divided into nbn_b blocks, each containing ncn_c symbols, such that n=nbncn = n_bn_c. Each block is transmitted over an independent fading channel, with fading coefficient remaining constant over the block. The vector of transmitted symbols corresponding to the ℓ\ellth block is

Block diagram of the system model

Figure 1. Block diagram of the system model. Each symbol is pulse shaped. The resulting waveform is delayed by dℓd_\ell, ℓ=1,…,nb\ell= 1,\ldots,n_b, scaled by the fading coefficient HℓH_\ell, and corrupted by noise before being filtered and oversampled at the receiver.

xℓ=[x1,ℓ,…,xnc,ℓ]T∈Cnc,ℓ=1,…,nb.(1)\mathbf{x}_\ell= [x_{1,\ell},\ldots,x_{n_c,\ell}]^{\mathsf{T}} \in\mathbb{C}^{n_c}, \qquad\ell= 1,\ldots,n_b. \tag*{(1)}

The full transmitted symbol vector is x=[x1T,…,xnbT]T\mathbf{x} = [\mathbf{x}_1^{\mathsf{T}},\ldots,\mathbf{x}_{n_b}^{\mathsf{T}}]^{\mathsf{T}}. We assume that the energy of each transmitted complex symbol is normalized to 1, i.e.,

∣xi,ℓ∣2=1,i=1,…,nc,ℓ=1,…,nb.(2)|x_{i,\ell}|^2 = 1,\qquad i = 1,\ldots,n_c,\quad\ell= 1,\ldots,n_b. \tag*{(2)}

The discrete symbols are converted into a continuous-time waveform via pulse shaping as follows:

xℓ(t)=∑i=1ncxi,ℓsT(t−(i−1)T).(3)x_\ell(t) = \sum_{i=1}^{n_c} x_{i,\ell}s_T(t-(i-1)T). \tag*{(3)}

Here, TT is the symbol duration, and sT(t)s_T(t) is a unit-energy rectangular pulse

sT(t)={1/T,0≤t<T,0,otherwise.(4)s_T(t) = \begin{cases} 1/\sqrt{T}, & 0 \le t < T,\\ 0, & \text{otherwise}. \end{cases} \tag*{(4)}

The transmitted waveform xℓ(t)x_\ell(t) is then passed through a fading channel with unknown delay and fading gain. The corresponding waveform is

yℓ(t)=Hℓxℓ(t−dℓ)+Zℓ(t),(5)y_\ell(t) = H_\ell x_\ell(t-d_\ell) + Z_\ell(t), \tag*{(5)}

where Hℓ∼i.i.d.CN(0,1)H_\ell\overset{\mathrm{i.i.d.}}{\sim} \mathcal{CN}(0,1) denotes the fading coefficient for block ℓ\ell and dℓ∼U(0,dmax⁡)d_\ell\sim U(0,d_{\max}) is the unknown uniformly distributed delay. Throughout, we consider the common delay case d1=⋯=dnb=dd_1 = \cdots= d_{n_b} = d. Finally, Zℓ(t)Z_\ell(t) in (5) is a complex white Gaussian noise process with power spectral density N0N_0. Under the unit-symbol-energy normalization (2), the average signal-to-noise ratio (SNR) per complex symbol is ρ=1/N0\rho= 1/N_0.

Following [12], we assume that, to obtain an oversampled observation, the receiver filters yℓ(t)y_\ell(t) with the unit-energy rectangular pulse sts(t)s_{t_s}(t), where ts=T/Nt_s = T/N and NN is the oversampling rate, and samples the filter output every tst_s seconds. The mmth received sample in block ℓ\ell is

ym,ℓ=(yℓ∗sts)(mts),m=1,…,M,(6)y_{m,\ell} = (y_\ell* s_{t_s})(mt_s),\qquad m = 1,\ldots,M, \tag*{(6)}

where M=⌈dmax⁡/ts⌉+ncNM = \lceil d_{\max}/t_s\rceil+n_cN. Note that MM is larger than ncNn_cN to account for the unknown delay. We collect these samples in the vector

yℓ=[y1,ℓ,…,yM,ℓ]T∈CM.(7)\mathbf{y}_\ell= [y_{1,\ell},\ldots,y_{M,\ell}]^{\mathsf{T}} \in\mathbb{C}^{M}. \tag*{(7)}

It turns out convenient to write dd as (q+ϵ)ts(q+\epsilon)t_s, where q=⌊d/ts⌋q = \lfloor d/t_s\rfloor is the integer delay in samples, e=d−qtse = d-qt_s is the fractional delay, and ϵ=e/ts∈[0,1)\epsilon= e/t_s \in[0,1) is the normalized fractional delay. To capture oversampling, we next define

xN,r,ℓ=x⌈r/N⌉,ℓ,r=1,…,Nnc,(8)x_{N,r,\ell} = x_{\lceil r/N\rceil,\ell},\qquad r = 1,\ldots,Nn_c, \tag*{(8)}

and use (8) to construct the following scaled, zero-padded vector shifted by qq samples:

xN,ℓ(q)=1N[0qT,xN,1,ℓ,…,xN,Nnc,ℓ,0M−q−NncT]T.(9)\mathbf{x}_{N,\ell}(q) = \frac{1}{\sqrt{N}}\left[\mathbf{0}_q^{\mathsf{T}},x_{N,1,\ell},\ldots,x_{N,Nn_c,\ell},\mathbf{0}_{M-q-Nn_c}^{\mathsf{T}}\right]^{\mathsf{T}}. \tag*{(9)}

Using (9), we can express yℓ\mathbf{y}_\ell in (7) as [12 Sec. II-C]

yℓ=Hℓ[(1−ϵ)xN,ℓ(q)+ϵxN,ℓ(q+1)]+zℓ,(10)\mathbf{y}_\ell= H_\ell\left[(1-\epsilon)\mathbf{x}_{N,\ell}(q)+\epsilon\mathbf{x}_{N,\ell}(q+1)\right]+\mathbf{z}_\ell, \tag*{(10)}

where zℓ∼CN(0M,ρ−1IM)\mathbf{z}_\ell\sim\mathcal{CN}(\mathbf{0}_M,\rho^{-1}\mathbf{I}_M). The noise samples are independent because the unit-energy receive filters span nonoverlapping sampling intervals. Stacking the {yℓ}\{\mathbf{y}_\ell\}, we obtain the received signal (see Figure 1)

Y=[y1,…,ynb]T∈Cnb×M.(11)\mathbf{Y} = [\mathbf{y}_1,\ldots,\mathbf{y}_{n_b}]^{\mathsf{T}} \in\mathbb{C}^{n_b \times M}. \tag*{(11)}

Finite-Blocklength Bound & 5G Baselines

Both the finite-blocklength bound and the 5G baselines are obtained under the assumption that each fading block carries a common pilot vector x(p)\mathbf{x}^{(p)} of dimension npn_p, followed by a data vector xℓ(d)\mathbf{x}_\ell^{(d)} of dimension ns=nc−npn_s = n_c-n_p, i.e.,

xℓ=[(x(p))T,(xℓ(d))T]T.(12)\mathbf{x}_\ell= [(\mathbf{x}^{(p)})^{\mathsf{T}},(\mathbf{x}_\ell^{(d)})^{\mathsf{T}}]^{\mathsf{T}}. \tag*{(12)}

The receiver estimates the delay and fading gains from the pilot vectors. Then, it decodes the data by treating these estimates as perfect.

Synchronization and Channel Estimation

Since we assume that the pilots precede the data in (12), all pilot samples of block ℓ\ell lie within the first Mp=⌈dmax⁡/ts⌉+npNM_p = \lceil d_{\max}/t_s\rceil+n_pN entries of yℓ\mathbf{y}_\ell in (7). We denote these samples by yℓ(p)∈CMp\mathbf{y}_\ell^{(p)} \in\mathbb{C}^{M_p}. As in [12 Sec. II-C], we consider an estimator that neglects the interference between data symbols and pilots. For a candidate integer delay qˉ\bar{q} and fractional delay ϵˉ\bar{\epsilon}, we define the noiseless pilot vector per unit channel gain as

v(qˉ,ϵˉ)=(1−ϵˉ)xN(p)(qˉ)+ϵˉxN(p)(qˉ+1),(13)\mathbf{v}(\bar{q},\bar{\epsilon}) = (1-\bar{\epsilon})\mathbf{x}_{N}^{(p)}(\bar{q})+\bar{\epsilon}\mathbf{x}_{N}^{(p)}(\bar{q}+1), \tag*{(13)}

where xN(p)(qˉ)\mathbf{x}_{N}^{(p)}(\bar{q}) is defined similarly as xN,ℓ(q)\mathbf{x}_{N,\ell}(q) in (9), with ncn_c and MM replaced by npn_p and MpM_p, respectively. Using (10) and (13), we conclude that yℓ(p)=Hℓv(qˉ,ϵˉ)+zℓ(p)\mathbf{y}_\ell^{(p)} = H_\ell\mathbf{v}(\bar{q},\bar{\epsilon})+\mathbf{z}_\ell^{(p)}, where zℓ(p)∼CN(0,ρ−1IMp)\mathbf{z}_\ell^{(p)} \sim\mathcal{CN}(\mathbf{0},\rho^{-1}\mathbf{I}_{M_p}). We use a maximum likelihood (ML) estimator to jointly estimate the fading gains, integer delay, and fractional delay as

[h^,q^,ϵ^]=arg⁡min⁡hˉ,qˉ,ϵˉ∑ℓ=1nb∥yℓ(p)−hˉℓv(qˉ,ϵˉ)∥2.(14)[\hat{\mathbf{h}},\hat{q},\hat{\epsilon}] = \arg\min_{\bar{\mathbf{h}},\bar{q},\bar{\epsilon}}\sum_{\ell=1}^{n_b}\left\|\mathbf{y}_\ell^{(p)}-\bar{h}_\ell\mathbf{v}(\bar{q},\bar{\epsilon})\right\|^2. \tag*{(14)}

For fixed (qˉ,ϵˉ)(\bar{q},\bar{\epsilon}), the conditional gain estimate for block ℓ\ell is

H^ℓ(qˉ,ϵˉ)=v(qˉ,ϵˉ)Hℓ(p)∥v(qˉ,ϵˉ)∥2.(15)\hat{H}_{\ell}(\bar{q},\bar{\epsilon})=\frac{v(\bar{q},\bar{\epsilon})H_{\ell}^{(p)}}{\lVert v(\bar{q},\bar{\epsilon})\rVert^{2}}. \tag*{(15)}

Substituting (15) into (14), we obtain the common-delay estimate

[q^,ϵ^]=arg⁡max⁡qˉ,ϵˉ∑ℓ=1nb∣v(qˉ,ϵˉ)Hℓ(p)∣2∥v(qˉ,ϵˉ)∥2.(16)[\hat{q},\hat{\epsilon}]=\underset{\bar{q},\bar{\epsilon}}{\arg\max}\sum_{\ell=1}^{n_b}\frac{\left|v(\bar{q},\bar{\epsilon})H_{\ell}^{(p)}\right|^{2}}{\lVert v(\bar{q},\bar{\epsilon})\rVert^{2}}. \tag*{(16)}

For fixed qˉ\bar{q}, the objective in (16) is a rational function of ϵˉ\bar{\epsilon} with quadratic numerator and denominator. Hence, the optimal ϵˉ\bar{\epsilon} is 0, 1, or a point in (0,1)(0,1) obtained by setting the derivative of (16) to zero. Evaluating these candidates for all qˉ\bar{q}, we obtain (q^,ϵ^)(\hat{q},\hat{\epsilon}) [12 Alg. 1]. Finally, d^=(q^+ϵ^)ts\hat{d}=(\hat{q}+\hat{\epsilon})t_s and H^ℓ=H^ℓ(q^,ϵ^)\hat{H}_{\ell}=\hat{H}_{\ell}(\hat{q},\hat{\epsilon}).

Finite-blocklength Achievability Bound

We consider a receiver that filters yℓ(t)y_{\ell}(t) in (5) with sT(t)s_T(t) and resamples at the symbol rate using the delay estimate d^\hat{d}, obtaining the data samples yi,ℓ(d)=(yℓ∗sT)((np+i)T+d^)y_{i,\ell}^{(d)}=(y_{\ell}*s_T)((n_p+i)T+\hat{d}), i=1,…,nsi=1,\ldots,n_s. Then, the transmitted codeword is recovered by a mismatched scaled nearest-neighbor (SNN) decoder, which treats the estimated fading coefficients as correct and returns

x^(d)=arg⁡min⁡xˉ∈C∑ℓ=1nb∥yℓ(d)−H^ℓxˉℓ∥2,(17)\hat{x}^{(d)}=\underset{\bar{x}\in\mathcal{C}}{\arg\min}\sum_{\ell=1}^{n_b}\left\lVert y_{\ell}^{(d)}-\hat{H}_{\ell}\bar{x}_{\ell}\right\rVert^{2}, \tag*{(17)}

where C\mathcal{C} contains the 2k2^{k} codewords. We use the so-called random-coding union bound with parameter ss (RCUs) from finite-blocklength information theory. Specifically, we assume that the codeword symbols are generated as xi,ℓ=ejθi,ℓx_{i,\ell}=e^{j\theta_{i,\ell}} where θi,ℓ∼i.i.d.U(0,2π)\theta_{i,\ell}\overset{\mathrm{i.i.d.}}{\sim}U(0,2\pi). Define the event that transmitted symbols are synchronized to within one symbol period as A={∣d^−d∣≤T}A=\{|\hat{d}-d|\leq T\}, and let AcA^{c} denote its complement. The bound is stated in the following theorem [12 Sec. III].

Theorem 1 (Pilot-assisted RCUs bound): For the pilot-assisted model above and every s>0s>0, there exists a codebook with 2k2^{k} codewords, each containing nbnsn_bn_s data symbols, whose average packet error probability PeP_e, averaged over equiprobable messages, satisfies

Pe≤P[A]ϵub(s)+P[Ac],(18)P_e\leq\mathbb{P}[A]\epsilon_{\mathrm{ub}}(s)+\mathbb{P}[A^{c}], \tag*{(18)}

where

ϵub(s)=E[min⁡{1,ekln⁡2−Is}|A].(19)\epsilon_{\mathrm{ub}}(s)=\mathbb{E}\left[\min\left\{1,e^{k\ln2-I_s}\right\}\middle|A\right]. \tag*{(19)}

Here, ss is an optimization parameter, and

Is=∑ℓ=1nb∑i=1nslog⁡e−s∣yi,ℓ(d)−H^ℓxi,ℓ(d)∣2Exˉ[e−s∣yi,ℓ(d)−H^ℓxˉi(d)∣2].(20)I_s=\sum_{\ell=1}^{n_b}\sum_{i=1}^{n_s}\log\frac{e^{-s|y_{i,\ell}^{(d)}-\hat{H}_{\ell}x_{i,\ell}^{(d)}|^{2}}}{\mathbb{E}_{\bar{x}}\left[e^{-s|y_{i,\ell}^{(d)}-\hat{H}_{\ell}\bar{x}_{i}^{(d)}|^{2}}\right]}. \tag*{(20)}

where xˉ\bar{x} follows the same distribution as xi,ℓx_{i,\ell} and is independent of all other quantities.

Pilot-Assisted 5G Baselines

Similar to the RCUs bound, the baseline receiver uses the delay and fading gain estimates from Section III-A, filters the waveform with sT(t)s_T(t), resamples at the symbol rate, and decodes by treating the estimated delay and channel coefficients as perfect. We compare three coding schemes: a 5G polar code with cyclic redundancy check (CRC)-aided successive-cancellation (SC) decoding (5G polar + CRC SC), a 5G polar code with CRC-aided successive cancellation list (SCL) decoding of list size eight (5G polar + CRC SCL-8), and a 5G LDPC code with 20 belief propagation iterations (5G LDPC BP-20). To satisfy the constraint (2), we assume that all coding schemes use phase-shift keying (PSK) modulation.

TurboAE Design

The proposed TurboAE, illustrated in Figure 2, consists of a learned encoder at the transmitter and a learned synchronizer and decoder at the receiver. While the encoder and decoder largely build on [11 Figs. 5 and 20], our main contributions, i.e., the synchronizer and the training strategy, differ from [11] in two respects. First, the synchronizer in [11] represents the integer delay as a one-hot probability vector and lets the fractional delay to be accounted for by the decoder. For the assumed rectangular pulse in this design, this would lead to significantly degraded performance. Our synchronizer instead estimates both integer and fractional delay and compensates for them before decoding (see Section IV-B). Second, in the training strategy used in [11], the synchronizer is trained jointly with the decoder using a categorical cross-entropy loss. To suit the proposed synchronizer design, we instead use a regression loss for synchronization and perform the training in two stages: first we train the encoder, decoder, and synchronizer separately; then jointly (see Section IV-D). We describe each component of the proposed architecture next.

End-to-end TurboAE architecture

Figure 2. End-to-end TurboAE architecture.

Encoder

The encoder contains two 1D convolutional blocks, separated by a straight-through binarizer [13] and a fixed interleaver. The outputs of the encoder are normalized to satisfy (2).

Synchronizer

The learned synchronizer, illustrated in Figure 3, maps the oversampled observations Y∈Cnb×MY \in\mathbb{C}^{n_b \times M} to one continuous common-delay estimate d^\hat{d} and uses it to obtain the delay-corrected observations Y′∈Cnb×ncNY' \in\mathbb{C}^{n_b \times n_c N}. It builds on two key ideas. First, instead of predicting dd directly, it predicts the integer and fractional delays (qq and ee) separately and combines them into d^\hat{d}. Second, rather than predicting ee in a single step, it first forms a model-based prior estimate by conventional feature extraction and then corrects it with neural networks. We next describe each block in Figure 3.

Learned model-guided neural synchronizer

Figure 3. Learned model-guided neural synchronizer. Candidate features provide integer-delay probabilities and fractional-delay priors, while global temporal features refine the fractional-delay estimates before soft combination.

a) Candidate features: For each possible integer delay q∈Q={0,…,⌊dmax⁡/ts⌋}q \in\mathcal{Q} = \{0,\ldots,\lfloor d_{\max}/t_s \rfloor\}, let Wq={q+1,…,q+ncN+1}\mathcal{W}_q = \{q+1,\ldots,q+n_cN+1\} index the samples the packet would occupy if the integer delay were qq. We consider the following nine candidate features aq∈R9\boldsymbol{a}_q \in\mathbb{R}^9: the normalized assumed delay q/⌊dmax⁡/ts⌋q/\lfloor d_{\max}/t_s\rfloor; three power features, i.e., the empirical mean and standard deviation of the power of the samples inside Wq\mathcal{W}_q and the alignment score sqs_q, defined as the average power inside Wq\mathcal{W}_q minus the power outside Wq\mathcal{W}_q; two edge features, i.e., EL,q+ER,qE_{L,q}+E_{R,q} and eq(0)/tse_q^{(0)}/t_s, where EL,q/ER,qE_{L,q}/E_{R,q} is the difference between the power of the first/last sample inside Wq\mathcal{W}_q and the average power outside Wq\mathcal{W}_q; and

eq(0)=tsER,qEL,q+ER,q(21)e_q^{(0)} = \frac{t_s\sqrt{E_{R,q}}}{\sqrt{E_{L,q}}+\sqrt{E_{R,q}}} \tag*{(21)}

is an estimate of the fractional-delay prior (see (10)); and three correlation features, i.e., the real part, imaginary part, and magnitude of the mean of ym+1,ℓym,ℓ∗y_{m+1,\ell}y_{m,\ell}^{*} inside Wq\mathcal{W}_q.

b) Embedding & heads: We use a two-layer fully connected network to embed aq∈R9\boldsymbol{a}_q \in\mathbb{R}^9 into zq∈R64\boldsymbol{z}_q \in\mathbb{R}^{64}. Furthermore, we use two separate linear heads (fIf_I and fEf_E) combined with tanh activation to produce the integer-delay probabilities pq(Y)p_q(\boldsymbol{Y}) and initial fractional delay eq(1)e_q^{(1)}, where γ\gamma is a trainable scalar and the tanh terms determine the influence of the correction according to

pq(Y)=softmax⁡q∈Q(fI(zq)+γtanh⁡(sq)),p_q(\boldsymbol{Y}) = \operatorname{softmax}_{q\in\mathcal{Q}}\left(f_I(\boldsymbol{z}_q)+\gamma\tanh(s_q)\right),
eq(1)=eq(0)+tstanh⁡(fE(zq)).(22)e_q^{(1)} = e_q^{(0)} + t_s\tanh(f_E(\boldsymbol{z}_q)). \tag*{(22)}

c) Global temporal features: In parallel, we use another neural network fGf_G, consisting of residual 1D convolutional blocks and an attention-pooling layer, to learn temporal features g\boldsymbol{g} directly from Y\boldsymbol{Y} as complementary information for the fractional-delay correction Δeglob\Delta e^{\mathrm{glob}} according to

Δeglob=tstanh⁡(fG([e(0);g])),e(0)=[eq(0)]q∈Q.(23)\Delta e^{\mathrm{glob}} = t_s\tanh\left(f_G\left([e^{(0)};\boldsymbol{g}]\right)\right), \qquad e^{(0)} = [e_q^{(0)}]_{q\in\mathcal{Q}}. \tag*{(23)}

d) Soft combination: Combining (22) with the refined fractional-delay estimates e^q=eq(1)+Δeglob\hat{e}_q = e_q^{(1)}+\Delta e^{\mathrm{glob}}, we obtain the final common delay estimate

d^=∑q∈Qpq(Y)(qts+e^q).(24)\hat{d} = \sum_{q\in\mathcal{Q}} p_q(\boldsymbol{Y})(qt_s+\hat{e}_q). \tag*{(24)}

e) Delay correction: Let q^=⌊d^/ts⌋\hat{q} = \lfloor\hat{d}/t_s\rfloor and e^=d^/ts−q^\hat{e} = \hat{d}/t_s-\hat{q}. In block ℓ\ell, we remove the first q^\hat{q} samples that carry only noise and retain y~ℓ=[y^q^+1,ℓ,…,y^q^+ncN+1,ℓ]T\tilde{\boldsymbol{y}}_\ell= [\hat{y}_{\hat{q}+1,\ell},\ldots,\hat{y}_{\hat{q}+n_cN+1,\ell}]^{\mathsf{T}}. Then, we undo the interference between neighboring symbols caused by the fractional delay. By (10), this interference is described by

B=(1−e^)[U0T]+e^[0TU],U=Inc⊗1N,(25)\boldsymbol{B}=(1-\hat{e})\begin{bmatrix}\boldsymbol{U}\\\boldsymbol{0}^{\mathsf{T}}\end{bmatrix}+\hat{e}\begin{bmatrix}\boldsymbol{0}^{\mathsf{T}}\\\boldsymbol{U}\end{bmatrix}, \qquad\boldsymbol{U}=\boldsymbol{I}_{n_c}\otimes\boldsymbol{1}_N, \tag*{(25)}

where U∈RncN×nc\boldsymbol{U}\in\mathbb{R}^{n_cN\times n_c} repeats each symbol NN times, Inc\boldsymbol{I}_{n_c} is the identity matrix, 1N\boldsymbol{1}_N is a column vector of NN ones, and ⊗\otimes denotes the Kronecker product. The zero row 0T\boldsymbol{0}^{\mathsf{T}} has ncn_c entries. Treating d^\hat{d} as exact, we recover the faded symbols by regularized least squares with regularization parameter ν=0.2\nu=0.2 and repeat them according to the oversampling factor NN:

yℓ′=U(BTB+νInc)−1BTy~ℓ.(26)\boldsymbol{y}'_\ell=\boldsymbol{U}\left(\boldsymbol{B}^{\mathsf{T}}\boldsymbol{B}+\nu\boldsymbol{I}_{n_c}\right)^{-1}\boldsymbol{B}^{\mathsf{T}}\tilde{\boldsymbol{y}}_\ell. \tag*{(26)}

Decoder

The decoder uses two groups of 1D convolutional networks, denoted by Dec 1 and Dec 2 in Figure 2, which iteratively exchange information through the fixed interleaver π\boldsymbol{\pi}. The input Y′\boldsymbol{Y}' is first normalized and embedded along the symbol dimension, and then fed into the decoder for multiple iterations, each with its own trainable Dec 1 and Dec 2. Starting from a zero prior L0(x)L_0(x), in each iteration, Dec 1 combines the received features with Li(x)L_i(x), Dec 2 refines the deinterleaved output of Dec 1, and the interleaved output of Dec 2 becomes the next Li+1(x)L_{i+1}(x). Each network subtracts its input information from its output, so only new (extrinsic) information is passed on. In the last iteration, the decoder returns the kk bit probabilities.

Algorithm 1 Two-stage training of the TurboAE

Input: Total steps $N_{\mathrm{step}}$, first-stage steps $N_{\mathrm{pre}}$, and pass counts $K_{\mathrm{Enc}}$, $K_{\mathrm{Dec}}$, $K_{\mathrm{SyncEnc}}$, $K_{\mathrm{Sync}}$, $K_{\mathrm{JointEnc}}$, $K_{\mathrm{JointDec}}$
Output: $\theta_{\mathrm{Enc}}$, $\theta_{\mathrm{Dec}}$, and $\theta_{\mathrm{Sync}}$

1: Initialize $\theta_{\mathrm{Enc}}$, $\theta_{\mathrm{Dec}}$, $\theta_{\mathrm{Sync}}$, and their Adam optimizers
2: for $i = 1, \ldots, N_{\mathrm{step}}$ do
3:   if $i \leq N_{\mathrm{pre}}$ then ▷ stage 1: separate training
4:     PASS(ENC, $K_{\mathrm{Enc}}$, $\mathcal{L}_b$, $\{\theta_{\mathrm{Enc}}\}$) ▷ perfect sync.
5:     PASS(DEC, $K_{\mathrm{Dec}}$, $\mathcal{L}_b$, $\{\theta_{\mathrm{Dec}}\}$) ▷ perfect sync.
6:     PASS(ENC, $K_{\mathrm{SyncEnc}}$, $\mathcal{L}_s$, $\{\theta_{\mathrm{Enc}}\}$)
7:     PASS(SYNC, $K_{\mathrm{Sync}}$, $\mathcal{L}_s$, $\{\theta_{\mathrm{Sync}}\}$)
8:   else ▷ stage 2: joint training
9:     PASS(ENC+SYNC, $K_{\mathrm{JointEnc}}$, $\mathcal{L}_J$, $\{\theta_{\mathrm{Enc}}, \theta_{\mathrm{Sync}}\}$)
10:    PASS(DEC+SYNC, $K_{\mathrm{JointDec}}$, $\mathcal{L}_J$, $\{\theta_{\mathrm{Dec}}, \theta_{\mathrm{Sync}}\}$)
11:  end if
12: end for

Training

Let θEnc\theta_{\mathrm{Enc}}, θDec\theta_{\mathrm{Dec}}, and θSync\theta_{\mathrm{Sync}} denote the encoder, decoder, and synchronizer parameters. To train the encoder and decoder pair, we use the mean binary cross-entropy (BCE) loss

Lb=−1k∑i=1k[uilog⁡u^i+(1−ui)log⁡(1−u^i)],(27)\mathcal{L}_b = -\frac{1}{k}\sum_{i=1}^{k}\left[u_i \log\hat{u}_i + (1-u_i)\log(1-\hat{u}_i)\right], \tag*{(27)}

where uiu_i and u^i\hat{u}_i are the transmitted bits and corresponding predicted probabilities. To train the encoder and synchronizer pair, we use the mean smooth-L1L_1 loss

Ls=1nb∑ℓ=1nbψ(d^ℓ−dℓ),(28)\mathcal{L}_s = \frac{1}{n_b}\sum_{\ell=1}^{n_b}\psi(\hat{d}_{\ell}-d_{\ell}), \tag*{(28)}

where ψ(z)=z2/(2β)\psi(z) = z^2/(2\beta) if ∣z∣<β|z| < \beta and ψ(z)=∣z∣−β/2\psi(z) = |z|-\beta/2 otherwise, with threshold β\beta. For joint training, we use LJ=Lb+αLs\mathcal{L}_J = \mathcal{L}_b + \alpha\mathcal{L}_s, where the parameter α\alpha balances the two losses.

In Algorithm 1, we extend the alternating training of [7], in which the encoder is trained with the decoder frozen and vice versa to avoid poor local optima. In each PASS(⋅,K,L,θ)(\cdot, K, L, \theta), we perform KK gradient-based updates of θ\theta to minimize LL, each time on a new batch of random messages and channel realizations, with all other parameters frozen. In stage one, the encoder and decoder are first trained with perfect timing to minimize the BCE loss (27); then the encoder and synchronizer are trained to minimize the synchronization loss (28), so that the encoder learns the two objectives alternately. In stage two, the synchronizer is updated with either the encoder or the decoder under LJ\mathcal{L}_J, with the remaining component frozen.

Results

For the numerical results,2 we consider n=64n = 64 complex symbols and a rate of R=k/n=1R = k/n = 1 bit per channel use, as in [11]. We normalize the symbol period to T=1T = 1 and set dmax⁡=4Td_{\max} = 4T. We consider nb=4n_b = 4 fading blocks. Oversampling by N=8N = 8 gives ts=T/8t_s = T/8; so each block contains M=32+128=160M = 32 + 128 = 160 samples. As in [11], we use Zadoff–Chu pilots [15] for the 5G baselines and the RCUs bound, which is optimized over ss and npn_p. The 5G baselines are simulated with Sionna [16]. Under block fading, the optimized 5G baselines (Section III-C) involve the transmission of np=2n_p = 2 pilots per block, 16-PSK for 5G polar + CRC SC, and 32-PSK for both 5G polar + CRC SCL-8 and 5G LDPC BP-20. The TurboAE is trained with Adam for 700 steps with an initial batch size of 500 and a learning rate of 10−410^{-4}.

To single out the benefit of joint synchronization, channel estimation, and decoding, we first consider an additive white Gaussian noise (AWGN) channel with perfect synchronization, where the baselines use QPSK. In this case (Figure 4a), TurboAE has the lowest BER up to about ρ=3.3 dB\rho= 3.3\,\mathrm{dB}, but its BER decays more slowly than that of 5G polar + CRC SCL-8 and 5G LDPC BP-20. Hence, it offers no coding gain over them at moderate-to-high SNR.

BER and BLER versus SNR for AWGN and Rayleigh block fading

Figure 4. BER (left) and BLER (right) versus SNR for n=64n = 64 and R=k/n=1R = k/n = 1. Top: AWGN; bottom: Rayleigh block fading (nb=4n_b = 4, nc=16n_c = 16, N=8N = 8, common delay d∼U(0,4T)d \sim\mathcal{U}(0, 4T)). The 5G baselines use QPSK under AWGN; under block fading, 5G polar + CRC SC uses 16-PSK, while 5G polar + CRC SCL-8 and 5G LDPC BP-20 use 32-PSK. Two pilots per block are transmitted in these schemes. The TurboAE uses learned symbols without dedicated pilots.

For the considered block-fading channel (Figure 4c), instead, TurboAE achieves the lowest BER over the entire considered SNR range and requires 1.9 dB less SNR than 5G LDPC BP-20 to achieve a BER of 10−310^{-3}. We attribute this advantage to joint synchronization and decoding, which avoids the pilot overhead. This is consistent with [11 Fig. 13], where, for the same packet size and rate, the TurboAE-based scheme outperforms a LDPC baseline with a 20-symbol preamble by 2.7 dB in BER over a multipath channel.

In terms of BLER under AWGN (Figure 4b), TurboAE requires a higher SNR than 5G polar + CRC SCL-8, 5G LDPC BP-20, and the RCUs bound. Instead, for the considered block-fading channel (Figure 4d), TurboAE slightly outperforms 5G polar + CRC SC but, at a BLER of 10−310^{-3}, requires 1.4, 2.4, and 4.5 dB more SNR than 5G LDPC BP-20, 5G polar + CRC SCL-8, and the RCUs bound, respectively. Hence, the 1.9 dB BER gain over 5G LDPC BP-20 turns into a 1.4 dB BLER loss. As also noted in [11], this discrepancy between BER and BLER performance may be partly due to the use of the BCE loss (27), which targets individual bits rather than whole packets. Inspired by [11], we consider a concatenated scheme, in which we (i) append a 3-bit CRC with generator polynomial g(x)=x3+x+1g(x) = x^3 + x + 1, (ii) retain at the decoder the eight most likely candidates under the predicted bit probabilities, and (iii) select the most likely CRC-valid candidate. This improves the TurboAE BLER by about 1.6 dB. On the contrary, finetuning with a BLER-targeted LogSumExp⁡\operatorname{LogSumExp} loss [14] (see Figure 4d) or adding a block-reconstruction penalty to the loss (27) improves the BLER only slightly.

Conclusion

We developed an end-to-end learned scheme for short-packet transmission over a continuous-time waveform channel with an unknown delay and memoryless block fading. In the proposed scheme, the delay is estimated without dedicated pilots. The scheme contains an encoder, a synchronizer, and a decoder, which are trained alternately. Under the same blocklength and rate constraints, TurboAE achieves a lower BER than all evaluated pilot-assisted 5G baselines but a higher BLER than 5G polar + CRC SCL-8; with a 3-bit CRC, its BLER is comparable to that of 5G LDPC BP-20. Finally, our work uncovered a large BLER gap between all evaluated schemes and the RCUs bound, motivating future work on new architectures and training methods for short-packet communication.

References

  1. [1]R. G. Gallager, “Low-density parity-check codes,” IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 21–28, Jan. 1962.
  2. [2]E. Arıkan, “Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051–3073, Jul. 2009.DOI
  3. [3]Y. Polyanskiy, “Asynchronous communication: Exact synchronization, universality, and dispersion,” IEEE Trans. Inf. Theory, vol. 59, no. 3, pp. 1256–1270, Mar. 2013.
  4. [4]A. Lancho, J. Östman, and G. Durisi, “On joint detection and decoding in short-packet communications,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Madrid, Spain, Dec. 2021.arxiv.org/abs/2109.13669
  5. [5]J. Östman, G. Durisi, E. G. Ström, M. C. Coşkun, and G. Liva, “Short packets over block-memoryless fading channels: Pilot-assisted or noncoherent transmission?” IEEE Trans. Commun., vol. 67, no. 2, pp. 1521–1536, Feb. 2019.
  6. [6]T. O’Shea and J. Hoydis, “An introduction to deep learning for the physical layer,” IEEE Trans. Cogn. Commun. Netw., vol. 3, no. 4, pp. 563–575, Dec. 2017.arxiv.org/abs/1702.00832
  7. [7]Y. Jiang, H. Kim, H. Asnani, S. Kannan, S. Oh, and P. Viswanath, “Turbo autoencoder: Deep learning based channel codes for point-to-point communication channels,” in Proc. Adv. Neural Inf. Process. Syst. (NeurIPS), vol. 32, Vancouver, BC, Canada, Dec. 2019.arxiv.org/abs/1911.03038
  8. [8]J. Clausius, S. Dörner, S. Cammerer, and S. ten Brink, “Serial vs. parallel turbo-autoencoders and accelerated training for learned channel codes,” in Proc. Int. Symp. Topics Coding (ISTC), Montreal, QC, Canada, Aug. 2021, pp. 1–5.
  9. [9]C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes,” in Proc. IEEE Int. Conf. Commun. (ICC), vol. 2, Geneva, Switzerland, May 1993, pp. 1064–1070.
  10. [10]S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, “Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding,” IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 909–926, 1998.
  11. [11]S. Dörner, J. Clausius, S. Cammerer, and S. ten Brink, “Learning joint detection, equalization and decoding for short-packet communications,” IEEE Trans. Commun., vol. 71, no. 2, pp. 837–850, Feb. 2023.arxiv.org/abs/2207.05699
  12. [12]A. O. Kislal, M. Rajiv, G. Durisi, E. G. Ström, and U. Mitra, “Is synchronization a bottleneck for pilot-assisted URLLC links?” IEEE Trans. Wireless Commun., vol. 23, no. 12, pp. 17945–17958, Dec. 2024.arxiv.org/abs/2401.09089
  13. [13]Y. Bengio, N. Léonard, and A. Courville, “Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation,” in arXiv:1308.3432, Aug. 2013.arxiv.org/abs/1308.3432
  14. [14]R. Weis mayr, G. Marti, C. Dick, H. Song, and C. Studer, “Bit error and block error rate training for ML-assisted communication,” in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP), Jun. 2023.
  15. [15]5G; NR; Physical channels and modulation, 3GPP Technical Specification 38.211, Rev. 18.6.0, Apr. 2025.
  16. [16]J. Hoydis, S. Cammerer, F. Ait Aoudia, M. Nimier-David, L. Maggi, G. Marcus, A. Vem, and A. Keller, “Sionna,” 2022, https://nvlabs.github.io/sionna/.arxiv.org/abs/2203.11854

Paper details

vlnc:W_wvykd8uj
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Engineering

Not recorded for this paper

View statement
Looking for related papers…
Contents