Learned Compression of SAR Phase-History Data: A Rate-Honest Feasibility Study on GOTCHA

arXiv cs.LG Papers

Summary

This feasibility study benchmarks a small convolutional autoencoder against block-adaptive quantization (BAQ) on AFRL GOTCHA SAR phase-history data, finding the learned coder loses at every rate. It also highlights evaluation pitfalls like CFAR border artifacts and clipping-range sensitivity, and proposes an evaluation protocol for learned radar compression.

arXiv:2609.35848v1 Announce Type: new Abstract: On-board compression of synthetic aperture radar (SAR) phase history is bandwidth-critical, and block-adaptive quantization (BAQ) remains the operational standard. We test whether a small convolutional autoencoder, with its encoder on the sensor, can compete with BAQ on complex phase-history patches from the AFRL GOTCHA collection. Every method is charged for all transmitted bits, rates are reported in bits per complex sample (b/cs), and detection is scored by one-to-one matching of CA-CFAR detections. The autoencoder (28,656 encoder parameters) loses at every rate. At 16 b/cs it reaches -2.87 dB NMSE, against -35.5 dB for 8-bit BAQ with $\pm 3\sigma$ clipping and -41.0 dB with a tuned clipping range. It also loses to a $16 \times 16$ block Karhunen-Lo\`eve transform (KLT), a local linear coder with a tenth of its encoder cost (-5.39 dB). Running the network in a companded Fourier domain helps, but its detection F1 remains bounded at 33%. The evidence points to this model, its normalization, and its objective, not to a fundamental limit of learned coding. Per patch, the data have modest lag-1 coherence ($|\rho| \approx 0.3$) and patch-specific spectral concentration. Two findings concern evaluation itself. First, 97% of CFAR crossings on raw $64 \times 64$ patches are border artifacts of the zero-padded detector. Second, on interior cells BAQ's clipping range decides detection: 8-bit BAQ keeps 69% F1 with tuned clipping but 17% at $\pm 3\sigma$, and at 8 b/cs or less adaptive FFT thresholding preserves more detections than BAQ. We close with an evaluation protocol for learned radar compression.
Original Article
View Cached Full Text

Cached at: 09/30/26, 09:37 AM

# A Rate-Honest Feasibility Studyon GOTCHA
Source: [https://arxiv.org/html/2609.35848](https://arxiv.org/html/2609.35848)
## Learned Compression of SAR Phase\-History Data: A Rate\-Honest Feasibility Study on GOTCHA

###### Abstract

On\-board compression of synthetic aperture radar \(SAR\) phase history is bandwidth\-critical, and block\-adaptive quantization \(BAQ\) remains the operational standard\. We test whether a small convolutional autoencoder, with its encoder on the sensor, can compete with BAQ on complex phase\-history patches from the AFRL GOTCHA collection\. Every method is charged for all transmitted bits, rates are reported in bits per complex sample \(b/cs\), and detection is scored by one\-to\-one matching of CA\-CFAR detections\. The autoencoder \(28 65628\\,656encoder parameters\) loses at every rate\. At 16 b/cs it reaches−2\.87dB\-2\.87\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}NMSE, against−35\.5dB\-35\.5\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}for 8\-bit BAQ with±3​σ\\pm 3\\sigmaclipping and−41\.0dB\-41\.0\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}with a tuned clipping range\. It also loses to a16×1616\\times 16block Karhunen–Loève transform \(KLT\), a local linear coder with a tenth of its encoder cost \(−5\.39dB\-5\.39\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}\)\. Running the network in a companded Fourier domain helps, but its detection F1 remains bounded at 33%\. The evidence points to this model, its normalization, and its objective, not to a fundamental limit of learned coding\. Per patch, the data have modest lag\-1 coherence \(\|ρ\|≈0\.3\|\\rho\|\\approx 0\.3\) and patch\-specific spectral concentration\. Two findings concern evaluation itself\. First, 97% of CFAR crossings on raw64×6464\\times 64patches are border artifacts of the zero\-padded detector\. Second, on interior cells BAQ’s clipping range decides detection: 8\-bit BAQ keeps 69% F1 with tuned clipping but 17% at±3​σ\\pm 3\\sigma, and at 8 b/cs or less adaptive FFT thresholding preserves more detections than BAQ\. We close with an evaluation protocol for learned radar compression\.

###### Index Terms:

Synthetic aperture radar, raw data compression, autoencoder, block adaptive quantization, transform coding, CFAR detection, rate\-distortion, GOTCHA\.

## IIntroduction

SAR sensors produce raw data faster than their downlinks can carry it, so the data are compressed on board before image formation, within tight power and latency budgets\. The operational standard is block\-adaptive quantization \(BAQ\)\[[1](https://arxiv.org/html/2609.35848#bib.bib1)\], which normalizes each block of I/Q samples by its local statistics and quantizes it to a few bits\. Sentinel\-1 uses a flexible, dynamically allocated variant \(FDBAQ\)\[[2](https://arxiv.org/html/2609.35848#bib.bib2)\]\. BAQ is cheap and robust, and it is hard to beat on raw data\[[3](https://arxiv.org/html/2609.35848#bib.bib3)\]\.

Learned transform coding has overtaken classical codecs on natural images\[[10](https://arxiv.org/html/2609.35848#bib.bib10),[11](https://arxiv.org/html/2609.35848#bib.bib11),[12](https://arxiv.org/html/2609.35848#bib.bib12)\]\. It is natural to ask whether a learned encoder small enough for a sensor platform can compress radar phase history better than BAQ\. This paper reports a feasibility study on that question using the AFRL GOTCHA dataset\[[4](https://arxiv.org/html/2609.35848#bib.bib4),[5](https://arxiv.org/html/2609.35848#bib.bib5)\]\. Several easy\-to\-make evaluation errors each made the learned coder look better than it is; we distill them into a protocol \(Section[VI\-D](https://arxiv.org/html/2609.35848#S6.SS4)\)\. Our contributions are:

1. 1\.A*compressibility characterization*of GOTCHA phase\-history patches on the full test set\.
2. 2\.A*split autoencoder*with the encoder on the sensor and the decoder on the ground, and a variant in a companded Fourier domain\.
3. 3\.A*rate\-honest benchmark*in bits per complex sample\. It includes BAQ with default and tuned clipping and the entropy of its indices, FFT hard\-thresholding, global and16×1616\\times 16block KLT coders, and an FP16 cast, with every side\-information bit charged\. Detection is scored one\-to\-one on interior cells, away from detector border artifacts\.
4. 4\.A*scoped negative result*and an*evaluation protocol*\.

## IIRelated Work

*Raw SAR data compression\.*BAQ was developed for Magellan\[[1](https://arxiv.org/html/2609.35848#bib.bib1)\], and its descendants remain standard\. Benz*et al\.*\[[3](https://arxiv.org/html/2609.35848#bib.bib3)\]compared BAQ with vector quantization and transform coding of raw data\. FDBAQ\[[2](https://arxiv.org/html/2609.35848#bib.bib2)\]adapts the quantizer to the signal\-to\-clutter ratio\. Entropy\-constrained BAQ adds variable\-length coding of the quantizer indices\[[6](https://arxiv.org/html/2609.35848#bib.bib6)\]\. A learned coder that is itself entropy coded should be compared with an entropy\-coded BAQ\.

*Transform coding\.*For Gaussian sources under MSE, the KLT followed by scalar quantization is the classical optimum among fixed linear transforms\[[7](https://arxiv.org/html/2609.35848#bib.bib7)\], and Lloyd–Max quantizers\[[8](https://arxiv.org/html/2609.35848#bib.bib8)\]optimize the scalar step\. A linear autoencoder trained with MSE converges to the principal subspace, that is, to the KLT\[[9](https://arxiv.org/html/2609.35848#bib.bib9)\]\.

*Learned compression\.*End\-to\-end optimized codecs\[[10](https://arxiv.org/html/2609.35848#bib.bib10),[12](https://arxiv.org/html/2609.35848#bib.bib12)\]and hyperprior entropy models\[[11](https://arxiv.org/html/2609.35848#bib.bib11)\]jointly train a transform, a quantizer, and an entropy model under a rate\-distortion objective\. The models studied here are not trained that way \(Section[IV](https://arxiv.org/html/2609.35848#S4)\)\.

*Deep learning on complex SAR data\.*Complex\-valued networks\[[13](https://arxiv.org/html/2609.35848#bib.bib13)\]and coherence\-preserving autoencoders\[[14](https://arxiv.org/html/2609.35848#bib.bib14)\]have been applied to focused single\-look complex imagery\. That imagery has spatial structure that phase history lacks, so their figures are not directly comparable to ours\.

## IIIData and Characterization

### III\-AWhat “Raw” Means Here

The public GOTCHA release holds 8 circular passes, 4 polarizations, and 360 files per pass and polarization, one per degree of azimuth, for11 52011\\,520files\[[5](https://arxiv.org/html/2609.35848#bib.bib5)\]\. Each file stores the phase history as a complex single\-precision array of 424 frequency samples \(9\.288GHzto9\.910GHz9\.288\\text\{\\,\}\\mathrm\{G\}\\mathrm\{H\}\\mathrm\{z\}9\.910\\text\{\\,\}\\mathrm\{G\}\\mathrm\{H\}\\mathrm\{z\},1\.47MHz1\.47\\text\{\\,\}\\mathrm\{M\}\\mathrm\{H\}\\mathrm\{z\}spacing\) by about 117 pulses, with the per\-pulse range to scene center\. These are k\-space samples referenced to the scene center\. They are not the analog\-to\-digital converter \(ADC\) stream that an on\-board BAQ processes\. Two consequences follow\. First, the 2\-D FFT of a patch is approximately a coarse sub\-aperture image, so Fourier\-domain structure \(Section[III\-C](https://arxiv.org/html/2609.35848#S3.SS3)\) largely reflects bright scatterers in the scene\. Second, rates quoted against FP32 storage overstate every method: a real front end produces 8–12 bits per I/Q component, or 16–24 bits per complex sample\. We therefore report rates in*bits per complex sample*\(b/cs\)\. The FP32 compression ratioCR=64/b\\mathrm\{CR\}=64/bis given only for reference\.

### III\-BTiling, Split, and Normalization

Each file’s array is tiled into non\-overlapping64×6464\\times 64patches from its first sample, giving 6 patches per file\. Tiling discards the last 40 of 424 frequency samples \(9%\) and about 53 of 117 pulses \(45%\)\. Patch rows index frequency and columns index pulse \(slow time\)\. Each patch therefore spans only94MHz94\\text\{\\,\}\\mathrm\{M\}\\mathrm\{H\}\\mathrm\{z\}of the622MHz622\\text\{\\,\}\\mathrm\{M\}\\mathrm\{H\}\\mathrm\{z\}band and 64 pulses \(about0\.55​°of azimuth\), which limits the structure any coder can exploit within one patch\. Each patch is stored as two real channels \(I and Q\), for69 12069\\,120patches in total\.

The split is random*at the file level*\(seed 42\):92169216training,11521152validation, and11521152test files, or55 29655\\,296,69126912, and69126912patches\. Because polarizations of the same pass and azimuth are separate files, every test file shares its pass and azimuth degree with at least one training file\. HV and VH are nearly identical by reciprocity, and HH and VV are strongly correlated, so many test patches have near\-duplicates in training\. This can only flatter the learned methods\. BAQ, FFT thresholding, and the FP16 cast learn nothing and are unaffected\. For the two KLT coders we measured the effect directly\. Refitting each with the test patch’s whole pass held out changes NMSE by0\.16dB0\.16\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}\(global KLT\) and less than0\.01dB0\.01\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}\(block KLT\)\. The autoencoders were not retrained on a held\-out split\.

All data are divided by one global max\-abs value computed on the training set \(1\.47×10−21\.47\\times 10^\{\-2\}\)\. After this scaling, the median sample magnitude is 0\.030\. Patch RMS levels span−35\.7dBto−19\.8dB\-35\.7\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}\-19\.8\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}relative to full scale \(5th to 95th percentile\), a16dB16\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}spread\. Within a patch, the16×1616\\times 16block standard deviations differ by only1\.9dB1\.9\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}\(median max/min ratio\)\. The per\-block gain that BAQ estimates is therefore mostly a per\-patch gain\.

### III\-CCompressibility Characterization

We measure the lag\-1 complex coherence along each axis,

ρ=\|𝔼⁡\[sn​sn\+1∗\]\|𝔼​\|sn\|2​𝔼​\|sn\+1\|2,\\rho=\\frac\{\\bigl\|\\mathbb\{E\}\\bigl\[s\_\{n\}\\,s\_\{n\+1\}^\{\*\}\\bigr\]\\bigr\|\}\{\\sqrt\{\\mathbb\{E\}\|s\_\{n\}\|^\{2\}\\,\\mathbb\{E\}\|s\_\{n\+1\}\|^\{2\}\}\},\(1\)with expectations taken within each patch and\|ρ\|\|\\rho\|then averaged over patches\. For comparison we also give the*pooled*estimate, with expectations taken over all patches at once\. We also measure the fraction of energy in the topqqof 2\-D FFT bins, which for white complex Gaussian data isq⁡\(1\+ln⁡\(1/q\)\)q\(1\+\\ln\(1/q\)\), and the energy captured by the leading half of the KLT modes \(Section[IV\-E](https://arxiv.org/html/2609.35848#S4.SS5)\)\. Table[I](https://arxiv.org/html/2609.35848#S3.T1)lists all quantities\.

TABLE I:Compressibility of GOTCHA phase\-history patchesQuantity \(test set unless noted\)Freq\.PulseWhite\|ρ\|\|\\rho\|, per patch \(mean\)0\.2680\.3130\.014\|ρ\|\|\\rho\|, pooled over all patches0\.0210\.126≈0\\approx 0Energy in top 1% of FFT bins0\.3720\.056Energy in top 10% of FFT bins0\.6710\.330Top 2048 of 4096 KLT modes:eigenvalue share \(training set\)0\.8130\.500energy captured, pooled0\.7330\.500energy captured, per\-patch mean0\.6640\.500Per patch,\|ρ\|≈0\.3\|\\rho\|\\approx 0\.3on both axes, 20 times the white\-noise value\. Each patch’s lag\-1 correlation has a phase set by its scatterers’ positions, so the pooled estimate cancels it and can be misleadingly small\. The correlation is still weak for predictive coding: a first\-order predictor gains only−10​log10⁡\(1−\|ρ\|2\)≈\-10\\log\_\{10\}\(1\-\|\\rho\|^\{2\}\)\\approx0\.3dBto0\.45dB0\.3\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}0\.45\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}\. The Fourier concentration is strong \(the top 1% of bins hold6\.6×6\.6\\timesthe white\-noise share\), but the energetic bins differ from patch to patch\. Per\-patch adaptive selection captures 67% of the energy with 10% of the bins, whereas a single global KLT captures 73% of test energy with half of its modes\. The KLT captures less on test data than its training eigenvalue share \(81%\)\. Its per\-patch mean \(66%\) is lower still, because the high\-energy, scatterer\-dominated patches that dominate the pooled figure are the ones it captures best\. The pooled test figure is the one that sets NMSE:10​log10⁡\(1−0\.733\)=−5\.73dB10\\log\_\{10\}\(1\-0\.733\)=$\-5\.73\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}$, the value in Table[IV](https://arxiv.org/html/2609.35848#S5.T4)\.

## IVMethod

### IV\-ASplit Autoencoder Architecture

The encoder runs on the sensor and the decoder on the ground\. Table[II](https://arxiv.org/html/2609.35848#S4.T2)lists the layers\. The encoder downsamples twice with strided3×33\\times 3convolutions, each followed by batch normalization\[[15](https://arxiv.org/html/2609.35848#bib.bib15)\], GELU\[[16](https://arxiv.org/html/2609.35848#bib.bib16)\], and a residual block\[[17](https://arxiv.org/html/2609.35848#bib.bib17)\]\. This yields a real latent𝐳∈ℝC×16×16\\mathbf\{z\}\\in\\mathbb\{R\}^\{C\\times 16\\times 16\}, and each latent value has a31×3131\\times 31\-sample receptive field\. The decoder mirrors the encoder with4×44\\times 4stride\-2 transposed convolutions\. The latent is sent as FP16 with no entropy coding, so the rate is

b=16⋅C⋅16⋅1664⋅64=C​b/cs,b=\\frac\{16\\cdot C\\cdot 16\\cdot 16\}\{64\\cdot 64\}=C\\ \\text\{b/cs\},\(2\)andC∈\{4,8,16,32,64\}C\\in\\\{4,8,16,32,64\\\}gives 4–64 b/cs\. Whether the latents tolerate coarser quantization, and how much entropy coding would save, was not tested\.

TABLE II:Autoencoder layers \(latent widthCC; outputCout×H×WC\_\{\\text\{out\}\}\\times H\\times W\)LayerOutputEncoderConv3×33\\times 3/2, BN, GELU32×32×3232\\times 32\\times 32ResBlock\(32\)32×32×3232\\times 32\\times 32Conv3×33\\times 3/2, BN, GELUC×16×16C\\times 16\\times 16ResBlock\(CC\)C×16×16C\\times 16\\times 16DecoderResBlock\(CC\)C×16×16C\\times 16\\times 16ConvT4×44\\times 4/2, BN, GELU32×32×3232\\times 32\\times 32ResBlock\(32\)32×32×3232\\times 32\\times 32ConvT4×44\\times 4/22×64×642\\times 64\\times 64ResBlock:x\+BN⁡\(Conv⁡\(GELU⁡\(BN⁡\(Conv⁡\(x\)\)\)\)\)x\+\\mathrm\{BN\}\(\\mathrm\{Conv\}\(\\mathrm\{GELU\}\(\\mathrm\{BN\}\(\\mathrm\{Conv\}\(x\)\)\)\)\),3×33\\times 3kernels\.
### IV\-BTarget\-Focal Coherent Loss

Plain MSE collapses to a zero output \(Section[V\-A](https://arxiv.org/html/2609.35848#S5.SS1)\)\. We instead combine anℓ1\\ell\_\{1\}term, an amplitude\-weighted magnitude term, and an amplitude\-weighted phase term\. Lets=xI\+j​xQs=x\_\{I\}\+jx\_\{Q\}ands^\\hat\{s\}be input and reconstruction, witha=\|s\|/max⁡\|s\|a=\|s\|/\\max\|s\|per patch:

ℒ=‖𝐱^−𝐱‖1\+\(1\+α​aγ\)​\(\|s^\|−\|s\|\)2¯\+β​aγ​\(1−cos⁡\(∠⁡\(s^\+ϵ\)−∠⁡\(s\+ϵ\)\)\)¯,\\mathcal\{L\}=\\\|\\hat\{\\mathbf\{x\}\}\-\\mathbf\{x\}\\\|\_\{1\}\+\\overline\{\(1\+\\alpha a^\{\\gamma\}\)\\,\(\|\\hat\{s\}\|\-\|s\|\)^\{2\}\}\\\\ \+\\beta\\,\\overline\{a^\{\\gamma\}\\,\\bigl\(1\-\\cos\(\\angle\(\\hat\{s\}\+\\epsilon\)\-\\angle\(s\+\\epsilon\)\)\\bigr\)\},\(3\)where the overbar is a mean over samples,α=5\\alpha=5,γ=2\\gamma=2,β=1\\beta=1, andϵ=10−6\\epsilon=10^\{\-6\}\. The focal weight\[[18](https://arxiv.org/html/2609.35848#bib.bib18)\]emphasizes strong scatterers\. Theϵ\\epsilonoffset avoids NaN gradients of∠⁡\(⋅\)\\angle\(\\cdot\)at the origin\. After normalization,ϵ\\epsilonis3×10−53\\times 10^\{\-5\}of the median\|s\|\|s\|, and only 0\.003% of samples lie below10−510^\{\-5\}, so it does not bias the phase of typical samples\. The loss is not MSE, so the NMSE comparisons below are not what the network was trained to minimize\.

### IV\-CTransform\-Domain Variant

A variant computesS=fftshift⁡\(FFT2⁡\(s\)\)S=\\mathrm\{fftshift\}\(\\mathrm\{FFT2\}\(s\)\)with orthonormal scaling and applies an invertible magnitude compander

𝒞⁡\(S\)\\displaystyle\\mathcal\{C\}\(S\)=S\|S\|​log⁡\(1\+\|S\|σ\),\\displaystyle=\\frac\{S\}\{\|S\|\}\\,\\log\\\!\\left\(1\+\\frac\{\|S\|\}\{\\sigma\}\\right\),\(4\)𝒞−1​\(Z\)\\displaystyle\\mathcal\{C\}^\{\-1\}\(Z\)=Z\|Z\|​σ​\(e\|Z\|−1\),\\displaystyle=\\frac\{Z\}\{\|Z\|\}\\,\\sigma\\left\(e^\{\|Z\|\}\-1\\right\),withσ=0\.0213\\sigma=0\.0213, the median training spectral magnitude\. The same network runs on the companded spectrum\. Its output is expanded and inverse transformed, so the loss and metrics still apply to I/Q samples, at the same rate as the sample\-domain model\.

### IV\-DTraining

Models are trained for 15 epochs with AdamW\[[19](https://arxiv.org/html/2609.35848#bib.bib19)\]\(learning rate5×10−45\\times 10^\{\-4\}, weight decay10−410^\{\-4\}\), batch size 64, and gradient\-norm clipping at 1\.0\. Batches with a non\-finite loss are skipped\. We keep the checkpoint with the best validation loss\.

### IV\-EBaselines and Rate Accounting

*FP16 cast\.*Each I and Q value is rounded to FP16 \(32 b/cs\), a reference point for theC=32C=32autoencoder\.

*BAQ\.*Each16×1616\\times 16block of each I/Q channel is normalized by its standard deviation and quantized with annn\-bit mid\-rise uniform quantizer over±c​σ\\pm c\\sigma\. The rate is2​n2nb/cs plus one FP16 scale per block and channel \(2​n\+0\.1252n\+0\.125b/cs\)\. We reportc=3c=3and, per bit depth, theccthat minimizes validation NMSE \(grid 1–8 in steps of 0\.25\)\. We also reportHH, the zeroth\-order entropy of the quantizer indices plus the 0\.125 b/cs of scales\. This is the rate an ideal memoryless entropy coder would need, a proxy for entropy\-constrained BAQ\[[6](https://arxiv.org/html/2609.35848#bib.bib6)\]\.

*FFT hard\-thresholding\.*Per patch, the largest fractionkkof 2\-D FFT coefficients is kept at 32 bits each \(FP16 complex\), plus a 4096\-bit position map:32​k\+132k\+1b/cs\.

*Global KLT\.*We estimate the4096×40964096\\times 4096complex covariance of vectorized training patches, keep its topKKeigenvectors, and send theKKcoefficients as FP16 complex values with no side information:K/128K/128b/cs\. Its encoder is a patch\-wide projection with4096​K4096Kcomplex weights \(67MB67\\text\{\\,\}\\mathrm\{M\}\\mathrm\{B\}atK=2048K=2048\) and4​K4Kreal MAC per complex sample \(8192 atK=2048K=2048\)\. No31×3131\\times 31convolutional encoder can represent it, and it is not deployable\. We use it as an upper\-bound anchor for fixed linear coding\.

*Block KLT\.*The like\-for\-like linear baseline for a local convolutional encoder is a16×1616\\times 16block KLT: the same procedure on the 256\-dimensional vectors of16×1616\\times 16blocks, keepingkkof 256 coefficients per block \(k/8k/8b/cs\)\. Its encoder has256​k256kcomplex weights \(256KB256\\text\{\\,\}\\mathrm\{K\}\\mathrm\{B\}atk=128k=128\) and needs4​k4kreal MAC per complex sample, 512 at 16 b/cs, about a tenth of the autoencoder’s53005300\. FP16 coefficients carry their own exponent, so no explicit block scaling is needed\.

### IV\-FMetrics

*NMSE*is10​log10⁡\(∑‖𝐱^−𝐱‖2/∑‖𝐱‖2\)10\\log\_\{10\}\\bigl\(\\sum\\\|\\hat\{\\mathbf\{x\}\}\-\\mathbf\{x\}\\\|^\{2\}/\\sum\\\|\\mathbf\{x\}\\\|^\{2\}\\bigr\)over the full test set\.0dB0\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}corresponds to outputting zeros\.

*CFAR detection proxy\.*A 2\-D CA\-CFAR detector\[[22](https://arxiv.org/html/2609.35848#bib.bib22),[23](https://arxiv.org/html/2609.35848#bib.bib23)\]runs on\|s\|2\|s\|^\{2\}and\|s^\|2\|\\hat\{s\}\|^\{2\}per patch, with guard radius 2, training band 4 \(N=144N=144cells\), designPf​a=10−4P\_\{fa\}=10^\{\-4\}, and threshold multiplierN\(Pf​a−1/N−1\)N\(P\_\{fa\}^\{\-1/N\}\-1\)\. The local mean is computed by convolution with zero padding\. In the 6\-cell border band \(34% of cells\), the training window extends past the patch, the mean is underestimated, and the detector fires far too often \(Section[VI\-C](https://arxiv.org/html/2609.35848#S6.SS3)\)\. We therefore score detection on the*interior*52×5252\\times 52cells, where the window is complete\. We report the following:

- •*Recall, precision, and F1*under a maximum one\-to\-one matching of raw and decoded detections within±1\\pm 1cell \(Chebyshev\), computed per patch by the Hungarian algorithm\[[24](https://arxiv.org/html/2609.35848#bib.bib24)\]\. We give them on interior cells and, for comparison, on all cells\.
- •*Retention*: decoded detections within±1\\pm 1cell of any raw detection, divided by the number of raw detections, on all cells\. This many\-to\-one score is an upper bound on all\-cell recall\. It is the only detection score available for the autoencoders, whose checkpoints were not retained\.
- •The false\-alarm shiftΔ​Pf​a=\|Ndec−Nraw\|/Ncells\\Delta P\_\{fa\}=\|N\_\{\\text\{dec\}\}\-N\_\{\\text\{raw\}\}\|/N\_\{\\text\{cells\}\}\.

This proxy is not target detection \(Section[VI\-C](https://arxiv.org/html/2609.35848#S6.SS3)\)\.

## VResults

### V\-ADevelopment Trajectory

Table[III](https://arxiv.org/html/2609.35848#S5.T3)summarizes the design iterations at 16 b/cs \(C=16C=16\)\. The first model \(V0\) had a fully connected 64\-dimensional bottleneck and an MSE loss\. It learned to output zeros \(NMSE0\.00dB0\.00\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}\)\. Switching to \([3](https://arxiv.org/html/2609.35848#S4.E3)\), a convolutional latent, and theϵ\\epsilon\-guard produced non\-trivial reconstructions \(V2\)\. Runs without theϵ\\epsilon\-guard, or with a loss on the dB peak\-to\-background ratio at CFAR\-relevant cells, or with a PixelShuffle decoder\[[20](https://arxiv.org/html/2609.35848#bib.bib20),[21](https://arxiv.org/html/2609.35848#bib.bib21)\], were no better and are omitted\. V6 is V2 with seeding and best\-validation checkpointing\. V7 is V6 in the companded Fourier domain\. Because the checkpoints were not retained, detection is available only as all\-cell retention and the decoded detection count\. These give upper bounds: recall is at most the retention, and precision is at mostretention×Nraw/Ndec\\text\{retention\}\\times N\_\{\\text\{raw\}\}/N\_\{\\text\{dec\}\}\.

TABLE III:Design iterations at 16 b/cs, test set, all cells\.NdecN\_\{\\text\{dec\}\}: decoded CFAR detections \(Nraw=41 774N\_\{\\text\{raw\}\}=$41\\,774$\)\. F1 is an upper bound\.Three independent training runs of the same configuration and seed \(V6, seed 0\) gave−2\.49dB\-2\.49\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}/14\.05%, 14\.86% retention, and−2\.87dB\-2\.87\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}/12\.55% \(the run used in Table[IV](https://arxiv.org/html/2609.35848#S5.T4)\)\. They differ only in nondeterministic GPU kernels and in how much of the random\-number stream was consumed before training\. Run\-to\-run spread is thus about0\.4dB0\.4\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}and 2\.3 retention points\. V7 roughly triples retention but produces*more*detections than the raw data, and its precision bound \(31%\) is no better than V6’s \(35%\)\. Its F1 bound therefore rises only from 20% to 33%\. These all\-cell scores are dominated by border cells \(Section[VI\-C](https://arxiv.org/html/2609.35848#S6.SS3)\)\.

### V\-BRate\-Distortion Comparison

Fig\.[1](https://arxiv.org/html/2609.35848#S5.F1)and Table[IV](https://arxiv.org/html/2609.35848#S5.T4)compare the autoencoder sweep \(seed 0, best\-val\) with all baselines\.

12481632−40\-40−30\-30−20\-20−10\-1000Bits per complex sample \(log scale\)NMSE \(dB\), lower is betterAutoencoderBAQ,±3​σ\\pm 3\\sigmaBAQ, tuned clipFFT thresholdingGlobal KLT16×1616\\times 16block KLT

1248163200202040406060Bits per complex sample \(log scale\)Interior CFAR F1 \(%\)

Fig\. 1:Rate\-distortion on the GOTCHA test set, with rates in bits per complex sample including all side information \(FP32 storage is 64 b/cs\)\. Top: NMSE\. Bottom: one\-to\-one CFAR F1 on interior cells, with line styles as in the top panel\. The autoencoder is absent from the bottom panel because its checkpoints were not retained; its all\-cell retention is in Table[IV](https://arxiv.org/html/2609.35848#S5.T4)\. FP16 cast \(not plotted\):−73\.7dB\-73\.7\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}and 99\.96% interior F1 at 32 b/cs\.TABLE IV:Rate\-distortion and detection on the full test set\. b/cs: bits per complex sample \(FP32 = 64\)\. Ret\.: many\-to\-one retention, all cells\. F1 andΔ​Pf​a\\Delta P\_\{fa\}: one\-to\-one, all cells\. R/P/F1int\{\}\_\{\\text\{int\}\}: one\-to\-one on interior cells \(12501250raw detections\)\.HH: BAQ rate with ideal entropy coding of indices, including scales\.All cellsInterior cellsMethodb/csCRNMSE \(dB\)Ret\. \(%\)F1 \(%\)Δ​Pf​a\\Delta P\_\{fa\}\(10−410^\{\-4\}\)R \(%\)P \(%\)F1 \(%\)HH\(b/cs\)FP16 cast32\.02\.0−73\.67\-73\.6799\.9699\.940\.00100\.0099\.9299\.96–AE,C=32C=3232\.02\.0−4\.73\-4\.7340\.35––––––AE,C=16C=1616\.04\.0−2\.87\-2\.8712\.55––––––AE,C=8C=88\.08\.0−1\.88\-1\.887\.19––––––AE,C=4C=44\.016\.0−1\.06\-1\.066\.18––––––BAQ 8\-bit,±3​σ\\pm 3\\sigma16\.14\.0−35\.47\-35\.4778\.5287\.213\.09\.1296\.6116\.6715\.02BAQ 6\-bit,±3​σ\\pm 3\\sigma12\.15\.3−29\.96\-29\.9675\.0483\.953\.37\.2896\.8113\.5411\.03BAQ 4\-bit,±3​σ\\pm 3\\sigma8\.17\.9−19\.14\-19\.1461\.7870\.924\.42\.3282\.864\.517\.04BAQ 3\-bit,±3​σ\\pm 3\\sigma6\.110\.4−13\.21\-13\.2147\.4055\.955\.50\.0825\.000\.165\.09BAQ 2\-bit,±3​σ\\pm 3\\sigma4\.115\.5−7\.23\-7\.2321\.7428\.929\.10\.00–0\.003\.26BAQ 1\-bit,±3​σ\\pm 3\\sigma2\.130\.1−0\.73\-0\.730\.000\.0014\.80\.00–0\.002\.12BAQ 8\-bit,±3\.75​σ\\pm 3\.75\\sigma16\.14\.0−41\.01\-41\.0197\.1197\.900\.352\.7298\.6568\.7214\.40BAQ 6\-bit,±3\.25​σ\\pm 3\.25\\sigma12\.15\.3−30\.19\-30\.1986\.4490\.561\.519\.2094\.1231\.8910\.81BAQ 4\-bit,±2\.5​σ\\pm 2\.5\\sigma8\.17\.9−19\.60\-19\.6037\.0451\.098\.60\.00–0\.007\.50BAQ 3\-bit,±2\.25​σ\\pm 2\.25\\sigma6\.110\.4−14\.48\-14\.4815\.8925\.5611\.80\.00–0\.005\.73BAQ 2\-bit,±2​σ\\pm 2\\sigma4\.115\.5−9\.41\-9\.413\.105\.5714\.00\.00–0\.003\.94BAQ 1\-bit,±1\.5​σ\\pm 1\.5\\sigma2\.130\.1−4\.46\-4\.460\.000\.0014\.80\.00–0\.002\.12FFT keep 40%13\.84\.6−11\.37\-11\.3751\.2956\.703\.943\.1246\.6744\.82–FFT keep 20%7\.48\.6−7\.83\-7\.8329\.1334\.906\.524\.6427\.5226\.00–FFT keep 10%4\.215\.2−5\.89\-5\.8917\.7622\.087\.914\.2417\.8015\.82–FFT keep 5%2\.624\.6−4\.58\-4\.5812\.0715\.038\.66\.1610\.127\.66–FFT keep 2%1\.639\.0−3\.33\-3\.339\.2211\.118\.61\.925\.262\.81–FFT keep 1%1\.348\.5−2\.63\-2\.637\.529\.238\.90\.643\.331\.07–Global KLT,K=2048K=204816\.04\.0−5\.73\-5\.7343\.1439\.040\.29\.3613\.0910\.91–Global KLT,K=1024K=10248\.08\.0−3\.34\-3\.3422\.0021\.412\.31\.122\.111\.46–Global KLT,K=512K=5124\.016\.0−2\.22\-2\.2210\.6812\.446\.20\.321\.150\.50–Global KLT,K=256K=2562\.032\.0−1\.54\-1\.544\.176\.1410\.50\.000\.000\.00–Global KLT,K=128K=1281\.064\.0−1\.03\-1\.032\.604\.1812\.20\.000\.000\.00–Block KLT,k=128k=12816\.04\.0−5\.39\-5\.3939\.8634\.550\.67\.6810\.889\.01–Block KLT,k=64k=648\.08\.0−2\.92\-2\.9214\.4115\.895\.40\.882\.061\.23–Block KLT,k=32k=324\.016\.0−1\.71\-1\.715\.677\.759\.50\.161\.100\.28–Block KLT,k=16k=162\.032\.0−1\.02\-1\.022\.183\.4412\.70\.000\.000\.00–Block KLT,k=8k=81\.064\.0−0\.55\-0\.550\.340\.6514\.40\.000\.000\.00–*The autoencoder is model\-limited\.*At 32 b/cs, rounding the input to FP16 gives−73\.7dB\-73\.7\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}, while theC=32C=32autoencoder, sending the same number of FP16 values, gives−4\.7dB\-4\.7\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}\. The transform\-domain model \(Table[V](https://arxiv.org/html/2609.35848#S5.T5)\) reaches only−7\.7dB\-7\.7\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}at 64 b/cs, where an identity map is lossless\. The fair linear comparison is the16×1616\\times 16block KLT\. Like the autoencoder it is local, but its encoder costs a tenth as much\. It beats the autoencoder in NMSE at every rate:−5\.39dB\-5\.39\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}against−2\.87dB\-2\.87\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}at 16 b/cs,−2\.92dB\-2\.92\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}against−1\.88dB\-1\.88\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}at 8, and−1\.71dB\-1\.71\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}against−1\.06dB\-1\.06\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}at 4\. It also beats the autoencoder’s all\-cell retention at 8 and 16 b/cs\. The global KLT, which the autoencoder could not represent, adds only0\.3dBto0\.5dB0\.3\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}0\.5\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}over the block KLT at 4–16 b/cs\.

*BAQ dominates in NMSE\.*At 16 b/cs, 8\-bit BAQ reaches−35\.5dB\-35\.5\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}with±3​σ\\pm 3\\sigmaclipping and−41\.0dB\-41\.0\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}with±3\.75​σ\\pm 3\.75\\sigma\. FFT thresholding, with per\-patch adaptive support, beats both KLTs at similar rates \(−5\.89dB\-5\.89\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}at 4\.2 b/cs against−2\.22dB\-2\.22\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}and−1\.71dB\-1\.71\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}at 4 b/cs\), consistent with the patch\-specific concentration in Section[III\-C](https://arxiv.org/html/2609.35848#S3.SS3)\.

*Clipping sets both the NMSE slope and detection\.*With±3​σ\\pm 3\\sigmaclipping, BAQ gains16\.3dB16\.3\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}from 4 to 8 bits, about4\.1dB4\.1\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}per bit\. Clipping error dominates at high rates\. With the clipping tuned per bit depth, the gain is21\.4dB21\.4\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}, or5\.35dB5\.35\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}per bit, close to the6\.02dB6\.02\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}of an unclipped high\-rate quantizer\. Interior CFAR detections are strong, isolated peaks, and they are exactly what clipping removes\. At 16 b/cs, interior F1 is 16\.7% at±3​σ\\pm 3\\sigmaand 68\.7% at±3\.75​σ\\pm 3\.75\\sigma\. At 8 b/cs or less, every BAQ variant scores at most 4\.5% interior F1, both because the NMSE\-optimal clip there is narrow \(±2\\pm 2–2\.5​σ2\.5\\sigma\) and because coarse levels cannot represent a peak\. FFT thresholding keeps exactly these peaks and scores 16–26% interior F1 at 4–8 b/cs\. A detection\-oriented coder at low rates should therefore preserve peaks, by clipping widely or by coding a sparse set of transform coefficients\. Entropy coding the BAQ indices saves 0\.2–1\.7 b/cs \(columnHH\), so an entropy\-coded learned coder must be compared with an entropy\-coded BAQ\.

### V\-CTransform\-Domain Rate Sweep

Table[V](https://arxiv.org/html/2609.35848#S5.T5)sweeps the transform\-domain model\. It was trained for 8 epochs with the last checkpoint kept, so its values are pessimistic relative to V7\.

TABLE V:Transform\-domain autoencoder sweep \(8 epochs, last checkpoint\)
### V\-DImage\-Domain Illustration

Fig\.[2](https://arxiv.org/html/2609.35848#S5.F2)shows one test patch at 16 b/cs \(V6\), with its FFT magnitude as a coarse image\. The dominant scatterer and a few secondary returns survive, but the low\-level background is suppressed by more than10dB10\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}in places\. The focused complex coherence on this patch is 0\.813\. The example is a single patch and is illustrative only\.

![Refer to caption](https://arxiv.org/html/2609.35848v1/figures/sar_reconstruction.png)002020404060606040200Cross\-range binRange binRaw: FFT magnitude \(dB\)![Refer to caption](https://arxiv.org/html/2609.35848v1/figures/sar_reconstruction.png)00−20\-20−40\-40−60\-60![Refer to caption](https://arxiv.org/html/2609.35848v1/figures/sar_reconstruction.png)00202040406060Cross\-range binDecoded: FFT magnitude \(dB\)![Refer to caption](https://arxiv.org/html/2609.35848v1/figures/sar_reconstruction.png)00−20\-20−40\-40−60\-60![Refer to caption](https://arxiv.org/html/2609.35848v1/figures/sar_reconstruction.png)002020404060606040200PulseFrequency samplePhase error \(deg\)![Refer to caption](https://arxiv.org/html/2609.35848v1/figures/sar_reconstruction.png)006060120120180180Fig\. 2:One test patch at 16 b/cs \(V6\)\. Left: FFT magnitude of the raw patch, a coarse image \(dB relative to its peak\)\. Center: the same for the decoded patch\. Right: per\-sample phase error in the phase\-history domain \(degrees\)\.
### V\-EComputational Footprint

Table[VI](https://arxiv.org/html/2609.35848#S5.T6)gives exact parameter and multiply\-accumulate \(MAC\) counts\. TheC=16C=16encoder needs 21\.8 MMAC per patch, about53005300MAC per complex sample\. The block KLT at the same rate needs 512, and BAQ needs a few operations per sample: a block variance, a scale, and a comparison\. At a complex sample ratefsf\_\{s\}, the autoencoder needs5\.3×103​fs5\.3\\times 10^\{3\}f\_\{s\}MAC/s, which is0\.53TMAC/s0\.53\\text\{\\,\}\\mathrm\{T\}\\mathrm\{M\}\\mathrm\{A\}\\mathrm\{C\}\\mathrm\{/\}\\mathrm\{s\}at100MS/s100\\text\{\\,\}\\mathrm\{M\}\\mathrm\{S\}\\mathrm\{/\}\\mathrm\{s\}and5\.3TMAC/s5\.3\\text\{\\,\}\\mathrm\{T\}\\mathrm\{M\}\\mathrm\{A\}\\mathrm\{C\}\\mathrm\{/\}\\mathrm\{s\}at1GS/s1\\text\{\\,\}\\mathrm\{G\}\\mathrm\{S\}\\mathrm\{/\}\\mathrm\{s\}\. On\-board radar processors are usually FPGAs or radiation\-tolerant devices\. Sustaining this throughput there, even at INT8, would be a substantial cost that we have not demonstrated\. We have no on\-target latency or power measurements\.

TABLE VI:Exact model complexity per64×6464\\times 64patch \(conv/deconv MACs\)

## VIDiscussion

### VI\-AWhat Limits the Autoencoder

The evidence supports a narrow conclusion\.*This*28k\-parameter encoder, trained for 15 epochs with a non\-MSE loss on globally normalized data, loses to BAQ, and also to a local linear transform with a tenth of its encoder cost\. It does not show that learned coding of phase history is fundamentally limited\. Three factors are confounded with “learned versus not”:

- •*Capacity and optimization\.*The network cannot approach an identity map at 32–64 b/cs, and it underperforms the block KLT at matched rates\.
- •*Normalization\.*BAQ normalizes each block, and within a patch the block scales differ by only1\.9dB1\.9\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}, so this is essentially per\-patch gain normalization\. The network instead sees patches whose RMS level spans16dB16\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}and sits 20–36dB36\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}below full scale\. Batch normalization in the decoder path does not undo a per\-sample gain\.
- •*Objective\.*The loss \([3](https://arxiv.org/html/2609.35848#S4.E3)\) is not MSE, so NMSE is not what the model optimizes\.

The data do constrain what any coder can gain\. Local correlation is modest \(Table[I](https://arxiv.org/html/2609.35848#S3.T1)\), and the spectral concentration is patch\-specific, which favors per\-patch adaptive methods\. The most informative next experiment separates normalization from learning\. Dividing each patch by its RMS and sending one FP16 scale costs16/4096≈0\.00416/4096\\approx 0\.004b/cs\. A network trained on such input, or one that learns a residual on top of BAQ, would test whether learning adds anything once the gain confound is removed\.

### VI\-BRelation to Image Formation

Since the data are deramped k\-space samples \(Section[III\-A](https://arxiv.org/html/2609.35848#S3.SS1)\), the 2\-D FFT of a patch is close to a coarse sub\-aperture image\. Much of the Fourier concentration in Table[I](https://arxiv.org/html/2609.35848#S3.T1)reflects bright scatterers in the scene\. V7, which operates on this spectrum, is close to compressing a coarse image\. This fits the view that learned compression pays off for SAR mainly after image formation, where focused imagery\[[14](https://arxiv.org/html/2609.35848#bib.bib14)\]has the spatial structure that learned codecs exploit\.

### VI\-CWhat the CFAR Proxy Measures

On raw test patches, CA\-CFAR fires on41 77441\\,774of2\.83×1072\.83\\times 10^\{7\}cells, an empiricalPf​aP\_\{fa\}of1\.5×10−31\.5\\times 10^\{\-3\}\. Of these detections, 97% lie in the 6\-cell border band\. There the zero\-padded training window underestimates the local mean, and the empirical rate is4\.2×10−34\.2\\times 10^\{\-3\},42×42\\timesthe design value\. On the interior cells it is6\.7×10−56\.7\\times 10^\{\-5\}, below the designPf​aP\_\{fa\}, with12501250detections\. All\-cell scores \(retention, all\-cell F1, and every autoencoder detection number in this paper\) therefore mostly measure how a coder perturbs the energy near patch borders\. Interior scores measure how well it preserves strong, isolated peaks in the phase\-history power map\. The two can rank methods differently\.±3​σ\\pm 3\\sigmaBAQ at 8 bits has 87% all\-cell F1 but 17% interior F1, while FFT thresholding keeps 45% interior F1 at 13\.8 b/cs\. Neither is target detection\. A meaningful operational test forms full\-aperture images from the decompressed phase history and scores detection of the known GOTCHA targets and calibration reflectors\.

### VI\-DA Recommended Evaluation Protocol

Each item below guards against an error that makes a learned coder look better than it is\.

1. 1\.*Derive the rate from the bits sent\.*Take the latent shape and dtype from the encoder output, and report bits per complex sample\. A stale latent size overstated our ratio16×16\\times, and a spurious “complex” factor understated it2×2\\times\.
2. 2\.*Charge all side information\.*FFT thresholding credited with10:110\{:\}1at FP32 and with free positions is really15\.2:115\.2\{:\}1at 4\.2 b/cs\.
3. 3\.*Use real baselines at their best settings\.*Use block\-adaptive quantization with tuned clipping and an entropy\-coded variant, not a global uniform quantizer \(which reaches only−1\.5dB\-1\.5\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}at 4 bits, against−19\.6dB\-19\.6\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}\)\. Add an FP16 cast and a block KLT as sanity anchors\.
4. 4\.*Evaluate every method on the same full test set,*not on one batch\.
5. 5\.*Estimate coherence per patch\.*Pooled estimators cancel patch\-specific phase and can suggest that the data are white\.
6. 6\.*Score detection one\-to\-one, away from borders\.*Report recall, precision, andΔ​Pf​a\\Delta P\_\{fa\}on cells where the CFAR window is complete\.
7. 7\.*Report seed spread\.*Runs differing only in seeding and checkpoint selection spanned2\.5dB2\.5\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}NMSE, and even one seed varied by0\.4dB0\.4\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}across runs\.
8. 8\.*Split by acquisition,*by pass or azimuth sector, not by file\.

## VIILimitations and Future Work

The study uses one dataset and fixed64×6464\\times 64patches of deramped k\-space data, not ADC samples\. The autoencoders were trained on a file\-level split that leaks pass and azimuth geometry into the test set, and they were not retrained on a held\-out split\. For the linear coders this leakage is worth at most0\.16dB0\.16\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}\. Training runs are short, seeds were varied at one rate only, and latents are unquantized\. Autoencoder checkpoints were not retained, so their detection scores are all\-cell bounds that cannot be recomputed on interior cells\. There are no on\-target hardware measurements\. In priority order, the next steps are:

1. 1\.a per\-patch\-normalized autoencoder, with the scale sent as side information, or a learned residual on top of BAQ;
2. 2\.a retrained autoencoder sweep scored on interior cells;
3. 3\.quantized, entropy\-coded latents trained under a rate\-distortion objective\[[11](https://arxiv.org/html/2609.35848#bib.bib11)\], compared against entropy\-coded BAQ;
4. 4\.a pass\-held\-out split for the learned models;
5. 5\.detection on formed full\-aperture imagery with ground\-truth targets;
6. 6\.throughput and power on a representative FPGA or radiation\-tolerant target\.

## VIIIConclusion

We benchmarked a lightweight split autoencoder for on\-board compression of GOTCHA phase history, charging every method for every transmitted bit and reporting rates in bits per complex sample\. The autoencoder lost to BAQ at every rate, by32\.6dB32\.6\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}NMSE at 16 b/cs, or38\.1dB38\.1\\text\{\\,\}\\mathrm\{d\}\\mathrm\{B\}against BAQ with tuned clipping\. It also lost to a16×1616\\times 16block KLT with a tenth of its encoder cost\. The evidence attributes the loss mainly to the model, its normalization, and its objective, not to a fundamental property of the data\. Two results concern evaluation more broadly\. CFAR scores on small raw patches are dominated by border artifacts unless restricted to interior cells\. On those cells, the clipping range, not the bit depth alone, decides whether BAQ preserves detections, and at low rates sparse transform coding preserves them better\. The first experiment to run next is a learned coder on top of BAQ’s per\-patch normalization\.

## Acknowledgment

The phase\-history data used in this work are the Gotcha Volumetric SAR Data Set, Version 1\.0, provided by the Air Force Research Laboratory, Sensors Directorate \(AFRL/SNA\), which is gratefully acknowledged as the source of the data \(public release no\. SN\-07\-0045, AFRL/WS\-07\-0528\)\.

## References

- \[1\]R\. Kwok and W\. T\. K\. Johnson, “Block adaptive quantization of Magellan SAR data,”*IEEE Trans\. Geosci\. Remote Sens\.*, vol\. 27, no\. 4, pp\. 375–383, Jul\. 1989\.
- \[2\]E\. Attema, C\. Cafforio, M\. Gottwald, P\. Guccione, A\. Monti Guarnieri, F\. Rocca, and P\. Snoeij, “Flexible dynamic block adaptive quantization for Sentinel\-1 SAR missions,”*IEEE Geosci\. Remote Sens\. Lett\.*, vol\. 7, no\. 4, pp\. 766–770, Oct\. 2010\.
- \[3\]U\. Benz, K\. Strodl, and A\. Moreira, “A comparison of several algorithms for SAR raw data compression,”*IEEE Trans\. Geosci\. Remote Sens\.*, vol\. 33, no\. 5, pp\. 1266–1276, Sep\. 1995\.
- \[4\]E\. Ertin, C\. D\. Austin, S\. Sharma, R\. L\. Moses, and L\. C\. Potter, “GOTCHA experience report: Three\-dimensional SAR imaging with complete circular apertures,” in*Proc\. SPIE 6568, Algorithms for Synthetic Aperture Radar Imagery XIV*, 2007, Art\. no\. 656802\.
- \[5\]C\. H\. Casteel, Jr\., L\. A\. Gorham, M\. J\. Minardi, S\. M\. Scarborough, K\. D\. Naidu, and U\. K\. Majumder, “A challenge problem for 2D/3D imaging of targets from a volumetric data set in an urban environment,” in*Proc\. SPIE 6568, Algorithms for Synthetic Aperture Radar Imagery XIV*, 2007, Art\. no\. 65680D\.
- \[6\]T\. Algra, “Data compression for operational SAR missions using entropy\-constrained block adaptive quantisation,” in*Proc\. IEEE Int\. Geosci\. Remote Sens\. Symp\. \(IGARSS\)*, 2002, pp\. 1135–1139\.
- \[7\]V\. K\. Goyal, “Theoretical foundations of transform coding,”*IEEE Signal Process\. Mag\.*, vol\. 18, no\. 5, pp\. 9–21, Sep\. 2001\.
- \[8\]J\. Max, “Quantizing for minimum distortion,”*IRE Trans\. Inf\. Theory*, vol\. 6, no\. 1, pp\. 7–12, Mar\. 1960\.
- \[9\]P\. Baldi and K\. Hornik, “Neural networks and principal component analysis: Learning from examples without local minima,”*Neural Netw\.*, vol\. 2, no\. 1, pp\. 53–58, 1989\.
- \[10\]J\. Ballé, V\. Laparra, and E\. P\. Simoncelli, “End\-to\-end optimized image compression,” in*Proc\. Int\. Conf\. Learn\. Represent\. \(ICLR\)*, 2017\.
- \[11\]J\. Ballé, D\. Minnen, S\. Singh, S\. J\. Hwang, and N\. Johnston, “Variational image compression with a scale hyperprior,” in*Proc\. Int\. Conf\. Learn\. Represent\. \(ICLR\)*, 2018\.
- \[12\]L\. Theis, W\. Shi, A\. Cunningham, and F\. Huszár, “Lossy image compression with compressive autoencoders,” in*Proc\. Int\. Conf\. Learn\. Represent\. \(ICLR\)*, 2017\.
- \[13\]C\. Trabelsi*et al\.*, “Deep complex networks,” in*Proc\. Int\. Conf\. Learn\. Represent\. \(ICLR\)*, 2018\.
- \[14\]R\. M\. Asiyabi, M\. Datcu, A\. Anghel, and H\. Nies, “Complex\-valued end\-to\-end deep network with coherency preservation for complex\-valued SAR data reconstruction and classification,”*IEEE Trans\. Geosci\. Remote Sens\.*, vol\. 61, 2023\.
- \[15\]S\. Ioffe and C\. Szegedy, “Batch normalization: Accelerating deep network training by reducing internal covariate shift,” in*Proc\. Int\. Conf\. Mach\. Learn\. \(ICML\)*, 2015, pp\. 448–456\.
- \[16\]D\. Hendrycks and K\. Gimpel, “Gaussian error linear units \(GELUs\),” arXiv:1606\.08415, 2016\.
- \[17\]K\. He, X\. Zhang, S\. Ren, and J\. Sun, “Deep residual learning for image recognition,” in*Proc\. IEEE Conf\. Comput\. Vis\. Pattern Recognit\. \(CVPR\)*, 2016, pp\. 770–778\.
- \[18\]T\.\-Y\. Lin, P\. Goyal, R\. Girshick, K\. He, and P\. Dollár, “Focal loss for dense object detection,” in*Proc\. IEEE Int\. Conf\. Comput\. Vis\. \(ICCV\)*, 2017, pp\. 2980–2988\.
- \[19\]I\. Loshchilov and F\. Hutter, “Decoupled weight decay regularization,” in*Proc\. Int\. Conf\. Learn\. Represent\. \(ICLR\)*, 2019\.
- \[20\]W\. Shi*et al\.*, “Real\-time single image and video super\-resolution using an efficient sub\-pixel convolutional neural network,” in*Proc\. IEEE Conf\. Comput\. Vis\. Pattern Recognit\. \(CVPR\)*, 2016, pp\. 1874–1883\.
- \[21\]A\. Odena, V\. Dumoulin, and C\. Olah, “Deconvolution and checkerboard artifacts,”*Distill*, 2016\.
- \[22\]H\. M\. Finn and R\. S\. Johnson, “Adaptive detection mode with threshold control as a function of spatially sampled clutter\-level estimates,”*RCA Rev\.*, vol\. 29, pp\. 414–464, 1968\.
- \[23\]M\. A\. Richards,*Fundamentals of Radar Signal Processing*, 2nd ed\. New York, NY, USA: McGraw\-Hill, 2014\.
- \[24\]H\. W\. Kuhn, “The Hungarian method for the assignment problem,”*Naval Res\. Logist\. Quart\.*, vol\. 2, no\. 1–2, pp\. 83–97, 1955\.

Similar Articles

dRAE: Representation Autoencoder with Hyper-Spherical Codes

Hugging Face Daily Papers

This paper proposes Hyper-Spherical Quantization (HSQ) to address codebook collapse in discretizing visual representations, achieving high-fidelity reconstruction and scalable codebook budgets up to 131,072 with 100% utilization.

AFP-GIC: Controllable Generative Image Compression [R]

Reddit r/MachineLearning

AFP-GIC, a controllable generative image compression framework published in IEEE Access (2026), uses an asymmetric Adaptive Fused Prior Transfer pipeline to reduce hallucinations and local distortion at ultra-low bitrates, achieving 18.1% lower decoder latency and 20.5% fewer parameters than DC-VIC, with released code, benchmark data, and an interactive Hugging Face demo.