Cyclic Cross-correlation Research Articles

Precise pointing angle deviation measurement forbeaconless laser communication.

How to measure the pointing angle precisely without the beacon light is crucial for beaconless laser communication. The conventional intensity method directly measures the intensity of a part of the communication signal beam, which has low sensitivity. We propose the characteristic signal method by superimposing a low-frequency sinusoidal signal on the communication signal to promote the measuring sensitivity. Simultaneously, a fast cyclic cross-correlation algorithm is used to reduce operational complexity. Compared with the experimental results of the direct intensity method, the proposed method can improve the measuring sensitivity about 9.17dB and increase the power budget for communication about 1.96dB.

Iterative Signal Processing for Integrated Sensing and Communication Systems

Integrated sensing and communication (ISAC), with sensing and communication sharing the same wireless resources and hardware, has the advantages of high spectrum efficiency and low hardware cost, which is regarded as one of the key technologies of the fifth generation advanced (5G-A) and sixth generation (6G) mobile communication systems. ISAC has the potential to be applied in the intelligent applications requiring both communication and high accurate sensing capabilities. The fundamental challenges of ISAC system are the ISAC signal design and ISAC signal processing. However, the existing ISAC signal has low anti-noise capability. And the existing ISAC signal processing algorithms have the disadvantages of quantization errors and high complexity, resulting in large energy consumption. In this paper, phase coding is applied in ISAC signal design to improve the anti-noise performance of ISAC signal. Then, the effect of phase coding method on improving the sensing accuracy is analyzed. In order to improve the sensing accuracy with low-complexity algorithm, the iterative ISAC signal processing methods are proposed. The proposed methods improve the sensing accuracy with low computational complexity, realizing energy efficient ISAC signal processing. Taking the scenarios of short distance and long distance sensing into account, the iterative two-dimensional (2D) fast Fourier transform (FFT) and iterative cyclic cross-correlation (CC) methods are proposed, respectively, realizing high sensing accuracy and low computational complexity. Finally, the feasibility of the proposed ISAC signal processing methods are verified by simulation results.

Code Constructions and Bounds for Identification via Channels

Consider the identification (ID) via channels problem, where a receiver decides whether the transmitted identifier is its identifier, rather than decoding it. This model allows to transmit identifiers whose size scales doubly-exponentially in the blocklength, unlike common transmission codes with exponential scaling. Binary constant-weight codes (CWCs) suffice to achieve the ID capacity. Relating parameters of a binary CWC to the minimum distance of a code and using higher-order correlation moments, two upper bounds on binary CWC sizes are proposed. These bounds are also upper bounds on identifier sizes for ID codes constructed by using binary CWCs. We propose two constructions based on optical orthogonal codes (OOCs), which are used in optical multiple access schemes, have constant-weight codewords, and satisfy cyclic cross-correlation and auto-correlation constraints. These constructions are modified and concatenated with outer Reed-Solomon codes to propose new binary CWCs being optimal for ID. Improvements to the finite-parameter performance are shown by using outer codes with larger minimum distance vs. blocklength ratios. We illustrate ID regimes for which our ID code constructions perform significantly better than existing constructions.

Time-Delay-Estimation-Liked Detection Algorithm for LoRa Signals Over Multipath Channels

LoRa promises long range reliable communication for the Internet of Things (IoT). However, multipath fading severely affects LoRa’s BER performance. In this letter, we propose a simple detection algorithm for the frame-based LoRa PHY signals mainly composed of a preamble and a variable-length PHY-payload. We first prove that detecting the frame-based LoRa signals over multipath fading channels can be formulated as a Time-delay-estimation (TDE)-liked problem. Based on this, a cyclic cross-correlation implemented by a matched filter is utilized to detect the LoRa signals. Additionally, the proposed TDE-liked detection algorithm is insensitive to the integer frequency offset due to the nature of implying a differential operation. The simulation results indicate that, the proposed algorithm significantly outperforms the existing detection algorithms for the LoRa signals over multipath fading channels. Under the multipath fading channel, the BER performance of the proposed algorithm is slightly inferior to that in the AWGN channel while the existing scheme fails to work.

