The Hough Transform is the choice technique for identifying straight lines through digital images, with applications to high energy physics and computer vision. Classical methods for implementing the Hough transform of a N N binary image require to compute N3 additions over n = log2(N) bits integers, hence nN3 bit operations per transform. We introduce a new algorithm for computing the fast Hou...

Fast Fourier Transform (FFT) is widely used in signal processing applications. For a 2n-point FFT, split-radix FFT costs less mathematical operations than many state-of-the-art algorithms. Most split-radix FFT algorithms are implemented in a recursive way which brings much extra overhead of systems. In this paper, we propose an algorithm of split-radix FFT that can eliminate the system overhead...

Large-scale antenna (LSA) has gained a lot of attention recently since it can significantly improve the performance of wireless systems. Similar to multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) or MIMO-OFDM, LSA can be also combined with OFDM to deal with frequency selectivity in wireless channels. However, such combination suffers from substantially in...

We present a novel approach to synthesizing recursive functional programs from input-output examples. Synthesizing function is challenging because subexpressions should be constructed while the target has not been fully defined yet. address this challenge by using new technique we call block-based pruning. A block refers recursion- and conditional-free expression (i.e., straight-line code) that...

Many recent invertible neural architectures are based on coupling block designs where variables divided in two subsets which serve as inputs of an easily (usually affine) triangular transformation. While such a transformation is invertible, its Jacobian very sparse and thus may lack expressiveness. This work presents simple remedy by noting that subdivision (affine) can be repeated recursively ...

The Discrete Fourier Transform (DFT) is a mathematical procedure that stands at the center of processing inside digital signal processor. It has been widely known and argued in relevant literature Fast (FFT) useless detecting specific frequencies monitored length N because most computed results are ignored. In this paper, we present an efficient FFT-based method to detect signal, which will the...

In this paper it has been attempted to investigate the capability of the consumption-based capital asset pricing model (CCAPM), using the general method of moment (GMM), with regard to the Epstien-zin recursive preferences model for Iran's capital market. Generally speaking, recursive utility permits disentangling of the two psychologically separate concepts of risk aversion and elasticity of i...