Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Coefficient-level rate distortion optimized quantization (RDOQ) is an efficient tool to improve rate-distortion performance with 6%–8% bit-rate saving. It has been widely adopted in video encoders such as JM, x264, HM and so on. However, software implementation of RDOQ suffers from high computation complexity due to intensive path search and from data dependency caused by context based entropy coding...
Rectangles are the smallest cycles (i.e., cycles of length 4) and most elementary sub-structures in a bipartite graph. Similar to triangle counting in uni-partite graphs, rectangle counting has many important applications where data is modeled as bipartite graphs. However, efficient algorithms for rectangle counting are lacking. We propose three different types of algorithms to cope with different...
The paper proposes a method to improve the simulation speed of complex electromagnetic environment based on Ray Tracing model. As the most critical factor in complex electromagnetic environment, terrain meshing to reduce simulation time is on of the most feasible method. Do Daubechies4 two-dimensional discrete wavelet transform on the terrain DEM data to smooth the terrain to accelerate simulation...
Data transmission or synchronization is quite common especially in the enterprise application integration environment. Multiple information in databases or file systems needs to be shared and synchronized when heterogeneous systems access each other. This paper presents an improved file synchronization algorithm(ARDC) based on the famous RDC algorithm. Firstly, an adaptive block-divided strategy is...
In this paper, we propose an effective macroblock (MB) layer rate control (RC) scheme with low complexity for efficient H.264/AVC video encoder hardware implementation. Linear mean absolute difference (MAD) prediction is crucial in H.264/AVC rate control. The MAD prediction accuracy in JVT G012 is imperfect with high complexity. Therefore we propose a new MAD prediction arithmetic which computes MAD...
Vectorless power grid verification is a powerful technique to validate the robustness of the on-chip power distribution network for all possible current waveforms. Formulated and solved as linear programming problems, vectorless power grid verification demands intensive computational power due to the large number of nodes in modern power grids. Previous work showed that the performance bottleneck...
Vectorless power grid verification makes it possible to evaluate worst-case voltage drops without enumerating possible current waveforms. Under linear current constraints, the vectorless power grid verification problem can be formulated and solved as a linear programming (LP) problem. However, previous approaches suffer from long runtime due to the large problem size. In this paper, we design the...
Given a large scale Internet, how can we derive a representative simplifying topology model by network simulation? There are many known algorithms to compute interesting measures (scale down the number of clients, deletion methods, contraction methods, et al.), but most of them only reduce the scale of the network topology, the facticity of network simulation results can't be guaranteed. So when simplifying...
This paper describes a new floorplanning approach called constrained adjacency graph (CAG) that helps exploring adjacency in floorplans. CAG extends the previous adjacency graph approaches by adding explicit adjacency constraints to the graph edges. After sufficient and necessary conditions of CAG are developed based on dissected floorplans, CAG is extended to handle general floorplans in order to...
In this paper, we propose the linear constraint graph (LCG) as an efficient general floorplan representation. For n blocks, an LCG has at most 2n+3 vertices and at most 6n+2 edges. Operations with direct geometric meanings are developed to perturb the LCGs. We apply the LCGs to the floorplan optimization with soft blocks to leverage its advantage in terms of the sizes of the graphs, which will improve...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.