Method to Measure Light Spot Position in Beacon-Less Inter-Satellite Communication System

This article focuses on a beacon-less Inter-satellite optical wireless communication (Is-OWC) system. This system uses the same wavelength for the transmitted and received laser beams and uses part of communication light beam as beacon light instead of an additional high divergent beacon laser. Thus, a part of transmitted light will be reflected in optical path and leaked into acquisition, tracking and targeting (ATP) subsystem. This reflected light will seriously interfere with the spot position measurement of received light. To solve this problem, we propose a new method based on intensity modulation and cyclic cross-correlation (CCR). Experiment results show that even when the reflected and received beams differ in intensity by 91.7 times, we can still accurately detect the received light spot position by using the proposed method, where the maximum error is 0.026 mrad and the root mean square error is as low as 0.012 mrad.

An Improved Method for the Position Detection of a Quadrant Detector for Free Space Optical Communication

In free space optical communication, a beacon light loses too much energy after a long-distance transmission and faces strong interference from background light. The beacon light illuminated on a quadrant detector (QD) is so weak that the output signal-to-noise ratio (SNR) of a QD is very low, which leads to a significant decrease in the accuracy of the direct position detection method. To solve this problem, an improved light spot position detecting method is proposed. Since the background light and the dark current noise are white noise, we could consider concentrating the energy of QD output signal at a certain frequency point to enhance the output SNR. Therefore, a cosine signal is used to modulate the intensity of a beacon light at the transmitting end. Then the QD output photocurrents are also cosine signals with the same frequency as the modulating signal. Putting the photocurrent signals into a cross-correlation operation with a reference signal, which is the same as the modulating signal, can enhance the QD output SNR at a certain frequency point. Unfortunately, the result of the classical cross-correlation is attenuated with increasing delay. It is hard to detect the amplitude of the classical cross-correlation result. So, we used cyclic cross-correlation to obtain a stable correlation result to detect its amplitude accurately. The experiment results show that even when the QD output SNR is less than −17 dB, the detection root-mean-square error of the proposed method is 0.0092 mm, which is a quarter of the direct position detection method. Moreover, this method only needs a small amount of data to accomplish the calculation and is especially suitable for real-time spot position detection.

Cyclostationary Noise Mitigation for SIMO Powerline Communications

The cyclostationary noise in low-voltage narrowband powerline communications (NB-PLC) severely degrades the communication reliability. In this paper, we adopt single-input multi-output (SIMO) transmission to enhance the reliability of NB-PLC. Considering the SIMO receiver structure, we exploit the NB-PLC noise cyclostationarity and the high spatial correlations across multiple receive phases to design practical and efficient noise mitigation techniques. In particular, we propose two time-domain frequency-shift (FRESH) filtering-based cyclostationary signal recovery techniques with different performance and complexity levels. The proposed time-domain-based FRESH filtering techniques minimize the mean-squared error in estimating the orthogonal frequency division multiplexing (OFDM) information signal in the time-domain. The FRESH filtering exploits the cyclic auto-correlation of both the NB-PLC noise and the OFDM information signal in addition to their cyclic cross-correlation across the receive phases. Moreover, we propose a frequency-domain-based cyclostationary noise mitigation technique that minimizes the mean-squared error in estimating the OFDM information signal in the frequency-domain. The proposed frequency-domain-based technique exploits the cyclostationarity of the noise to estimate its power spectral density as well as the cross-correlation, per frequency subchannel, over multiple stationary noise temporal regions. Our proposed SIMO NB-PLC noise mitigation techniques are shown via simulation results conducted using noise field measurements to achieve considerable performance gains over single-input single-output techniques. In addition, we show that our proposed techniques achieve considerable performance gains over the conventional SIMO maximal-ratio-combiner designed assuming stationary noise.

Optimum configuration for accurate simulations of chaotic porous media with Lattice Boltzmann Methods considering boundary conditions, lattice spacing and domain size

Simulations of the flow field through chaotic porous media are powerful numerical challenges of special interest in science and technology. The simulations are usually done over representative samples which summarise the properties of the material. Several factors affect the accuracy of the results. Firstly the spatial resolution has to be fine enough to be able to capture the smallest geometrical details. Secondly the domain size has to be large enough to contain the large characteristic scale of the porous media. And finally the effects induced by the boundary conditions have to be diluted when more realistic options are not available. This is the case when the geometry is obtained by tomography and the periodic boundary conditions cannot be applied to delimit the sample because its geometry is not periodic. Impermeable boundary conditions are usually chosen to enclose the domain, forcing mass conservation. As a result, the flow field is over-restricted and the total pressure drop can be over-estimated. In this paper a new strategy is presented to optimise the computational resources consumption keeping the restrictions imposed by the accuracy criteria. The effects of the domain size, discretisation thickness and boundary condition disturbances are studied in detail. The study starts with the procedural generation of chaotic porous walls which mimics acicular mullite filters. An advantage of this process is the possibility to create periodic geometries. Periodicity permits the application of advanced techniques such as cyclic cross-correlations between the phase field and the velocity component fields without aliasing. From cross-correlation operations the large characteristic scale is obtained. The result is a lower threshold for the domain size. In second place a mesh independent study is done to find the upper threshold for the lattice spacing. The Minkowski–Bouligand fractal dimension of the fluid–solid interface corroborates the results. It has been demonstrated how the fractal dimension is a good candidate to replace the mesh independent study with lower computational cost for this type of problems. The last step is to compare the results obtained for a periodic geometry applying periodicity and symmetry as boundary conditions. Considering the periodic case as reference the resultant error is analysed. The explanation of the analysis includes how the intensity of the error changes in space and the limitations of symmetric boundary conditions.

归一化循环相关超声回波时延估计

归一化循环相关超声回波时延估计

Generalized Likelihood Ratio Test For Cyclostationary Multi-Antenna Spectrum Sensing

In this paper, a generalized likelihood ratio test (GLRT) is proposed for cyclostationary multi-antenna spectrum sensing in cognitive radio systems, which takes into account the cyclic autocorrelations obtained from all the receiver antennas and the cyclic cross-correlations obtained from all pairs of receiver antennas. The proposed GLRT employs a different hypotheses problem formulation and a different asymptotic covariance estimation method, which are proved to be more suitable for multi-antenna systems than those employed by the Dandawate-Giannakis algorithm. Moreover, we derive the asymptotic distributions of the proposed test statistics, and prove the constant false alarm rate property of the proposed algorithm. Extensive simulations are conducted, showing that the proposed GLRT can achieve better detection performance than the Dandawate-Giannakis algorithm and its extension for multi-antenna cases.

Maximum likelihood and signal-selective TDOA estimation for noncircular signals

This paper addresses the issue of time-difference-of-arrival (TDOA) estimation for complex noncircular signals. First, under the wide-sense stationary assumption, we derive the maximum likelihood (ML) estimator and the Cramer-Rao lower bound for Gaussian noncircular signals in Gaussian circular noise. The ML estimator uses the second-order statistics information of a noncircular signal more comprehensively when compared with the cross-correlation (CC) and the conjugate CC estimators. Further, we present a scheme to modify the traditional signal-selective TDOA methods for noncircular signals on the basis of the cyclostationarity of man-made signals. This scheme simultaneously exploits the information contained in both the cyclic cross-correlation (CCC) and the conjugate CCC of a noncircular signal.

D2D 통신 시스템을 위한 CAZAC 시퀀스 기반 링크 스케줄링 기법

대표적인 D2D (Device-to-Device) 통신 시스템 중 하나인 Qualcomm사의 FlashLinQ 시스템에서는 링크 스케줄링 과정을 낮은 복잡도로 실현할 수 있도록 하기 위해 단일-톤 (single-tone) 신호를 이용한 우선순위 및 SIR (Signal-to-Interference power Ratio) 기반의 링크 스케줄링 기법을 수행한다. 하지만 다중 경로 채널 환경에서는 주파수 선택적 페이딩의 영향으로 단일-톤 위치에서와 실제 데이터가 전송되는 전체 대역에서의 수신 전력 간 오차가 발생할 수 있으며, 이는 공평성 측면에서 문제가 될 뿐만 아니라 셀 전체 전송률 상의 손실을 일으킬 수 있다. 따라서, 본 논문에서는 이러한 문제를 해결하기 위해 CAZAC (Constant Amplitude Zero Auto-Correlation) 시퀀스의 상관 특성을 이용해 전체 대역에 대한 SIR 에 가까운 값을 획득할 수 있는 링크 스케줄링 기법을 제안한다. 제안 기법은 전체 대역을 다수의 sub-block 으로 구분하고 각 sub-block 마다 링크의 우선순위에 해당하는 순환 오프셋 (cyclic offset) 을 적용한 CAZAC 시퀀스를 전 대역에 걸쳐 전송하여, 수신 신호와 참조 신호간의 순환 상호 상관 연산 (cyclic cross-correlation)을 통해 전체 대역에 대한 SIR 에 근접한 값을 획득할 수 있다. FlashLinQ, one of the typical D2D communication systems developed by Qualcomm, considers a single-tone communication based distributed channel-aware link scheduling method to realize the link scheduling process with low control overheads. However, considering the frequency selective fading effect of practical multi-path channel, the single-tone based SIR estimation causes a critical scheduling error problem because the received single-tone signal has quite different channel gain at each sub-carrier location. In order to overcome this problem, we propose a novel link scheduling method based on CAZAC (Constant Amplitude Zero Auto-Correlation) sequence for D2D communication system. In the proposed method, each link has a unique offset value set for the generation of CAZAC sequences. CAZAC sequences with the cyclic offsets are transmitted using multiple sub-blocks in the entire bandwidth, and then each device can obtain nearly full-band SIR using a good cyclic cross-correlation property of CAZAC sequence.

Study on Cyclic Cross-Correlation Behaviour of Maximal Length Pseudo-Random Binary Sequences

Cyclic cross-correlation function between image pairs of maximal length pseudo-random binary sequences is studied. It is found that the peak of the cross-correlation remains constant for every possible image pairs of the sequences of the same length. However, this unique property is not valid for all the other possible pairs.

Discrete-Time Estimation of Second-Order Statistics of Generalized Almost-Cyclostationary Processes

In this paper, the problem of estimating second-order statistics of continuous-time generalized almost-cyclostationary (GACS) processes is addressed. GACS processes in the wide sense have autocorrelation function almost-periodic in time whose generalized Fourier series expansion has both frequencies and coefficients that depend on the lag shifts. Almost-cyclostationary (ACS) processes are obtained as a special case when the frequencies do not depend on the lag shifts. ACS processes filtered by Doppler channels and communications signals with time-varying parameters are further examples. It is shown that continuous-time GACS processes do not have a discrete-time counterpart. The discrete-time cyclic cross-correlogram of the discrete-time ACS processes obtained by uniformly sampling GACS processes is considered as estimator of samples of the continuous-time cyclic cross-correlation function. The asymptotic performance analysis is carried out by resorting to the hybrid cyclic cross-correlogram which is partially continuous-time and partially discrete-time. Its mean-square consistency and asymptotic complex Normality as the number of data-samples approaches infinity and the sampling period approaches zero are proved under mild conditions on the regularity of the Fourier series coefficients and the finite or practically finite memory of the processes expressed in terms of summability of cumulants. It is shown that the asymptotic properties of the hybrid cyclic cross-correlogram are coincident with those of the continuous-time cyclic cross-correlogram. Hence, discrete-time estimation does not give rise to any loss in asymptotic performance with respect to continuous-time estimation.

Estimation of Second-Order Cross-Moments of Generalized Almost-Cyclostationary Processes

In this paper, the problem of estimating second-order cross-moments of generalized almost-cyclostationary (GACS) processes is addressed. GACS processes have statistical functions that are almost-periodic functions of time whose (generalized) Fourier series expansions have both frequencies and coefficients that depend on the lag shifts of the processes. The class of such nonstationary processes includes the almost-cyclostationary (ACS) processes which are obtained as a special case when the frequencies do not depend on the lag shifts. ACS processes filtered by Doppler channels and communications signals with time-varying parameters are further examples. It is shown that the second-order cross-moment of two jointly GACS processes is completely characterized by the cyclic cross-correlation function. Moreover, it is proved that the cyclic cross-correlogram is an asymptotically normal, mean-square consistent, estimator of the cyclic cross-correlation function. Furthermore, it is shown that well-known consistency results for ACS processes can be obtained by specializing the results of this paper.

