Constructing and decoding GWBE codes using Kronecker products

Authors:
Pedram Pad;Mohammad Javad Faraji;Farokh Marvasti
Affiliations:
Advanced Communication Research Institute, Electrical Engineering Department, Sharif University of Technology, Tehran, Iran;Advanced Communication Research Institute, Electrical Engineering Department, Sharif University of Technology, Tehran, Iran;Advanced Communication Research Institute, Electrical Engineering Department, Sharif University of Technology, Tehran, Iran
Venue:
IEEE Communications Letters
Year:
2010

Citing 10
Cited 0

Multiuser Detection

Multiuser Detection
Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets

Designs, Codes and Cryptography
A class of errorless codes for overloaded synchronous wireless and optical CDMA systems

IEEE Transactions on Information Theory
Bounds on the sum capacity of synchronous binary CDMA channels

IEEE Transactions on Information Theory
Optimal sequences and sum capacity of synchronous CDMA systems

IEEE Transactions on Information Theory
CDMA codeword optimization: interference avoidance and convergence via class warfare

IEEE Transactions on Information Theory
Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum

IEEE Transactions on Information Theory
Generalized Welch bound equality sequences are tight frames

IEEE Transactions on Information Theory
Finite-step algorithms for constructing optimal CDMA signature sequences

IEEE Transactions on Information Theory
The maximum squared correlation, sum capacity, and total asymptotic efficiency of minimum total-squared-correlation binary signature sets

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this letter, we introduce a novel method for constructing large size Generalized Welch Bound Equality (GWBE) matrices. This method can also be used for the construction of large WBE matrices. The advantage of this method is its low complexity for constructing large size matrices and low computational complexity using Maximum Likelihood (ML) decoders for a subclass of these codes.