Topic
Hadamard transform
About: Hadamard transform is a research topic. Over the lifetime, 7262 publications have been published within this topic receiving 94328 citations.
Papers published on a yearly basis
Papers
More filters
29 citations
TL;DR: In this paper, a non-perturbative construction of the fermionic projector in Minkowski space coupled to a time-dependent external potential is given, which is smooth and decays faster than quadratically for large times.
Abstract: We give a non-perturbative construction of the fermionic projector in Minkowski space coupled to a time-dependent external potential which is smooth and decays faster than quadratically for large times. The weak and strong mass oscillation properties are proven. We show that the integral kernel of the fermionic projector is of the Hadamard form, provided that the time integral of the spatial sup-norm of the potential satisfies a suitable bound. This gives rise to an algebraic quantum field theory of Dirac fields in an external potential with a distinguished pure quasi-free Hadamard state.
29 citations
TL;DR: FWS-VBS employs a new error measurement defined in Walsh-Hadamard domain, which is called partial sum-of-absolute difference, to identify likely mismatches and performs equally well to the exhaustive full search algorithm and requires only about 10% of the computation time.
Abstract: In this paper, we propose a fast full-pel variable block size motion estimation algorithm called fast Walsh search in variable block size (FWS-VBS). FWS-VBS employs a new error measurement defined in Walsh-Hadamard domain, which is called partial sum-of-absolute difference, to identify likely mismatches. Mismatches are rejected by thresholding method and the thresholds are determined adaptively to cater for different activity levels in each block. Early termination techniques are employed to further reduce the number of candidates and modes to be searched of each block. Experimental results show that FWS-VBS performs equally well to the exhaustive full search algorithm and requires only about 10% of the computation time.
29 citations
29 citations
TL;DR: A new simple optimal repair strategy for (k + m, k) Hadamard MSR codes is proposed, which can considerably reduce the computation compared with the original one during the node repair.
Abstract: The newly presented $(k+m,k)$ Hadamard minimum storage regenerating (MSR) codes are a class of high rate storage codes with optimal repair property for single node failure. In this paper, we propose a new simple optimal repair strategy for $(k+m,k)$ Hadamard MSR codes, which can considerably reduce the computation compared with the original one during the node repair.
29 citations