Global ETD Search

61	Moderní metody modelování a simulace elektronických obvodů / Advanced Electronic Circuits Simulation Methods Kocina, Filip January 2017 (has links) Disertační práce se zabývá simulací elektronických obvodů. Popisuje metodu kapacitorové substituce (CSM) pro převod elektronických obvodů na elektrické obvody, jež mohou být následně řešeny pomocí numerických metod, zejména Moderní metodou Taylorovy řady (MTSM). Tato metoda se odlišuje automatickým výběrem řádu, půlením kroku v případě potřeby a rozsáhlou oblastí stability podle zvoleného řádu. V rámci disertační práce bylo autorem disertace vytvořeno specializované programové vybavení pro řešení obyčejných diferenciálních rovnic pomocí MTSM, s mnoha vylepšeními v algoritmech (v porovnání s TKSL/386). Tyto algoritmy zahrnují zjednodušování obecných výrazů na polynomy, paralelizaci nezávislou na integrační metodě atp. Tento software běží na linuxovém serveru, který komunikuje pomocí protokolu TCP/IP. Toto vybavení bylo úspěšně použito pro simulaci VLSI obvodů, jejichž řešení pomocí CSM bylo značně rychlejší a spotřebovávalo méně paměti než state-of-the-art SPICE.
62	Coding and decoding for multiuser communication systems / 多端子通信システムにおける符号化および復号の研究 / タタンシツウシンシステムニオケルフゴウカオヨビフクゴウノケンキュウ路姍, Shan Lu 22 March 2014 (has links) 本論文は、多端子通信路に対するマルチユーザ符号化および復号の研究成果をまとめたものである。多重接続加算通信路による情報伝送において、複数ユーザの稼働状態を識別するための誤り訂正可能なシグネチャ符号の構成を論ず,全伝送率の高いシグネチャ符号の一般的な構成法を解明する.双方向中継通信路では、2ユーザターボ符号に対する復号の演算量を低減させる復号法を提案する。加法性白色ガウス雑音環境下では復号性能を劣化することなく、レイリーフェージング環境下では僅かな劣化にとどめながら、復号の演算量を約半分程度に低減することができる. / Coding and decoding for multiuser communication systems are investigated. For MAAC, we propose a coding scheme of (k + 1)-ary error-correcting signature codes. We give binary and non-binary signature codes. They are the best error-correcting signature codes for MAAC, in the sense that they have highest sum rates known. For TWRC, we propose a low-complexity two-user turbo decoding scheme when turbo codes are applied in two users. The approximate decoding algorithm preserves low decoding complexity over the Gaussian TWRC, without much performance degradation. / 博士(工学) / Doctor of Philosophy in Engineering / 同志社大学 / Doshisha University 多端子通信システム Signature 符号多重接続通信路ターボ符号双方向中継通信路 Multiuser Communication System Signature Code Multiple Access Adder Channel Turbo Code Two-Way Relay Channel
63	Reptilförekomster och kopplingar till miljöfaktorer på Billingen : Inventering av reptilfauna med artificial cover objects på lokal nivå i Västsverige / Reptile occurences and connections to environmental factors on Billingen : Survey of reptile fauna with artificial cover objects on a local scale in Western Sweden Carlquist Segell, Maja January 2021 (has links) Förlust av biologisk mångfald är den planetära gräns som överskrids mest, och medför bland de största hoten mot biosfärens integritet. Reptiler är funktionella delar i ekosystem, men habitatförlust, förändrad markanvändning och klimatförändringar orsakar globala populationsminskningar. Ekologisk övervakning möjliggör förståelse för arters tillstånd, och utveckling av bevarandeåtgärder. Denna förekomststudie syftar till att undersöka lokal reptilfauna, som inventerades med artificial cover objects (ACO) i två naturområden på Billingen, ett av de västsvenska platåbergen, i Skövde kommun 2021. Data från miljöbeskrivning och inventering samt över väderförhållanden samlades in, och samband mellan observationer och miljöfaktorer testades med statistiskt t-test för positiva skillnader mellan datagrupper. Skogsödla (Zootoca vivipara), kopparödla (Anguis fragilis), snok (Natrix natrix) och huggorm (Vipera berus),alla allmänna reptilarter i regionen, observerades i undersökningsområdet. Nio observationer gjordes under 20 regnfria dagar i juni och juli, med temperaturer över 18°C. Biotopkvaliteterna brynmiljöer och nektarresurser, solexponering och de öppna biotoperna beteshage och elledningsgata, förekom i signifikant högre utsträckning där observationer gjordes, än på platser utan observationer. Markfuktighet, mänsklig närvaro, naturvärden och områdesskydd uppvisade ingen signifikans. Resultaten överensstämmer med andra studier om reptilarternas habitat, och kan ses gälla på lokal nivå trots ett relativt litet dataunderlag. Effektiva reptilbevarande åtgärder i närområdet kan innebära upprätthållande och skapande av ytor med hög solinstrålning och strukturell komplexitet, fortsatt men inte utökat lågintensivt naturbete, samt ökad halt avträdslagsblandning och brynmiljöer i produktionsskog. Kunskapen kring reptilers ekologi, samtövervakningen av populationer, behöver utökas. Det rekommenderas vidare studier om reptiler, deras habitat och bevarande av biologisk mångfald på lokala nivåer. / Biodiversity loss is the most exceeded planetary boundary, and entails some of the largest threats against biosphere integrity. Reptiles are functional parts of ecosystems, but habitat loss and changes in land use and climate are causing global population declines. Ecological monitoring enables understanding of species’ conditions, and development of conservation measures. This occurrence study aims to investigate local reptile fauna, surveyed using artificial cover objects (ACOs), in two areas on Billingen, one of Western Sweden’s table mountains, in Skövde municipality 2021. Environmental, survey and weather data were collected, and relations between observations and environmental factors were tested with statistical t-test for positive differences between data groups. Zootoca vivipara, Anguis fragilis, Natrix natrix and Vipera berus, all regionally common reptile species, were observed in the investigated area. Nine observationswere made during 20 rain-free days in June and July, with temperatures above 18°C. Solarexposure, biotope qualities Forest edges and Nectar resources, and the open biotopes Pasture and Powerline corridor, occurred in significantly higher extent where observations were made, than on sites without observations. Soil moisture, Human presence, Natural values and Environmental protection did not exhibit any significance. The results correspond to other studies on the reptilespecies’ habitat, and may apply on a local scale despite a relatively small data amount. Effective conservation measures for local reptiles can imply maintaining and creating spaces with high solar radiation and structural complexity, continued but not extended low-intensity grazing, and increasing tree species mixture and edge zones in production forests. Knowledge on reptile ecology and population monitoring needs to increase. Further studies on reptiles and biodiversity conservation on local scales are recommended. Reptiles Environmental factors Artificial Cover Objects ACO Occurrence Survey success Conservation Sweden Billingen Common lizard Viviparous lizard Slow worm Grass snake Common adder Reptiler Miljöfaktorer Artificial Cover Objects ACO Förekomst Inventeringsframgång Naturvård Sverige Billingen Skogsödla Kopparödla Snok Huggorm Other Environmental Biotechnology Annan miljöbioteknik Ecology Ekologi
64	Multiple Constant Multiplication Optimization Using Common Subexpression Elimination and Redundant Numbers Al-Hasani, Firas Ali Jawad January 2014 (has links) The multiple constant multiplication (MCM) operation is a fundamental operation in digital signal processing (DSP) and digital image processing (DIP). Examples of the MCM are in finite impulse response (FIR) and infinite impulse response (IIR) filters, matrix multiplication, and transforms. The aim of this work is minimizing the complexity of the MCM operation using common subexpression elimination (CSE) technique and redundant number representations. The CSE technique searches and eliminates common digit patterns (subexpressions) among MCM coefficients. More common subexpressions can be found by representing the MCM coefficients using redundant number representations. A CSE algorithm is proposed that works on a type of redundant numbers called the zero-dominant set (ZDS). The ZDS is an extension over the representations of minimum number of non-zero digits called minimum Hamming weight (MHW). Using the ZDS improves CSE algorithms' performance as compared with using the MHW representations. The disadvantage of using the ZDS is it increases the possibility of overlapping patterns (digit collisions). In this case, one or more digits are shared between a number of patterns. Eliminating a pattern results in losing other patterns because of eliminating the common digits. A pattern preservation algorithm (PPA) is developed to resolve the overlapping patterns in the representations. A tree and graph encoders are proposed to generate a larger space of number representations. The algorithms generate redundant representations of a value for a given digit set, radix, and wordlength. The tree encoder is modified to search for common subexpressions simultaneously with generating of the representation tree. A complexity measure is proposed to compare between the subexpressions at each node. The algorithm terminates generating the rest of the representation tree when it finds subexpressions with maximum sharing. This reduces the search space while minimizes the hardware complexity. A combinatoric model of the MCM problem is proposed in this work. The model is obtained by enumerating all the possible solutions of the MCM that resemble a graph called the demand graph. Arc routing on this graph gives the solutions of the MCM problem. A similar arc routing is found in the capacitated arc routing such as the winter salting problem. Ant colony optimization (ACO) meta-heuristics is proposed to traverse the demand graph. The ACO is simulated on a PC using Python programming language. This is to verify the model correctness and the work of the ACO. A parallel simulation of the ACO is carried out on a multi-core super computer using C++ boost graph library. Common subexpression elimination (CSE) multiple constant multiplication (MCM) multiplier block (MB) adder step logic depth (LD) logic operator (LO) lower bound and optimality graph dependent method radix number system redundant number representations pattern preservation algorithm (PPA) zero-dominant set (ZDS) polynomial ring radix polynomials complete residue system modulo radix congruent relation tree encoder graph encoder subexpression tree algorithm (STA) A-operation demand graph dynamic capacitated arc routing problem metaheuristics ant colony optimization (ACO) max-min ant system (MMAS) parallel computing computer cluster.
65	Calcul flottant haute performance sur circuits reconfigurables / High-performance floating-point computing on reconfigurable circuits Pasca, Bogdan Mihai 21 September 2011 (has links) De plus en plus de constructeurs proposent des accélérateurs de calculs à base de circuits reconfigurables FPGA, cette technologie présentant bien plus de souplesse que le microprocesseur. Valoriser cette flexibilité dans le domaine de l'accélération de calcul flottant en utilisant les langages de description de circuits classiques (VHDL ou Verilog) reste toutefois très difficile, voire impossible parfois. Cette thèse a contribué au développement du logiciel FloPoCo, qui offre aux utilisateurs familiers avec VHDL un cadre C++ de description d'opérateurs arithmétiques génériques adapté au calcul reconfigurable. Ce cadre distingue explicitement la fonctionnalité combinatoire d'un opérateur, et la problématique de son pipeline pour une précision, une fréquence et un FPGA cible donnés. Afin de pouvoir utiliser FloPoCo pour concevoir des opérateurs haute performance en virgule flottante, il a fallu d'abord concevoir des blocs de bases optimisés. Nous avons d'abord développé des additionneurs pipelinés autour des lignes de propagation de retenue rapides, puis, à l'aide de techniques de pavages, nous avons conçu de gros multiplieurs, possiblement tronqués, utilisant des petits multiplieurs. L'évaluation de fonctions élémentaires en flottant implique souvent l'évaluation en virgule fixe d'une fonction. Nous présentons un opérateur générique de FloPoCo qui prend en entrée l'expression de la fonction à évaluer, avec ses précisions d'entrée et de sortie, et construit un évaluateur polynomial optimisé de cette fonction. Ce bloc de base a permis de développer des opérateurs en virgule flottante pour la racine carrée et l'exponentielle qui améliorent considérablement l'état de l'art. Nous avons aussi travaillé sur des techniques de compilation avancée pour adapter l'exécution d'un code C aux pipelines flexibles de nos opérateurs. FloPoCo a pu ainsi être utilisé pour implanter sur FPGA des applications complètes. / Due to their potential performance and unmatched flexibility, FPGA-based accelerators are part of more and more high-performance computing systems. However, exploiting this flexibility for accelerating floating-point computations by manually using classical circuit description languages (VHDL or Verilog) is very difficult, and sometimes impossible. This thesis has contributed to the development of the FloPoCo software, a C++ framework for describing flexible FPGA-specific arithmetic operators. This framework explicitly separates the description of the combinatorial functionality of an arithmetic operator, and its pipelining for a given precision, operating frequency and target FPGA.In order to be able to use FloPoCo for designing high performance floating-point operators, we first had to design the optimized basic blocks. We first developed pipelined addition architectures exploiting the fast-carry lines present in modern FPGAs. Next, we focused on multiplication architectures. Using tiling techniques, we proposed novel architectures for large multipliers, but also truncated multipliers, based on the multipliers found in modern FPGA DSP blocks. We also present a generic FloPoCo operator which inputs the expression of a function, its input and output precisions, and builds an optimized polynomial evaluator for the fixed-point evaluation of this function. Using this building block we have designed floating-point operators for the square-root and exponential functions which significantly outperform existing operators. Finally, we also made use of advanced compilation techniques for adapting the execution of a C program to the flexible pipelines of our operators. FPGA Virgule flottante FloPoCo Chemin de données arithmétique Pipeline pour une fréquence donnée Addition pipelinée Additionneur rapide Multiplication Karatsuba-Offman Carré Multiplieur tronqué Multiplication par pavage Virgule fixe Approximation polynomiale Racine carrée flottante Exponentielle flottante Accumulation flottante Schéma d'évaluation de Horner Somme de carrés flottante Synthèse de haut niveau Nid de boucles parfait Multiplication de matrices Jacobi Dilemme du fabricant de table Méthode des différences tabulées Communications pipelinées FPGA Floating-point FloPoCo Arithmetic datapath Frequency-driven pipelining Pipelined addition Short-latency adder Multiplication Karatsuba-Offman Squarer Truncated multiplier Multiplication tiling Fixed-point Polynomial approximation Floating-point square root Floating-point exponential Floating-point accumulation Horner datapath Floating-point sum-of-products High-level synthesis Perfect loop nests Matrix-matrix multiply Jacobi stencil Table maker's dilemma Pipelined communications Pipelined communications

Page generated in 0.0259 seconds