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.
Due to their increasing complexity, the implementation of automation systems faces more challenges. Cognitive architectures have been designed to deal exactly with that. The purpose of a cognitive architecture is to find an action to every possible sensor data to move the system closer to a defined goal. The method is to utilize stored knowledge to reason about the best solution. The challenge for...
The performance of a comparator is significantly affected by the time taken to determine the unequal bit location so as to decide greater than, less than and equal to condition. Consequently, the delay will increase with the number of bits of a comparator. The reduction in delay so as to improve performance can be achieved with the introduction of multilevel look-ahead circuit. In this work, a unique...
Limited endurance problem and low cell reliability are main challenges of phase change memory (PCM) as an alternative to DRAM. To further prolong the lifetime of a PCM device, there exist a number of techniques that can be grouped in two categories: 1) reducing the write rate to PCM cells, and 2) handling cell failures when faults occur. Our experiments confirm that during write operations, an extensive...
As one of the key LTE-A technologies, coordinated multi-point transmission (CoMP) has been extensively investigated. Among various CoMP schemes, coherent joint transmission scheme (CJT) shows the largest CoMP gains in both cell average performance and cell edge performance. However, for pursuit of the upper bound of CoMP gains, centralized scheduling was adopted in those proposed CJT schemes. With...
Grading is a parameter that co-determines a risk of tumor progression. Grading is evaluated in a subjective manner during the histological examination of tumor structure. A lack of both a golden pattern for adenocarcinoma and standardization results in a high inaccuracy of the risk prediction in the statistical models. Using some histological features of adenocarcinomas, an approach based on the circular...
In this paper two new schemes of systolic multipliers are proposed, one based on Modified Booth encoding and the other is based on the selection of one of the terms 0, X, 2X, 3X where x is the serial input of the multiplier. The proposed multipliers operate with 100% efficiency that is without zero words inserted between successive data. Systolisity and the continuous operation are achieved without...
Coordinated multiple point transmission (CoMP) technology becomes popular due to its potential for improving the performance of cell-edge UEs who undergo strong inter-cell interference (ICI). To fully exploit the potential CoMP gain, the appropriate method to converge cells into cluster is a prerequisite. However, the majority of existing research are based on theoretical hexagonal cell grid model...
Existing RNS implementations of modular multiplication employ Montgomery's technique, especially in cryptography where consecutive multiplications of large integers are used for exponentiation. This work deviates from these approaches and an RNS architecture of Barrett's modular multiplication algorithm is presented. An algorithmic and architectural comparison with the state-of-the-art solutions shows...
We investigate a coordinated scheduling problem in a two-cell network where in each cell, two users are scheduled for simultaneous communication. Zero-forcing (ZF) beamforming is employed at each base station to suppress both intra- and inter-cell interference. The coordinated scheduling/beamforming problem is formulated as finding proper scheduling decisions and hence beamformers across the network...
In 2004, Robert Jackson and Sunil Talwar published a novel method of decomposing binary prefix addition. Their work sought to balance the complexity of the generate and propagate terms that bear the computational load in parallel prefix adders. This paper presents an implementation of a 64-bit adder based on this method, as well as an improved method of expressing this complex decomposition. This...
Systolic structures for finite field multiplication involve large number of registers for parallel implementation, while bit-serial implementations require a large computation time, which increases along with the order of the field. In this paper, we present a novel scheme for the decomposition of the multiplication over GF(2m) based on irreducible trinomials into several independent units that facilitates...
An efficient Reed-Solomon (RS) decoder design based on the reformulated inversionless Berlekamp-Massey (RiBM) algorithm is presented in this paper. Applying the developed control scheme and the simplified boundary cell, the resulting design can significantly reduce the hardware complexity and have a high throughput rate. Compared with the related works, the proposed design has the advantage of area-time...
Recently, many parallel solutions were proposed in order to accelerate the exact methods for optimal alignment of DNA sequences. However, most of these solutions calculate only the alignment similarity score without finding the actual alignment. This paper presents an efficient solution to find the optimal alignment of the huge DNA sequences. This solution releases the condition of the sequence size...
Computing Euclidean Distances is a very important operation in digital communication, especially in the case of trellis coded modulation, where it is used numerously. This paper shows that a substantial reduction in complexity can be achieved in hardware processing elements for computing Euclidean Distances. A reduction in complexity down to 39% is shown compared to traditional designs. The paper...
This paper presents a model that aims at diminishing the impact of temporal myopia in Heterarchical Control Architectures (HeCA) of Flexible Manufacturing System (FMS). This model is based on a “switching architecture”, based upon the concept of intelligent reactive products. A virtual layer hosts Product Agents having the objective of preserving global performance, while a physical layer congregates...
Microarchitectural simulators are often partitioned into separate, but interacting, functional and timing simulators. These simulators interact through some interface whose level of detail depends upon the needs of the timing simulator. The level of detail supported by the interface profoundly affects the speed of the functional simulator, therefore, it is desirable to provide only the detail that...
This paper proposes a high-speed and area-efficient three-parallel Reed-Solomon (RS) decoder using the simplified degree computationless modified Euclid (S-DCME) algorithm for the key equation solver (KES) block. To achieve high throughput rate, the inner signals such as syndrome, error locator and error value polynomials are computed in parallel. In addition, key equations are solved by using the...
After some recent breaks presented in the technical literature, it has become of paramount importance to gain a deeper understanding of the robustness and weaknesses of cryptographic hash functions. In particular, in the light of the recent attacks to the MD5 hash function, SHA-1 remains currently the only function that can be used in practice, since it is the only alternative to MD5 in many security...
This paper presents an approximate Maximum Common Sub graph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application domain, the graphs have nice properties: they are very sparse, have many different labels, and most vertices have only one predecessor. The algorithm iterates over all vertices once and uses heuristics to find the MCS. It is...
This paper presents heuristics for dynamic management of application code on limited local memories present in high-performance multi-core processors. Previous techniques formulate the problem using call graphs, which do not capture the temporal ordering of functions. In addition, they only use a conservative estimate of the interference cost between functions to obtain a mapping. As a result previous...
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.