The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
To eliminate the overhead of zero padding in sparse matrix-vector multiplication (SpMxV), prior works have been focusing on partitioning a sparse matrix into row vectors sets (RVS's) or sub-matrices. Nevertheless, performance degraded still due to the sparsity pattern of a sparse matrix. In this paper, we propose a heuristics, called recursive merging, which uses greedy approach to recursively merge...
Sparse Matrix-Vector Multiplication (SpMxV) algorithms suffer heavy performance penalties due to irregular memory accesses. In this paper, we introduce a novel compressed element storage (CES) format, in which the additional data structures for indexing are abandoned, and each location associated with the non-zero element of the matrix is now indicated by the name of a variable multiplied by the corresponding...
Despite the total variation gradient descent (TV-GD) algorithm has revealed a good performance for photoacoustic imaging (PAI), fast or real-time imaging remains a challenge. In this paper, a dependence graph was introduced to help to exploit the data dependencies that exist in the TV-GD algorithm, and a general expression was then for the first time derived to unroll the inner loop that occupied...
Although the total variation based gradient descent (TV-GD) algorithm has revealed a good performance for photoacoustic imaging (PAI), fast or real-time imaging remains a challenge. In this paper, the data dependencies that exist in the TV-GD algorithm were exploited, and a general expression was then for the first time derived to unroll the inner loop that occupied the majority of the entire running...
To solve the problem of deterioration of system performance for the analog front-end (AFE) non-idealities, such as Carrier Frequency Offset (CFO), IQ mismatch and Sampling Frequency Offset (SFO) in OFDM system, this paper proposes a novel joint estimation and compensation algorithm, which estimates and compensates CFO and IQ imbalance in time domain, while compensates Residual Carrier Frequency Offset...
Considering the problem that the well-known bit-reversal algorithm is only fit for radix-2 Fast Fourier Transform (FFT) data reordering, a novel approach based on recursive indexing is proposed for radix-r FFT data reordering. The proposed scheme discards a look-up table required by bit-reversal algorithm. The corresponding hardware structure only costs a RAM whose depth is equal to the size of FFT,...
We propose a new notion called attribute-based sign-cryption with cipher text-policy and claim-predicate mechanism (CP2-ABSC), which is inspired by the recent developments in attribute-based encryption and attribute-based signature. In this notion, a signcrypting party, who possesses a set of attributes from the authority, can sign a message with a claim-predicate that is satisfied by his attributes,...
It has been pointed out that those multivariate public key encryption schemes which are based on Medium Field Equations(MFE) can not resist the second order linearization equation(SOLE) attacks. Elaborate analysis of the attacks helps us to find out the conditions to construct the linearization equations. Then, we redesign the central map such that the linearization equations can not be built in any...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.