Improved optimal linear filters for the discrimination of multichannel waveform templates for spike-sorting applications

Optimal linear filters are well known as a useful technique for processing extracellular recordings of neural activity. They can be tuned to respond only to a corresponding waveform template, while minimizing the energy of all other templates, and can be used to resolve spikes that are overlapping. The derivation of optimal linear multichannel filters goes back to , but the computation is usually carried out in the frequency domain. This procedure, however, may introduce artefacts, because it assumes a cyclic cross correlation as the filtering operation, which is not applicable for filtering long signals. The only way to avoid the problems of cyclic operations is zero padding, at the expense of longer filters and, hence, higher filtering costs. In this letter, we propose to derive the optimal linear multichannel filters in the time domain, using the correct noncyclic operations. This leads to a quadratic optimization problem with linear constraints and allows us to formulate the filters as a function of the waveform templates in closed form. We compare the quality of the time-domain derived filters to those derived in the frequency domain in terms of their responses to waveform templates, which we extracted from real tetrode recordings. It turns out that the time-domain filters never perform worse than the frequency-domain filters but can be significantly shorter with the same or better performance.

Sparse sequence construction of LDPC codes

This letter proposes a novel and simple construction of regular Low-Density Parity-Check (LDPC) codes using sparse binary sequences. It utilizes the cyclic cross correlation function of sparse sequences to generate codes with girth 8. The new codes perform well using the sumproduct decoding. Low encoding complexity can also be achieved due to the inherent quasi-cyclic structure of the codes.

A Cyclic Statistics-Based Parametric Approach to Time-Delay Estimation

The problem of estimating the difference in arrival times of a radio wave impinging on two spatially separated antennas is considered. By exploiting the cyclostationary property of the signal of interest, a new parameter estimation algorithm that is highly tolerant to interference and noises is proposed. The new algorithm models the time-delay operator as a finite impulse response (FIR) filter. From a set of linear equations involving cyclic (cross) correlation, the time delay is estimated to be the index of the FIR filter parameter that has the maximum value. When the signal of interest has a known (or measurable) carrier frequency or keying rate that is distinct from those of interference, the new approach exhibits signal selectivity from the temporally, spectrally, or spatially overlapped interference and noises. The computational complexity of the new approach is comparable to that of the conventional method.

An interference-tolerant algorithm for localization of cyclostationary-signal sources

A method for detecting the number of cyclostationary signals radiated by remote sources and for estimating their directions of arrival by a linear and uniform array is presented. Whereas the traditional techniques exploit the spatial coherent properties, the new method locates the signal sources using the spectral coherence properties as well. This approach eliminates the need to know the characteristics of the noise and the interference, regardless of the extent of their spectral overlap. Moreover, the method applied equally well to environments containing more interferers than sensors. The conditions of applicability of the method are the existence and the knowledge of a cycle frequency at which all the signal sources exhibit spectral correlation but the noise and interference signals do not, and the existence and the knowledge of a value of the lag parameter such that the cyclic cross-correlation matrix of the desired signals has full rank.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

2-D quasi m-arrays and Gold code arrays

Two-dimensional quasi-maximal-area arrays (quasi-m-arrays) are proposed. These quasi-m-arrays are so named because their cyclic correlation properties are very close to those of the m-arrays. These arrays are generated by modulo-2 addition of maximal length sequences. The cyclic autocorrelation of any quasi-m-array is close to the delta-function. In addition, the cyclic cross-correlation is small compared with the cyclic autocorrelation peak. Two-dimensional Gold code arrays generated by the same construction method are also studied. Correlation properties of these Gold code arrays are similar to those of the quasi-m-arrays. The Gold code arrays provide families of arrays in which any two arrays have the bound on their cyclic cross-correlation. These arrays are also shown to have the quasi-orthogonal property.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>