scholarly journals The research on the properties of Fourier matrix and bent function

2020 ◽  
Vol 10 (4) ◽  
pp. 571-578
Author(s):  
Li Zhang ◽  
◽  
Xiaofeng Zhou ◽  
Min Chen ◽  
◽  
...  
Keyword(s):  
2013 ◽  
Vol 462-463 ◽  
pp. 701-705
Author(s):  
Dai Mei Chen ◽  
Xi Hui Fan ◽  
Yu Mei Wang ◽  
Yue Du

In wireless Ad Hoc networks, the combination of cooperative communication and network coding is an effective technique to improve the efficiency of retransmission. In most literature, nodes cooperated not fully, only as a relay, and XOR or random network coding had some shortage, such as, it was NP-Hard to achieve optimal coding strategy, can't ensure all lost packets can be encoded and the coding matrix must be full rank. This paper proposes a retransmission scheme called CRNCF. In this scheme, nodes cooperated sufficient, and used Fourier matrix's element as coding coefficient which can guarantee the solvability of receiving node, and packet's head only contain the row number of matrix. Simulation results show that CRNCF can improve the performance of the retransmission in aspects of throughput, security, collision probability, and cost of packet‘s head than other schemes.


2014 ◽  
Vol 55 (1) ◽  
pp. 012201 ◽  
Author(s):  
Teodor Banica
Keyword(s):  

2010 ◽  
Vol 27 (4) ◽  
pp. 603-620 ◽  
Author(s):  
Xiyong Zhang ◽  
Hua Guo ◽  
Zongsheng Gao
Keyword(s):  

2009 ◽  
Vol 07 (03) ◽  
pp. 615-626 ◽  
Author(s):  
S. SALIMI ◽  
M. M. SOLTANZADEH

In this paper, by using permutation matrices as a representation of symmetric group SN and Fourier matrix, we investigate quantum roulette with an arbitrary N-state. This strategy, which we introduce, is a general method that allows us to solve quantum game for an arbitrary N-state. We consider the interaction between the system and its environment and study the effect of the depolarizing channel on this strategy. Finally, as an example, we employ this strategy for quantum roulette with N = 3.


2016 ◽  
Vol 2016 ◽  
pp. 1-10
Author(s):  
Oleg Yaremko ◽  
Natalia Yaremko

We create a matrix integral transforms method; it allows us to describe analytically the consistent mathematical models. An explicit constructions for direct and inverse Fourier matrix transforms with discontinuous coefficients are established. We introduce special types of Fourier matrix transforms: matrix cosine transforms, matrix sine transforms, and matrix transforms with piecewise trigonometric kernels. The integral transforms of such kinds are used for problems solving of mathematical physics in homogeneous and piecewise homogeneous media. Analytical solution of iterated heat conduction equation is obtained. Stress produced in the elastic semi-infinite solid by pressure is obtained in the integral form.


Forests ◽  
2020 ◽  
Vol 11 (3) ◽  
pp. 257
Author(s):  
Renjie Xu ◽  
Ting Yun ◽  
Lin Cao ◽  
Yunfei Liu

The terrestrial laser scanner (TLS) has been widely used in forest inventories. However, with increasing precision of TLS, storing and transmitting tree point clouds become more challenging. In this paper, a novel compressed sensing (CS) scheme for broad-leaved tree point clouds is proposed by analyzing and comparing different sparse bases, observation matrices, and reconstruction algorithms. Our scheme starts by eliminating outliers and simplifying point clouds with statistical filtering and voxel filtering. The scheme then applies Haar sparse basis to thin the coordinate data based on the characteristics of the broad-leaved tree point clouds. An observation procedure down-samples the point clouds with the partial Fourier matrix. The regularized orthogonal matching pursuit algorithm (ROMP) finally reconstructs the original point clouds. The experimental results illustrate that the proposed scheme can preserve morphological attributes of the broad-leaved tree within a range of relative error: 0.0010%–3.3937%, and robustly extend to plot-level within a range of mean square error (MSE): 0.0063–0.2245.


Sign in / Sign up

Export Citation Format

Share Document