The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Inexpensive and rapid computational power provided powerful tools to overcome the limitations of current technologies and enabled us to apply several advanced statistical signal processing techniques for the design of receivers in wireless communications systems. In this presentation, we first mention the knowledge gaps in general. Then, we briefly explain two techniques, namely, the expectation maximization...
Complementary sequence pairs were introduced by Golay in 1951, and have found application to many areas of signal processing and communications, such as to radar, tomography, and to power control for multicarrier wireless transmission. They are attractive because the sum of their aperiodic autocorrelations has zero sidelobes, and therefore the sum of their Fourier power spectrums is completely flat...
Distributed source coding (DSC) considers the problem of separate compression and joint decompression of multiple correlated sources. Berger and Tung first introduced the multiterminal (MT) source coding problem and studied the region of all possible encoder rate tuples such that the sources are reconstructed under distortion constraints. One can loosely view MT source coding as the lossy version...
For the past decades, maximal linear recursive sequences (m-sequences) have been studied by many researchers. M-sequences have ideal autocorrelation property, which is useful in various wireless communication systems. Some m-sequences have low cross-correlation values which is essential property for extensive application of code division multiple access (CDMA) of spread spectrum communication systems...
Minimum mean square error (MMSE) is a common measure used in signal processing. On the other hand, mutual information is a common measure used in information theory. A connection between MMSE and mutual information has been revealed recently, which establishes an interesting MMSE-I relationship. In this talk, we will discuss the applications of the MMSE-I relationship in communication systems. In...
Linear complexity profile and correlation measure of order k are important pseudorandomness measures for sequences used in cryptography. We study both measures for a class of binary sequences called Legendre-Sidelnikov sequences. The proofs involve character sums.
We propose a computation method for linear complexity of series of generalized cyclotomic sequences with period pq. This method is based on using the polynomial of the classical cyclotomic sequence, this allows to obtain well-known results and also new results. We found the linear complexity of Whiteman generalized cyclotomic sequences based on cyclotomic classes of order six.
For cyclic codes we proposed a new lower bound of minimum distance by discrete Fourier transform (DFT). In this paper, we will show relationships between the proposed bound and the shift bound by numerical experiments. Moreover, the computational complexity of proposed lower bound is compared with the shift bound.
Binary sequences with low aperiodic autocorrelation function sidelobes, such as Barker, quasi-Barker, and minimum peak sidelobe sequences have found extensive applications in radar and communications systems. However, there is no systematic method to construct such desirable binary sequences except the use of time consuming and costly exhaustive computer search. In this paper, an upper bound on the...
In this present paper, we give results that a decrease of the control parameter in the logistic map over integers causes to disappear several loops which have specified periods. We derive the theoretical lower bound of the control parameter for a potential of existing the loop with an odd period on the logistic map over integers.
The present paper introduces a new approach to the construction of a sequence set with a zero-correlation zone (ZCZ). The proposed sequence construction generates a ZCZ sequence set from a perfect sequence pair or a single perfect sequence. The member size of the proposed sequence set approaches the theoretical bound. The proposed sequence set consists of Lg subsets, where a Hadamard matrix of order...
A new construction was proposed to design almost optimal sequence set with zero correlation zone(ZCZ). Based on the interleaved technique and recursive algorithm, a new ZCZ sequence set can be generated from an arbitrary perfect sequence, the length of which is longer than 4. And the ZCZ width and length of the new sequence can also be extended by recursive operation. The new sequence set can approach...
The present paper proposes a new formula for the zero-cross-correlation zone length between sequences belonging to different sequence subsets in asymmetric zero-correlation zone (ZCZ) sequence sets. An asymmetric ZCZ sequence set is composed of multiple sequence subsets, and the cross-correlation function between sequences that belong to different subsets gives an extremely large zero-cross-correlation...
Zero correlation zone (ZCZ) sequence sets are aimed for possible applications in the quasi-synchronous code-division multiple access (QS-CDMA) communication systems. In this paper, we first discuss the relationship between the upper bound on the zone length and the upper bound on the set size, which are both derived from the bound given by Tang, Fan and Matsufuji. Next, we show that several known...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.