New Bounds and Optimal Binary Signature Sets - Part II: Aperiodic Total Squared Correlation

Ganapathy, Harish; Pados, Dimitris A.; Karystinos, George N.

doi:10.1109/tcomm.2011.020811.090405

Cited by 28 publications

(11 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, the computations are done only for under loaded and single user systems. From the comparisons [21,22] it can be concluded that the Walsh like 8-length proposed codes are single user PTSC optimal and 6 and 12 length codes are ATSC optimal (Table 6).…”

Section: Auto and Cross Correlation Measuresmentioning

confidence: 97%

“…The performance of different spreading sequences is evaluated by maximum, mean, deviation and square sum of correlation values for even, odd and aperiodic cross correlations, Mean square aperiodic auto correlation (MSAAC), mean square aperiodic cross correlation (MSACC), and figure of merit (FOM) [6,[16][17][18][19]. Periodic total squared correlation (PTSC) and aperiodic total squared correlation (ATSC) [20][21][22] are also considered to understand the optimality of the proposed codes for various kinds of systems such as overloaded, under loaded and single user systems. The lower bounds on PTSC and ATSC for the proposed codes are tabulated in Table 4.…”

Section: Auto and Cross Correlation Measuresmentioning

confidence: 99%

“…The lower bounds on PTSC and ATSC for the proposed codes are tabulated in Table 4. From [21] and [22] the expressions (13) and (22) are considered for calculating the lower bounds on PTSC and ATSC respectively. If the number of users (K) that can be accommodated in the system is greater than the length of the spreading sequence (N) the system is known as The bold faced code words are the ones that common to different code sets overloaded.…”

Section: Auto and Cross Correlation Measuresmentioning

confidence: 99%

See 2 more Smart Citations

Performance Analysis of New Binary User Codes for DS-CDMA Communication

Usha¹,

Sankar²

2014

J. Inst. Eng. India Ser. B

View full text Add to dashboard Cite

This paper analyzes new binary spreading codes through correlation properties and also presents their performance over additive white Gaussian noise (AWGN) channel. The proposed codes are constructed using gray and inverse gray codes. In this paper, a n-bit gray code appended by its n-bit inverse gray code to construct the 2n-length binary user codes are discussed. Like Walsh codes, these binary user codes are available in sizes of power of two and additionally code sets of length 6 and their even multiples are also available. The simple construction technique and generation of code sets of different sizes are the salient features of the proposed codes. Walsh codes and gold codes are considered for comparison in this paper as these are popularly used for synchronous and asynchronous multi user communications respectively. In the current work the auto and cross correlation properties of the proposed codes are compared with those of Walsh codes and gold codes. Performance of the proposed binary user codes for both synchronous and asynchronous direct sequence CDMA communication over AWGN channel is also discussed in this paper. The proposed binary user codes are found to be suitable for both synchronous and asynchronous DS-CDMA communication.

show abstract

Section: Auto and Cross Correlation Measuresmentioning

confidence: 97%

Section: Auto and Cross Correlation Measuresmentioning

confidence: 99%

Section: Auto and Cross Correlation Measuresmentioning

confidence: 99%

See 1 more Smart Citation

Performance Analysis of New Binary User Codes for DS-CDMA Communication

Usha¹,

Sankar²

2014

J. Inst. Eng. India Ser. B

View full text Add to dashboard Cite

show abstract

“…When symbol detection at the first stage is incorrect, the signal processed at the second stage is given by (25). The SINR in this case is…”

Section: Appendix A: Equivalence Of Mmse-mf Mmse-mmse and Mmse-ml Dmentioning

confidence: 99%

“…A necessary condition for the existence of a Hadamard matrix is that its size is a multiple of four,[25].…”

mentioning

confidence: 99%

Toward a Preferred 4 x 4 Space-Time Block Code: A Performance-Versus-Complexity Sweet Spot with Linear-Filter Decoding

Kundu

Pados

et al. 2013

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

We develop a new 4 × 4 Hadamard-precoded quasiorthogonal space-time block code (QO-STBC) that enables highly effective near-maximum-likelihood (near-ML) reliability-based prioritized symbol detection using linear filters. Approximate block-error-rate minimization is being used to optimize the code rotation angle. Detailed computational complexity evaluation of the decoder in terms of real multiplications and additions shows significant complexity reduction for symbol alphabet sizes of interest. Numerical and simulation studies demonstrate negligible bit-error-rate degradation compared to the state-of-the-art in biterror-rate by ML decoded 4 × 4 codewords. Index Terms-Hadamard precoding, matched-filter (MF), maximum-likelihood (ML) detection, minimum-mean-squareerror (MMSE) filter, multi-input multi-output (MIMO) communications, quasi-orthogonal space-time block codes (QO-STBC).

show abstract

Optimal multiuser spread-spectrum data hiding in digital images

Wei

Pados

Batalama

et al. 2014

Security Comm. Networks

Self Cite

View full text Add to dashboard Cite

In this work, we intend to carry out optimized spread-spectrum concealment of multiuser data under a given digital image. First, the overall image is pre-processed into transform-domain small blocks from which host vectors are obtained via zig-zag scanning vectorization. Multiuser data hiding is performed in the generated host vectors. Under this data hiding system model, we give an orthogonal set of embedding spread-spectrum signatures that achieves maximum sum signalto-interference-plus-noise ratio at the output of the linear-filter receivers for any fixed embedding amplitude values. Then, for any given total embedding distortion constraint, we present the optimal multi-signature assignment and amplitude allocation that maximizes the sum capacity of the concealment procedure. The practical implication of the results is sum signal-to-interference-plus-noise ratio, sum-capacity optimal multiuser/multi-signature spread-spectrum data hiding in the digital image medium. Numerical results demonstrate the effectiveness of the proposed methods.

show abstract

New Bounds and Optimal Binary Signature Sets - Part II: Aperiodic Total Squared Correlation

Cited by 28 publications

References 40 publications

Performance Analysis of New Binary User Codes for DS-CDMA Communication

Performance Analysis of New Binary User Codes for DS-CDMA Communication

Toward a Preferred 4 x 4 Space-Time Block Code: A Performance-Versus-Complexity Sweet Spot with Linear-Filter Decoding

Optimal multiuser spread-spectrum data hiding in digital images

Contact Info

Product

Resources

About