校验编码及源代码

Coding Challenge
代码挑战

Input string is encoded as nine bit characters -- eight data bits followed by a parity bit. Output string should contain the eight bit data character if the character parity is even, otherwise output a question mark '?'.

 

For example: Sixteen characters making the string "ABCDEFGHIJKLMNOP" are encoded as in Encoder.vi, adding the parity bits, and resulting in an eighteen byte string of "4184 0C25 52D4 E811 2449 952E 61DA C4C9 5328". Given this eighteen byte string as an input, your VI should produce the original sixteen byte string. If any nine bit input character has odd parity,
this indicates an error in transmission, and you should output a '?'.

例如:16个字符” ABCDEFGHIJKLMNOP”用Encoder.vi进行编码,加上校验位,结果得到以80位字符串” 4184 0C25 52D4 E811 2449 952E 61DA C4C9 5328”.把这80位字符串作为输入,你的VI要能生成原来的16位字符串.如任何9位输入字符有奇位,表示在传输中有错误产生,你应该输出”?”表示.

* The Winning VI will be the fastest correct solution to use no CINs, DLLs, or EXEs.
* Diagram readability and style will be used to break ties.
* VIs will be run on an Intel P4. We may use additional computer architectures such as PPC or multi-CPU to help break ties.

*在不使用任何CINs,DLLs,以及EXEs的情况下运行最快的VI为获胜.

*Diagram的可读性和格式会被作为判定胜负的依据.

*VI将会在Intel PM 1.60GHz的计算机上运行.统一判断最优化的程序.

Hint -- a pretty good solution should take less than 100ms for the longest input string. That will not be fast enough to win, though.

提示—优秀的解决方案在使用最长输入字符串时不应该超过100ms.但100ms还不是最快的,鹋鹋已经达到60ms了.

Be sure to enter your identifying information below.

请务必输入以下信息.

Name:
Company Name:
Email:
Years using LabVIEW:
Comments on Solution:

姓名:

公司名称:

电子信箱:

使用LabVIEW时间(年):

方案说明: