Integrated sensing and communication(ISAC)is one of the main usage scenarios for 6G wireless networks.To most efficiently utilize the limited wireless resources,integrated super-resolution sensing and communication(IS...Integrated sensing and communication(ISAC)is one of the main usage scenarios for 6G wireless networks.To most efficiently utilize the limited wireless resources,integrated super-resolution sensing and communication(ISSAC)has been recently proposed to significantly improve sensing performance with super-resolution algorithms for ISAC systems,such as the Multiple Signal Classification(MUSIC)algorithm.However,traditional super-resolution sensing algorithms suffer from prohibitive computational complexity of orthogonal-frequency division multiplexing(OFDM)systems due to the large dimensions of the signals in the subcarrier and symbol domains.To address such issues,we propose a novel two-stage approach to reduce the computational complexity for super-resolution range estimation significantly.The key idea of the proposed scheme is to first uniformly decimate signals in the subcarrier domain so that the computational complexity is significantly reduced without missing any target in the range domain.However,the decimation operation may result in range ambiguity due to pseudo peaks,which is addressed by the second stage where the total collocated subcarrier data are used to verify the detected peaks.Compared with traditional MUSIC algorithms,the proposed scheme reduces computational complexity by two orders of magnitude,while maintaining the range resolution and unambiguity.Simulation results verify the effectiveness of the proposed scheme.展开更多
The infinite time-evolving block decimation algorithm(i TEBD)provides an efficient way to determine the ground state and dynamics of the quantum lattice systems in the thermodynamic limit.In this paper we suggest an o...The infinite time-evolving block decimation algorithm(i TEBD)provides an efficient way to determine the ground state and dynamics of the quantum lattice systems in the thermodynamic limit.In this paper we suggest an optimized way to take the i TEBD calculation,which takes advantage of additional reduced decompositions to speed up the calculation.The numerical calculations show that for a comparable computation time our method provides more accurate results than the traditional i TEBD,especially for lattice systems with large on-site degrees of freedom.展开更多
This paper deals with the technology of using comb filters for FIR Decimation in Digital Signal Processing. The process of decreasing the sampling frequency of a sampled signal is called decimation. In the usage of de...This paper deals with the technology of using comb filters for FIR Decimation in Digital Signal Processing. The process of decreasing the sampling frequency of a sampled signal is called decimation. In the usage of decimating filters, only a portion of the out-of-pass band frequencies turns into the pass band, in systems wherein different parts operate at different sample rates. A filter design, tuned to the aliasing frequencies all of which can otherwise steal into the pass band, not only provides multiple stop bands but also exhibits computational efficiency and performance superiority over the single stop band design. These filters are referred to as multiband designs in the family of FIR filters. The other two special versions of FIR filter designs are Halfband and Comb filter designs, both of which are particularly useful for reducing the computational requirements in multirate designs. The proposed method of using Comb FIR decimation procedure is not only efficient but also opens up a new vista of simplicity and elegancy to compute Multiplications per Second (MPS) and Additions per Second (APS) for the desired filter over and above the half band designs.展开更多
The sampling rate conversion is always used in order to decrease computational amount and storage load in a system. The fractional Fourier transform （FRFT） is a powerful tool for the analysis of nonstationary signal...The sampling rate conversion is always used in order to decrease computational amount and storage load in a system. The fractional Fourier transform （FRFT） is a powerful tool for the analysis of nonstationary signals, especially, chirp-like signal. Thus, it has become an active area in the signal processing community, with many applications of radar, communication, electronic warfare, and information security. Therefore, it is necessary for us to generalize the theorem for Fourier domain analysis of decimation and interpolation. Firstly, this paper defines the digital frequency in the fractional Fourier domain （FRFD） through the sampling theorems with FRFT. Secondly, FRFD analysis of decimation and interpolation is proposed in this paper with digital frequency in FRFD followed by the studies of interpolation filter and decimation filter in FRFD. Using these results, FRFD analysis of the sampling rate conversion by a rational factor is illustrated. The noble identities of decimation and interpolation in FRFD are then deduced using previous results and the fractional convolution theorem. The proposed theorems in this study are the bases for the generalizations of the multirate signal processing in FRFD, which can advance the filter banks theorems in FRFD. Finally, the theorems introduced in this paper are validated by simulations.展开更多
In digital furniture design, skillful designers usually use professional software to create new furniture designs with various textures and then take advantage of rendering tools to produce eye-catching design results...In digital furniture design, skillful designers usually use professional software to create new furniture designs with various textures and then take advantage of rendering tools to produce eye-catching design results. Generally, a fine-grained furniture model holds many geometric details, inducing significant time cost to model rendering and large data size for storage that are not desired in application scenarios where efficiency is greatly emphasized. To accelerate the rendering process while keeping good rendering results as many as possible, we develop a novel decimation technique which not only reduces the number of faces on furniture models, but also retains their geometric and texture features. Two metrics are utilized in our approach to measure the distortion of texture features. Considering these two metrics as guidance for decimation, high texture distortion can be avoided in simplifying the geometric models. Therefore, we are able to build multi-level representations with different detail levels based on the initial design. Our experimental results show that the developed technique can achieve excellent visual effects on the decimated furniture model.展开更多
We introduce a graph-directed pair of planar self-similar sets that possess fully symmetric Laplacians. For these two fractals, due to Shima’s celebrated criterion, we point out that one admits the spectral decimatio...We introduce a graph-directed pair of planar self-similar sets that possess fully symmetric Laplacians. For these two fractals, due to Shima’s celebrated criterion, we point out that one admits the spectral decimation by the canonic graph approximation and the other does not. For the second fractal, we adjust to choosing a new graph approximation guided by the directed graph, which still admits spectral decimation. Then we make a full description of the Dirichlet and Neumann eigenvalues and eigenfunctions of both of these two fractals.展开更多
Accurate frequency estimation in a wideband digital receiver using the FFT algorithm encounters challenges, such as spectral leakage resulting from the FFT’s assumption of signal periodicity. High-resolution FFTs pos...Accurate frequency estimation in a wideband digital receiver using the FFT algorithm encounters challenges, such as spectral leakage resulting from the FFT’s assumption of signal periodicity. High-resolution FFTs pose computational demands, and estimating non-integer multiples of frequency resolution proves exceptionally challenging. This paper introduces two novel methods for enhanced frequency precision: polynomial interpolation and array indexing, comparing their results with super-resolution and scalloping loss. Simulation results demonstrate the effectiveness of the proposed methods in contemporary radar systems, with array indexing providing the best frequency estimation despite utilizing maximum hardware resources. The paper demonstrates a trade-off between accurate frequency estimation and hardware resources when comparing polynomial interpolation and array indexing.展开更多
This paper provides a method of the process of computation called the cumulative method, it is based upon repeated cumulative process. The cumulative method is being adapted to the purposes of computation, particularl...This paper provides a method of the process of computation called the cumulative method, it is based upon repeated cumulative process. The cumulative method is being adapted to the purposes of computation, particularly multiplication and division. The operations of multiplication and division are represented by algebraic formulas. An advantage of the method is that the cumulative process can be performed on decimal numbers. The present paper aims to establish a basic and useful formula valid for the two fundamental arithmetic operations of multiplication and division. The new cumulative method proved to be more flexible and made it possible to extend the multiplication and division based on repeated addition/subtraction to decimal numbers.展开更多
A 16 bit stereo audio novel stability fifth-order ∑△ A/D converter that consists of switched capacitor ∑△ modulators, a decimation filter, and a bandgap circuit is proposed. A method for the stabilization of a hig...A 16 bit stereo audio novel stability fifth-order ∑△ A/D converter that consists of switched capacitor ∑△ modulators, a decimation filter, and a bandgap circuit is proposed. A method for the stabilization of a high order single stage ∑△ modulator is also proposed. A new multistage comb filter is used for the front end decimation filter. The ∑△ A/D converter achieves a peak SNR of 96dB and a dynamic range of 96dB. The ADC was implemented in 0. 5μm 5V CMOS technology. The chip die area occupies only 4. 1mm × 2.4mm and dissipates 90mW.展开更多
In this work, power efficient butterfly unit based FFT architecture is presented. The butterfly unit is designed using floating-point fused arithmetic units. The fused arithmetic units include two-term dot product uni...In this work, power efficient butterfly unit based FFT architecture is presented. The butterfly unit is designed using floating-point fused arithmetic units. The fused arithmetic units include two-term dot product unit and add-subtract unit. In these arithmetic units, operations are performed over complex data values. A modified fused floating-point two-term dot product and an enhanced model for the Radix-4 FFT butterfly unit are proposed. The modified fused two-term dot product is designed using Radix-16 booth multiplier. Radix-16 booth multiplier will reduce the switching activities compared to Radix-8 booth multiplier in existing system and also will reduce the area required. The proposed architecture is implemented efficiently for Radix-4 decimation in time(DIT) FFT butterfly with the two floating-point fused arithmetic units. The proposed enhanced architecture is synthesized, implemented, placed and routed on a FPGA device using Xilinx ISE tool. It is observed that the Radix-4 DIT fused floating-point FFT butterfly requires 50.17% less space and 12.16% reduced power compared to the existing methods and the proposed enhanced model requires 49.82% less space on the FPGA device compared to the proposed design. Also, reduced power consumption is addressed by utilizing the reusability technique, which results in 11.42% of power reduction of the enhanced model compared to the proposed design.展开更多
Digital down converter （DDC） is the main part of the next generation high frequency （HF） radar. In order to realize the single chip integrations of digital receiver hardware in the next generation HF Radar, a new ...Digital down converter （DDC） is the main part of the next generation high frequency （HF） radar. In order to realize the single chip integrations of digital receiver hardware in the next generation HF Radar, a new design for DDC by using FPGA is presented. Some important and practical applications are given in this paper, and the result can prove the validity. Because we can adjust the parameters freely according to our need, the DDC system can be adapted to the next generation HF radar system.展开更多
The minimal dominating set for a digraph(directed graph) is a prototypical hard combinatorial optimization problem. In a previous paper, we studied this problem using the cavity method. Although we found a solution fo...The minimal dominating set for a digraph(directed graph) is a prototypical hard combinatorial optimization problem. In a previous paper, we studied this problem using the cavity method. Although we found a solution for a given graph that gives very good estimate of the minimal dominating size, we further developed the one step replica symmetry breaking theory to determine the ground state energy of the undirected minimal dominating set problem. The solution space for the undirected minimal dominating set problem exhibits both condensation transition and cluster transition on regular random graphs. We also developed the zero temperature survey propagation algorithm on undirected Erds-Rnyi graphs to find the ground state energy. In this paper we continue to develope the one step replica symmetry breaking theory to find the ground state energy for the directed minimal dominating set problem. We find the following.(i) The warning propagation equation can not converge when the connectivity is greater than the core percolation threshold value of 3.704. Positive edges have two types warning, but the negative edges have one.(ii) We determine the ground state energy and the transition point of the Erd?os-R′enyi random graph.(iii) The survey propagation decimation algorithm has good results comparable with the belief propagation decimation algorithm.展开更多
Edge detection is a fundamental issue in image analysis. This paper proposes multirate algorithms for efficient implementation of edge detector, and a design example is illustrated.The multirate (decimation and/or int...Edge detection is a fundamental issue in image analysis. This paper proposes multirate algorithms for efficient implementation of edge detector, and a design example is illustrated.The multirate (decimation and/or interpolation) signal processing algorithms can achieve considerable savings in computation and storage. The proposed algorithms result in mapping relations of their z-transfer functions between non-multirate and multirate mathematical expressions in terms of time-varying coefficient instead of traditional polyphase decomposition counterparts.The mapping properties can be readily utilized to efficiently analyze and synthesize multirate edge detection filters. The Very high-speed Hardware Description Language (VHDL) simulation results verify efficiency of the algorithms for real-time Field Programmable Gate-Array (FPGA)implementation.展开更多
Efficient reconfigurable VLSI architecture for 1-D 5/3 and 9/7 wavelet transforms adopted in JPEG2000 proposal, based on lifting scheme is proposed. The embedded decimation technique based on fold and time multiplexin...Efficient reconfigurable VLSI architecture for 1-D 5/3 and 9/7 wavelet transforms adopted in JPEG2000 proposal, based on lifting scheme is proposed. The embedded decimation technique based on fold and time multiplexing, as well as embedded boundary data extension technique, is adopted to optimize the design of the architecture. These reduce significantly the required numbers of the multipliers, adders and registers, as well as the amount of accessing external memory, and lead to decrease efficiently the hardware cost and power consumption of the design. The architecture is designed to generate an output per clock cycle, and the detailed component and the approximation of the input signal are available alternately. Experimental simulation and comparison results are presented, which demonstrate that the proposed architecture has lower hardware complexity, thus it is adapted for embedded applications. The presented architecture is simple, regular and scalable, and well suited for VLSI implementation.展开更多
We study the critical scaling and dynamical signatures of fractionalized excitations at two different deconfined quantum critical points(DQCPs)in an S=1/2 spin chain using the time evolution of infinite matrix product...We study the critical scaling and dynamical signatures of fractionalized excitations at two different deconfined quantum critical points(DQCPs)in an S=1/2 spin chain using the time evolution of infinite matrix product states.The scaling of the correlation functions and the dispersion of the conserved current correlations explicitly show the emergence of enhanced continuous symmetries at these DQCPs.The dynamical structure factors in several different channels reveal the development of deconfined fractionalized excitations at the DQCPs.Furthermore,we find an effective spin-charge separation at the DQCP between the ferromagnetic(FM)and valence bond solid(VBS)phases,and identify two continua associated with different types of fractionalized excitations at the DQCP between the X-direction and Z-direction FM phases.Our findings not only provide direct evidence for the DQCP in one dimension but also shed light on exploring the DQCP in higher dimensions.展开更多
The directed L-distance minimal dominating set(MDS) problem has wide practical applications in the fields of computer science and communication networks. Here, we study this problem from the perspective of purely theo...The directed L-distance minimal dominating set(MDS) problem has wide practical applications in the fields of computer science and communication networks. Here, we study this problem from the perspective of purely theoretical interest. We only give results for an Erdós Rényi(ER)random graph and regular random(RR) graph, but this work can be extended to any type of network. We develop spin glass theory to study the directed 2-distance MDS problem. First, we find that the belief propagation(BP) algorithm does not converge when the inverse temperatureβ exceeds a threshold on either an ER random network or RR network. Second, the entropy density of replica symmetric theory has a transition point at a finite β on a regular random graph when the arc density exceeds 2 and on an ER random graph when the arc density exceeds3.3;there is no entropy transition point(or β = ■) in other circumstances. Third, the results of the replica symmetry(RS) theory are in agreement with those of BP algorithm while the results of the BP decimation algorithm are better than those of the greedy heuristic algorithm.展开更多
The cancellable biometric transformations are designed to be computationally difficult to obtain the original biometric data.This paper presents a cancellable multi-biometric identification scheme that includes four s...The cancellable biometric transformations are designed to be computationally difficult to obtain the original biometric data.This paper presents a cancellable multi-biometric identification scheme that includes four stages:biometric data collection and processing,Arnold’s Cat Map encryption,decimation process to reduce the size,and finalmerging of the four biometrics in a single generated template.First,a 2D matrix of size 128×128 is created based on Arnold’s Cat Map(ACM).The purpose of this rearrangement is to break the correlation between pixels to hide the biometric patterns and merge these patterns together for more security.The decimation is performed to keep the dimensions of the overall cancellable template similar to those of a single template to avoid data redundancy.Moreover,some sort of aliasing occurs due to decimation,contributing to the intended distortion of biometric templates.The hybrid structure that comprises encryption,decimation,andmerging generates encrypted and distorted cancellable templates.The simulation results obtained for performance evaluation show that the system is safe,reliable,and feasible as it achieves high security in the presence of noise.展开更多
This paper proposes new hierarchical structures for generating pseudorandom sequences and arrays. The principle of the structures is based on a new concept-multi-interleaving. It is the generalization of normal sequen...This paper proposes new hierarchical structures for generating pseudorandom sequences and arrays. The principle of the structures is based on a new concept-multi-interleaving. It is the generalization of normal sequence decimation(sampling). The kernal of the structures is a lower speed linear feedback shift register together with several high speed time-division multiplexers arranged hierarchically. These new structures have much higher speed compared with that of other schemes proposed before.展开更多
In this paper, using spectral decimation, we prove that the "hot spots" conjecture holds on a class of homogeneous hierarchical gaskets introduced by Hambly,i.e., every eigenfunction of the second-smallest e...In this paper, using spectral decimation, we prove that the "hot spots" conjecture holds on a class of homogeneous hierarchical gaskets introduced by Hambly,i.e., every eigenfunction of the second-smallest eigenvalue of the Neumann Laplacian(introduced by Kigami) attains its maximum and minimum on the boundary.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.62071114.
文摘Integrated sensing and communication(ISAC)is one of the main usage scenarios for 6G wireless networks.To most efficiently utilize the limited wireless resources,integrated super-resolution sensing and communication(ISSAC)has been recently proposed to significantly improve sensing performance with super-resolution algorithms for ISAC systems,such as the Multiple Signal Classification(MUSIC)algorithm.However,traditional super-resolution sensing algorithms suffer from prohibitive computational complexity of orthogonal-frequency division multiplexing(OFDM)systems due to the large dimensions of the signals in the subcarrier and symbol domains.To address such issues,we propose a novel two-stage approach to reduce the computational complexity for super-resolution range estimation significantly.The key idea of the proposed scheme is to first uniformly decimate signals in the subcarrier domain so that the computational complexity is significantly reduced without missing any target in the range domain.However,the decimation operation may result in range ambiguity due to pseudo peaks,which is addressed by the second stage where the total collocated subcarrier data are used to verify the detected peaks.Compared with traditional MUSIC algorithms,the proposed scheme reduces computational complexity by two orders of magnitude,while maintaining the range resolution and unambiguity.Simulation results verify the effectiveness of the proposed scheme.
基金Project supported by Fundamental Research Funds for the Central Universities(Grant No.FRF-TP-19-013A3)。
文摘The infinite time-evolving block decimation algorithm(i TEBD)provides an efficient way to determine the ground state and dynamics of the quantum lattice systems in the thermodynamic limit.In this paper we suggest an optimized way to take the i TEBD calculation,which takes advantage of additional reduced decompositions to speed up the calculation.The numerical calculations show that for a comparable computation time our method provides more accurate results than the traditional i TEBD,especially for lattice systems with large on-site degrees of freedom.
文摘This paper deals with the technology of using comb filters for FIR Decimation in Digital Signal Processing. The process of decreasing the sampling frequency of a sampled signal is called decimation. In the usage of decimating filters, only a portion of the out-of-pass band frequencies turns into the pass band, in systems wherein different parts operate at different sample rates. A filter design, tuned to the aliasing frequencies all of which can otherwise steal into the pass band, not only provides multiple stop bands but also exhibits computational efficiency and performance superiority over the single stop band design. These filters are referred to as multiband designs in the family of FIR filters. The other two special versions of FIR filter designs are Halfband and Comb filter designs, both of which are particularly useful for reducing the computational requirements in multirate designs. The proposed method of using Comb FIR decimation procedure is not only efficient but also opens up a new vista of simplicity and elegancy to compute Multiplications per Second (MPS) and Additions per Second (APS) for the desired filter over and above the half band designs.
基金the National Natural Science Foundation of China (Grant Nos.60232010 and 60572094)the National Natural Science Foundation of China for Distinguished Young Scholars (Grant No. 60625104)
文摘The sampling rate conversion is always used in order to decrease computational amount and storage load in a system. The fractional Fourier transform （FRFT） is a powerful tool for the analysis of nonstationary signals, especially, chirp-like signal. Thus, it has become an active area in the signal processing community, with many applications of radar, communication, electronic warfare, and information security. Therefore, it is necessary for us to generalize the theorem for Fourier domain analysis of decimation and interpolation. Firstly, this paper defines the digital frequency in the fractional Fourier domain （FRFD） through the sampling theorems with FRFT. Secondly, FRFD analysis of decimation and interpolation is proposed in this paper with digital frequency in FRFD followed by the studies of interpolation filter and decimation filter in FRFD. Using these results, FRFD analysis of the sampling rate conversion by a rational factor is illustrated. The noble identities of decimation and interpolation in FRFD are then deduced using previous results and the fractional convolution theorem. The proposed theorems in this study are the bases for the generalizations of the multirate signal processing in FRFD, which can advance the filter banks theorems in FRFD. Finally, the theorems introduced in this paper are validated by simulations.
基金This work was supported by the Natural Science Foundation of Guangdong Province of China under Grant No.2017A030313347。
文摘In digital furniture design, skillful designers usually use professional software to create new furniture designs with various textures and then take advantage of rendering tools to produce eye-catching design results. Generally, a fine-grained furniture model holds many geometric details, inducing significant time cost to model rendering and large data size for storage that are not desired in application scenarios where efficiency is greatly emphasized. To accelerate the rendering process while keeping good rendering results as many as possible, we develop a novel decimation technique which not only reduces the number of faces on furniture models, but also retains their geometric and texture features. Two metrics are utilized in our approach to measure the distortion of texture features. Considering these two metrics as guidance for decimation, high texture distortion can be avoided in simplifying the geometric models. Therefore, we are able to build multi-level representations with different detail levels based on the initial design. Our experimental results show that the developed technique can achieve excellent visual effects on the decimated furniture model.
基金supported by National Natural Science Foundation of China(Grant No.12071213)the Natural Science Foundation of Jiangsu Province in China(Grant No.BK20211142)。
文摘We introduce a graph-directed pair of planar self-similar sets that possess fully symmetric Laplacians. For these two fractals, due to Shima’s celebrated criterion, we point out that one admits the spectral decimation by the canonic graph approximation and the other does not. For the second fractal, we adjust to choosing a new graph approximation guided by the directed graph, which still admits spectral decimation. Then we make a full description of the Dirichlet and Neumann eigenvalues and eigenfunctions of both of these two fractals.
文摘Accurate frequency estimation in a wideband digital receiver using the FFT algorithm encounters challenges, such as spectral leakage resulting from the FFT’s assumption of signal periodicity. High-resolution FFTs pose computational demands, and estimating non-integer multiples of frequency resolution proves exceptionally challenging. This paper introduces two novel methods for enhanced frequency precision: polynomial interpolation and array indexing, comparing their results with super-resolution and scalloping loss. Simulation results demonstrate the effectiveness of the proposed methods in contemporary radar systems, with array indexing providing the best frequency estimation despite utilizing maximum hardware resources. The paper demonstrates a trade-off between accurate frequency estimation and hardware resources when comparing polynomial interpolation and array indexing.
文摘This paper provides a method of the process of computation called the cumulative method, it is based upon repeated cumulative process. The cumulative method is being adapted to the purposes of computation, particularly multiplication and division. The operations of multiplication and division are represented by algebraic formulas. An advantage of the method is that the cumulative process can be performed on decimal numbers. The present paper aims to establish a basic and useful formula valid for the two fundamental arithmetic operations of multiplication and division. The new cumulative method proved to be more flexible and made it possible to extend the multiplication and division based on repeated addition/subtraction to decimal numbers.
文摘A 16 bit stereo audio novel stability fifth-order ∑△ A/D converter that consists of switched capacitor ∑△ modulators, a decimation filter, and a bandgap circuit is proposed. A method for the stabilization of a high order single stage ∑△ modulator is also proposed. A new multistage comb filter is used for the front end decimation filter. The ∑△ A/D converter achieves a peak SNR of 96dB and a dynamic range of 96dB. The ADC was implemented in 0. 5μm 5V CMOS technology. The chip die area occupies only 4. 1mm × 2.4mm and dissipates 90mW.
文摘In this work, power efficient butterfly unit based FFT architecture is presented. The butterfly unit is designed using floating-point fused arithmetic units. The fused arithmetic units include two-term dot product unit and add-subtract unit. In these arithmetic units, operations are performed over complex data values. A modified fused floating-point two-term dot product and an enhanced model for the Radix-4 FFT butterfly unit are proposed. The modified fused two-term dot product is designed using Radix-16 booth multiplier. Radix-16 booth multiplier will reduce the switching activities compared to Radix-8 booth multiplier in existing system and also will reduce the area required. The proposed architecture is implemented efficiently for Radix-4 decimation in time(DIT) FFT butterfly with the two floating-point fused arithmetic units. The proposed enhanced architecture is synthesized, implemented, placed and routed on a FPGA device using Xilinx ISE tool. It is observed that the Radix-4 DIT fused floating-point FFT butterfly requires 50.17% less space and 12.16% reduced power compared to the existing methods and the proposed enhanced model requires 49.82% less space on the FPGA device compared to the proposed design. Also, reduced power consumption is addressed by utilizing the reusability technique, which results in 11.42% of power reduction of the enhanced model compared to the proposed design.
文摘Digital down converter （DDC） is the main part of the next generation high frequency （HF） radar. In order to realize the single chip integrations of digital receiver hardware in the next generation HF Radar, a new design for DDC by using FPGA is presented. Some important and practical applications are given in this paper, and the result can prove the validity. Because we can adjust the parameters freely according to our need, the DDC system can be adapted to the next generation HF radar system.
基金Supported by the Doctoral Startup Fund of Xinjiang University of China under Grant No.208-61357the National Natural Science Foundation of China under Grant No.11765021
文摘The minimal dominating set for a digraph(directed graph) is a prototypical hard combinatorial optimization problem. In a previous paper, we studied this problem using the cavity method. Although we found a solution for a given graph that gives very good estimate of the minimal dominating size, we further developed the one step replica symmetry breaking theory to determine the ground state energy of the undirected minimal dominating set problem. The solution space for the undirected minimal dominating set problem exhibits both condensation transition and cluster transition on regular random graphs. We also developed the zero temperature survey propagation algorithm on undirected Erds-Rnyi graphs to find the ground state energy. In this paper we continue to develope the one step replica symmetry breaking theory to find the ground state energy for the directed minimal dominating set problem. We find the following.(i) The warning propagation equation can not converge when the connectivity is greater than the core percolation threshold value of 3.704. Positive edges have two types warning, but the negative edges have one.(ii) We determine the ground state energy and the transition point of the Erd?os-R′enyi random graph.(iii) The survey propagation decimation algorithm has good results comparable with the belief propagation decimation algorithm.
文摘Edge detection is a fundamental issue in image analysis. This paper proposes multirate algorithms for efficient implementation of edge detector, and a design example is illustrated.The multirate (decimation and/or interpolation) signal processing algorithms can achieve considerable savings in computation and storage. The proposed algorithms result in mapping relations of their z-transfer functions between non-multirate and multirate mathematical expressions in terms of time-varying coefficient instead of traditional polyphase decomposition counterparts.The mapping properties can be readily utilized to efficiently analyze and synthesize multirate edge detection filters. The Very high-speed Hardware Description Language (VHDL) simulation results verify efficiency of the algorithms for real-time Field Programmable Gate-Array (FPGA)implementation.
文摘Efficient reconfigurable VLSI architecture for 1-D 5/3 and 9/7 wavelet transforms adopted in JPEG2000 proposal, based on lifting scheme is proposed. The embedded decimation technique based on fold and time multiplexing, as well as embedded boundary data extension technique, is adopted to optimize the design of the architecture. These reduce significantly the required numbers of the multipliers, adders and registers, as well as the amount of accessing external memory, and lead to decrease efficiently the hardware cost and power consumption of the design. The architecture is designed to generate an output per clock cycle, and the detailed component and the approximation of the input signal are available alternately. Experimental simulation and comparison results are presented, which demonstrate that the proposed architecture has lower hardware complexity, thus it is adapted for embedded applications. The presented architecture is simple, regular and scalable, and well suited for VLSI implementation.
基金Project supported by the National Science Foundation of China(Grant No.12174441)the Fundamental Research Funds for the Central Universities,Chinathe Research Funds of Remnin University of China(Grant No.18XNLG24)。
文摘We study the critical scaling and dynamical signatures of fractionalized excitations at two different deconfined quantum critical points(DQCPs)in an S=1/2 spin chain using the time evolution of infinite matrix product states.The scaling of the correlation functions and the dispersion of the conserved current correlations explicitly show the emergence of enhanced continuous symmetries at these DQCPs.The dynamical structure factors in several different channels reveal the development of deconfined fractionalized excitations at the DQCPs.Furthermore,we find an effective spin-charge separation at the DQCP between the ferromagnetic(FM)and valence bond solid(VBS)phases,and identify two continua associated with different types of fractionalized excitations at the DQCP between the X-direction and Z-direction FM phases.Our findings not only provide direct evidence for the DQCP in one dimension but also shed light on exploring the DQCP in higher dimensions.
基金supported by the doctoral startup fund of Xinjiang University of China (grant number 208-61357)the National Natural Science Foundation of China (grant number 11 465 019,11 664 040)。
文摘The directed L-distance minimal dominating set(MDS) problem has wide practical applications in the fields of computer science and communication networks. Here, we study this problem from the perspective of purely theoretical interest. We only give results for an Erdós Rényi(ER)random graph and regular random(RR) graph, but this work can be extended to any type of network. We develop spin glass theory to study the directed 2-distance MDS problem. First, we find that the belief propagation(BP) algorithm does not converge when the inverse temperatureβ exceeds a threshold on either an ER random network or RR network. Second, the entropy density of replica symmetric theory has a transition point at a finite β on a regular random graph when the arc density exceeds 2 and on an ER random graph when the arc density exceeds3.3;there is no entropy transition point(or β = ■) in other circumstances. Third, the results of the replica symmetry(RS) theory are in agreement with those of BP algorithm while the results of the BP decimation algorithm are better than those of the greedy heuristic algorithm.
基金This research was supported by Taif University Researchers Supporting Project Number(TURSP-2020/214),Taif University,Taif,Saudi Arabia(www.tu.edu.sa).
文摘The cancellable biometric transformations are designed to be computationally difficult to obtain the original biometric data.This paper presents a cancellable multi-biometric identification scheme that includes four stages:biometric data collection and processing,Arnold’s Cat Map encryption,decimation process to reduce the size,and finalmerging of the four biometrics in a single generated template.First,a 2D matrix of size 128×128 is created based on Arnold’s Cat Map(ACM).The purpose of this rearrangement is to break the correlation between pixels to hide the biometric patterns and merge these patterns together for more security.The decimation is performed to keep the dimensions of the overall cancellable template similar to those of a single template to avoid data redundancy.Moreover,some sort of aliasing occurs due to decimation,contributing to the intended distortion of biometric templates.The hybrid structure that comprises encryption,decimation,andmerging generates encrypted and distorted cancellable templates.The simulation results obtained for performance evaluation show that the system is safe,reliable,and feasible as it achieves high security in the presence of noise.
文摘This paper proposes new hierarchical structures for generating pseudorandom sequences and arrays. The principle of the structures is based on a new concept-multi-interleaving. It is the generalization of normal sequence decimation(sampling). The kernal of the structures is a lower speed linear feedback shift register together with several high speed time-division multiplexers arranged hierarchically. These new structures have much higher speed compared with that of other schemes proposed before.
基金supported in part by NSFC grants Nos.11271327, 11771391
文摘In this paper, using spectral decimation, we prove that the "hot spots" conjecture holds on a class of homogeneous hierarchical gaskets introduced by Hambly,i.e., every eigenfunction of the second-smallest eigenvalue of the Neumann Laplacian(introduced by Kigami) attains its maximum and minimum on the boundary.
