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.
An approach for studying quasi-cyclic codes based on matrix transformations via Fourier transforms and row and column permutations is presented. These transformations put a parity-check matrix in the form of an array of circulant matrices into a diagonal array of matrices of the same size over an extension field. The approach is used to characterize certain structural properties of low-density parity-check...
The Human genome project raises the curtain to solve the Biological problems in much more sophisticated manner. The Biological data is huge and increasing at faster rate. The computational approach (Insilco) is much needed to analyze these huge biological data. Pattern matching emerges as a powerful tool in locating nucleotide or amino acid sequence patterns in the genomic sequence databases, although...
This paper presents a new design of irregular LDPC codes that supports arbitrary block length. We propose the efficient construction method when nonprime size sub-matrices are used. The problem where GCD (L1,L2) ≠ 1 that left unsolved has been tackled. We also consider the case GCD (L1,L2) = 1 but L1 or L2 is a nonprime number. The results show that our designed codes have superior performance compared...
The two-dimensional (2D) forward/inverse discrete Fourier transform (DFT), discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), discrete Walsh-Hadamard transform (DWHT), play a fundamental role in many practical applications. Due to the separability property, all these transforms can be uniquely defined as a triple matrix product with one matrix transposition...
Two innovations in search methodology for Costas arrays are presented here: extensive exploitation of symmetries, and look-ahead row index exclusion tables. Together, they achieve a reduction of more than a factor of four in computational requirements over conventional search methods. We examined the benefits of these innovations on Costas arrays of higher orders, and particularly on a search over...
Efficient algorithms for mining frequent itemsets are crucial for mining association rules as well as for many other data mining tasks. In this paper, we integrate the merits of the matrix algorithm and Index-BitTableFI algorithm, and design an efficient algorithm for mining the frequent itemsets. In the new algorithm, it may be generated directly some frequent itemsets which do not generate in the...
In recent years, mining of sequential patterns has been studied extensively in various domains. Most of the existing algorithms find patterns in transactional databases by scanning the records whether they contain patterns or not. This paper proposes a novel algorithm to mine closed sequential patterns using an inverted matrix and prefix based sequence element matrix. Inverted matrix minimizes the...
The matrix LU decomposition is the key kernel of the Linpack benchmark. Based on the analysis of the theory Gaussian elimination, this paper proposes a parallel model of implementing the LU decomposition on FPGAs. The model has the pivoting operation and different architecture with former designs. Experimental results show the floating-point performance of our designs achieves 3371.40 MFLOPS at 110...
It puts forward a method of improved grey interrelated analysis in the evaluation of aerial target threat degree. Firstly it sets up comprehensive difference matrix in order to improve the sensitivity and accuracy of threat degree calculation. Secondly it fixes every index weight through threat membership degree. Thirdly it calculates and arranges the weighted average comprehensive value in an order...
It puts forward and uses the method to improve grey related analysis in the investment decision of the electric project, introduces the concept of the theory of the gray target, sets up comprehensive difference matrix in order to improve the sensitivity and accuracy of the scheme optimum seeking while calculating. Then it fixes every index weight through membership degree, and then calculates and...
The Math Works MATLAB is one of the most popular scientific programming language used by research engineers and scientists. Some of the best features of MATLAB are easy programming commands, ease in viewing and analyzing results, Simulink package, algorithm library and other matrix operations. Despite its best features, MATLAB suffers significantly with limited physical memory resources of a standard...
In this paper we study the R-way Parallel Factor Analysis (also referred to as R-way PARAFAC) problem. This branch of multi-way signal processing has received increased attention recently which is due to the versatility of the model as well as the identifiability results demonstrating its superiority to matrix-only (2-way) approaches. In R-way PARAFAC analysis, the goal is to decompose an R-dimensional...
In array processors, data I/O management is the key to realizing high-speed matrix operations that are often required in signal and image processing. In this paper, we propose an array processor utilizing an effective data I/O mechanism featuring external FIFOs. The FIFOs are used to buffer initial matrix data and partially processed results. Therefore, if all required data are stored in the FIFOs,...
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.