Computes BER v EbNo curve for convolutional encoding / soft decision Viterbi decoding scheme assuming BPSK. Brute force Monte Carlo approach is unsatisfactory (takes too long) to find the BER curve. The computation uses a quasi-analytic (QA) technique that relies on the estimation (approximate one) of the information-bits Weight Enumerating Function (WEF) using A simulation of the convolutional encoder. Once the WEF is estimated, the analytic formula for the BER is used.
标签： convolutional Computes encoding decision
上传时间： 2013-12-24
上传用户：咔乐坞
北京大学ACM比赛题目 In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of two odd prime numbers. For example: 8 = 3 + 5. Both 3 and 5 are odd prime numbers. 20 = 3 + 17 = 7 + 13. 42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23. Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.) Anyway, your task is now to verify Goldbach s conjecture for all even numbers less than a million.
标签： mathematician Christian Goldbach Leonhard
上传时间： 2016-04-22
上传用户：wangchong
Microsoft .net IL 汇编语言程序设计指南. To tell the truth, I don t think I had much choice in this matter. Let me explain. With Microsoft .NET technology taking the world by storm, with more and more information professionals getting involved, large numbers of books covering various aspects of this technology have started to arrive—and none too soon. Alas, virtually all of these books are dedicated to .NET-based programming in high-level languages and rapid application development (RAD) environments. No doubt this is extremely important, and I am sure all these books will have to be reprinted to satisfy the demand. But what about the plumbing?
标签： Microsoft choice matter truth
上传时间： 2014-11-06
上传用户：二驱蚊器
/* * The internal form of a hash table. * * The table is an array indexed by the hash of the key collisions * are resolved by hanging a linked list of hash entries off each * element of the array. Although this is a really simple design it * isn t too bad given that pools have a low allocation overhead. */ split from apache for general usage
上传时间： 2014-01-07
上传用户：gtf1207
This version of the book is a DRAFT! The chapters are mostly complete, but not carefully edited. Some of the debugging sections are not done, and not all chapters have exercises. If you have high-level comments about the organization of the book or the topics covered, please send me email at feedback{at}thinkpython{dot}com. It is probably too early for detailed comments like spelling errors.
标签： carefully chapters complete version
上传时间： 2014-08-29
上传用户：ayfeixiao
This a simple database management system. It doesn t use any other code (i.e. ODBC, ADO, etc.) and has it s own database file format. I wrote it because I found the other DBMSs code too bulky and hard to debug. It s designed for small applications and I doubt it could handle anything on a large scale. A sample program included in the .zip shows how everything works. The database project is a library project, so you ll have to compile and link with the .lib file to get everything working. Pros: - You have the source code so you know exactly what it is doing - Database files are very small - Small and fast code Cons: - Can t handle large amounts of records (more than 65000ish) - Doesn t support SQL (you have to search the database by cycling through the records and testing them against your constraints) - Each database file can only have one table.
标签： i.e. management database simple
上传时间： 2016-10-02
上传用户：851197153
PRINCIPLE: The UVE algorithm detects and eliminates from a PLS model (including from 1 to A components) those variables that do not carry any relevant information to model Y. The criterion used to trace the un-informative variables is the reliability of the regression coefficients: c_j=mean(b_j)/std(b_j), obtained by jackknifing. The cutoff level, below which c_j is considered to be too small, indicating that the variable j should be removed, is estimated using a matrix of random variables.The predictive power of PLS models built on the retained variables only is evaluated over all 1-a dimensions =(yielding RMSECVnew).
标签： from eliminates PRINCIPLE algorithm
上传时间： 2016-11-27
上传用户：凌云御清风
1. 输入caculator，程序开始执行，继续输入3*4+5，回车后输出17，继续下一个计算或Ctrl+C退出。 2. 输入caculator 3*4+5，程序执行输出结果17。 3. 输入caculator 3*4+5 33，程序执行输出结果error: too many arguments。
上传时间： 2014-01-22
上传用户：weiwolkt
The AVRcam source files were built using the WinAVR distribution (version 3.3.1 of GCC). I haven t tested other versions of GCC, but they should compile without too much difficulty. * The source files for the AVRcam had the author name and copyright information added back into them after the judging of the project, since it states in the competition rules that the author s name can not be present during their inspection. * The included source files are the ones that were submitted for the entry into the Circuit Cellar contest. I have continued to develop the AVRcam, and have added several new features (such as ignoring objects that aren t larger than a minimum size, removing tracked objects that overlap with each, and some general optimizations). If you are interested in the latest source, email me at john@jrobot.net * For more info about the AVRcam, check out http://www.jrobot.net John Orlando August 20, 2004
标签： distribution version AVRcam source
上传时间： 2016-12-30
上传用户：GavinNeko
给出一个非负小数，找出分子不超过M，分母不超过N的最简分数或整数， 使其最接近给出的小数。如果这个分数不唯一，输出‘too MANY’。 输入文件格式(closest.in) 第一行，M，N（1<=M,N<=10^9） 第二行，即小数R，(0<R 输出文件格式(closest.out) 仅一行，若解唯一输出 分子 / 分母(整数K写成K/1)，否则输出too MANY 样例输入： 360 120 3.1415926536 样例输出： 355/113
标签：
上传时间： 2017-01-08
上传用户：iswlkje
