encode.v The encoder syndrome.v Syndrome generator in decoder berlekamp.v Berlekamp algorithm in decoder chien-search.v Chien search and Forney algorithm in decoder decode.v The top module of the decoder inverse.v Computes multiplication inverse of an Galois field elEMent test-bench.v The test fixture, and some brief notes on using the modules. data-rom.v A simple data source for testing run For those intelligence-challenged who can t run verilog LGPL The license
標簽： Berlekamp berlekamp algorithm generator
上傳時間： 2014-02-16
上傳用戶：fxf126@126.com
關于FPGA流水線設計的論文 This work investigates the use of very deep pipelines for implementing circuits in FPGAs, where each pipeline stage is limited to a single FPGA logic elEMent (LE). The architecture and VHDL design of a parameterized integer array multiplier is presented and also an IEEE 754 compliant 32-bit floating-point multiplier. We show how to write VHDL cells that implement such approach, and how the array multiplier architecture was adapted. Synthesis and simulation were performed for Altera Apex20KE devices, although the VHDL code should be portable to other devices. For this family, a 16 bit integer multiplier achieves a frequency of 266MHz, while the floating point unit reaches 235MHz, performing 235 MFLOPS in an FPGA. Additional cells are inserted to synchronize data, what imposes significant area penalties. This and other considerations to apply the technique in real designs are also addressed.
標簽： investigates implementing pipelines circuits
上傳時間： 2015-07-26
上傳用戶：CHINA526
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth elEMent in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
標簽： introduction the contains intended
上傳時間： 2013-12-23
上傳用戶：liansi
英文版,pdf格式。 詳細說明： Title: STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library (2nd Edition) URL: http://www.amazon.com/exec/obidos/tg/detail/-/0201379236/ ISBN: 0201379236 Author: David R. Musser / Gillmer J. Derge / Atul Saini / Gilmer J. Derge Publisher: Addison-Wesley Page: 560 Edition: 2nd edition (March 27, 2001) Catalog: C++ Format: PDF Size: 3.8M Supplier: December Summary: The Standard Template Library was created as the first library of genetic algorithms and data structures, with four ideas in mind: generic programming, abstractness without loss of efficiency, the Von Neumann computation model, and value semantics. This guide provides a tutorial, a description of each elEMent of the library, and sample applications. The expanded second edition includes new code examples and demonstrations of the use of STL in real-world C++ software development it reflects changes made to STL for the final ANSI/ISO C++ language standard.
標簽： Programming Reference Standard Tutorial
上傳時間： 2015-09-02
上傳用戶：Breathe0125
Hard-decision decoding scheme Codeword length (n) : 31 symbols. Message length (k) : 19 symbols. Error correction capability (t) : 6 symbols One symbol represents 5 bit. Uses GF(2^5) with primitive polynomial p(x) = X^5 X^2 + 1 Generator polynomial, g(x) = a^15 a^21*X + a^6*X^2 + a^15*X^3 + a^25*X^4 + a^17*X^5 + a^18*X^6 + a^30*X^7 + a^20*X^8 + a^23*X^9 + a^27*X^10 + a^24*X^11 + X^12. Note: a = alpha, primitive elEMent in GF(2^5) and a^i is root of g(x) for i = 19, 20, ..., 30. Uses Verilog description with synthesizable RTL modelling. Consists of 5 main blocks: SC (Syndrome Computation), KES (Key Equation Solver), CSEE (Chien Search and Error Evaluator), Controller and FIFO Register.
標簽： symbols length Hard-decision Codeword
上傳時間： 2014-07-08
上傳用戶：曹云鵬
Distributed Median,Alice has an array A, and Bob has an array B. All elEMents in A and B are distinct. Alice and Bob are interested in finding the median elEMent of their combined arrays.
標簽： array B. Distributed has
上傳時間： 2013-12-25
上傳用戶：洛木卓
本手冊針對的是已有一定網頁設計制作經驗的讀者。其目的是提供最新最全的樣式表內容的快速索引及注釋。所以對于樣式表的基礎知識，在此僅簡單介紹，恕不贅述。 本手冊的升級信息與版權聲明請參閱關于本書頁面。本手冊中專用詞匯請參閱中英文詞匯對照表。 限于篇幅，對于一些過于繁雜的相關內容，如動態樣式屬性（Dynamic Properties），濾鏡（Filters），行為（Behaviors）請參閱我的其它相關著作。 本書中涉及到的所有HTML對象（Object，elEMent），HTML特性（Attributes）和屬性（Properties）請參閱我的相關著作。
上傳時間： 2015-11-19
上傳用戶：hj_18
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elEMents will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of elEMent a of costs (space delimited), which is the same as the ath integer of elEMent b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標簽： represented integers group items
上傳時間： 2016-01-17
上傳用戶：jeffery
How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-elEMent clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.
標簽： the decision clusters Cluster
上傳時間： 2013-12-21
上傳用戶：gxmm
This title demonstrates how to develop computer programmes which solve specific engineering problems using the finite elEMent method. It enables students, scientists and engineers to assemble their own computer programmes to produce numerical results to solve these problems. The first three editions of Programming the Finite elEMent Method established themselves as an authority in this area. This fully revised 4th edition includes completely rewritten programmes with a unique description and list of parallel versions of programmes in Fortran 90. The Fortran programmes and subroutines described in the text will be made available on the Internet via anonymous ftp, further adding to the value of this title.
標簽： demonstrates engineering programmes computer
上傳時間： 2014-01-13
上傳用戶：youke111
