Zobrazeno 1 - 10
of 176
pro vyhledávání: '"A, Budisin"'
Previously, we have presented a framework to use the para-unitary (PU) matrix-based approach for constructing new complementary sequence set (CSS), complete complementary code (CCC), complementary sequence array (CSA), and complete complementary arra
Externí odkaz:
http://arxiv.org/abs/1910.10310
Autor:
Budisin, Srdjan Z.
We extend the paraunitary (PU) theory for complementary pairs to comple- mentary sets and complete complementary codes (CCC) by proposing a new PU construction. A special, but very important case of complementary sets (and CC- C), based on standard d
Externí odkaz:
http://arxiv.org/abs/1808.10400
Autor:
Budišin, Srdjan, Spasojević, Predrag
We present a general algorithm for generating arbitrary standard complementary pairs of sequences (including binary, polyphase, M-PSK and QAM) of length 2^N using Boolean functions. The algorithm follows our earlier paraunitary algorithm, but does no
Externí odkaz:
http://arxiv.org/abs/1311.4782
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE Transactions on Signal Processing. 68:5546-5558
The concept of paraunitary (PU) matrices arose in the early 1990 s in the study of multi-rate filter banks. These matrices have found wide applications in cryptography, digital signal processing, and wireless communications. Existing PU matrices are
Publikováno v:
IEEE Transactions on Signal Processing. 67:2639-2648
Complete complementary codes (CCC) with equal sequence lengths have found numerous applications in wireless communications owing to their ideal correlation properties. In modern multi-user multi-rate communication systems, CCCs with various sequence
Publikováno v:
Epidemiology and Infection, 1990 Feb 01. 104(1), 127-133.
Externí odkaz:
https://www.jstor.org/stable/3863560
Publikováno v:
IEEE Signal Processing Letters. 26:4-8
Complementary sequence sets (CSSs) and complete complementary codes (CCCs) have many applications in science and engineering, especially in wireless communications. A construction of CSS and CCC, having size $M = {2^m}$ and length ${M^K}$ , where $m$
Autor:
Predrag Spasojevic, Srdan Z. Budisin
Publikováno v:
IEEE Transactions on Information Theory. 64:5938-5956
A Boolean generator for a large number of standard complementary QAM sequences of length $2^{K}$ is proposed. This Boolean generator is derived from the authors’ earlier paraunitary generator, which is based on matrix multiplications. Both generato
Publikováno v:
Clinical respiratory physiology, exercise and functional imaging.
Introduction: Chemotherapy has negativ effect on pulmonary function parameters (PFP), which are main criteria in preoperative assessment for surgery in patients suffer from non-small cell lung cancer (NSCLC). Aim: The aim of the study was to determin