Search Results for author:
Found 2 papers, 0 papers with code
NOMA Computation Over Multi-Access Channels for Multimodal Sensing
This, in return, suggests that our proposed scheme is eminently suitable for multimodal sensor networks.
Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA
We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals Kamax is the largest known for the given code length L. In our complexity analysis, we illustrate that compared to maximum-likelihood (ML) decoder, which has an exponential computational complexity for even moderate code lengths, the proposed decoder has a quasi-quadratic computational complexity.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
