Optimal Upward Scaling of Minimum-TSC Binary Signature Sets

03/01/2020
by   Lili Wei, et al.
0

We consider upward scaling an overloaded min-TSC binary signature set and propose an optimal solution based on improved sphere decoding algorithm. Instead of previous suboptimal approach, we are guaranteed to find the optimal maximum-likelihood (ML) searching result with low complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/01/2020

Optimal Binary/Quaternary Adaptive Signature Design for Code-Division Multiplexing

We consider signature waveform design for synchronous code division mult...
research
07/19/2021

A Tree Search Approach for Maximum-Likelihood Decoding of Reed-Muller Codes

A low-complexity tree search approach is presented that achieves the max...
research
05/22/2019

Optimum Low-Complexity Decoder for Spatial Modulation

In this paper, a novel low-complexity detection algorithm for spatial mo...
research
11/29/2019

Lossless Size Reduction for Integer Least Squares with Application to Sphere Decoding

Minimum achievable complexity (MAC) for a maximum likelihood (ML) perfor...
research
03/29/2023

Maximum likelihood method revisited: Gauge symmetry in Kullback – Leibler divergence and performance-guaranteed regularization

The maximum likelihood method is the best-known method for estimating th...
research
01/29/2018

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Consider a binary linear code of length N, minimum distance d_min, trans...
research
10/19/2010

Maximum Likelihood Mosaics

The majority of the approaches to the automatic recovery of a panoramic ...

Please sign up or login with your details

Forgot password? Click here to reset