陈先生

s3c2510 开发-s3c2510 Development

图像压缩问题要求确定象素序列{p1,p2,…,pn}的最优分段，使得依此分段所需的存储空间最少。每个分段的长度不超过256位。数字化图像是m×m的像素阵列。假定每个像素有一个0 ~ 2 5 5的灰度值。因此存储一个像素至多需8位。若每个像素存储都用最大位8位，则总的存储空间为8m^2 位。为了减少存储空间，我们将采用变长模式（ variable bit scheme），即不同像素用不同位数来存储。像素值为0和1时只需1位存储空间； 值2、3各需2位；值4，5，6和7各需3位；以此类推。-image compression defined pixel sequence (p1, p2, ..., pn) sub-optimal, sub accordingly makes the storage space required at least. The length of each section is not more than 256. The digital image is m m pixel arrays. Assume that each pixel is a 0-2 5 5 of the gray values. Therefore storage of up to a pixel 8. If each pixel with the largest storage capacity of 8-bit, the total storage space for 8m ^ 2. In order to reduce storage space, and we will use variable-length model (variable bit scheme), that is different with different pixel median storage. Pixel values of 0 and 1 and only a storage space; The value of 2,3 required two; Value 4,5,6 and 7 of the required three; Analogy.

fpga implemantaion 时钟生成。 如果我在工作我想要设计一些赤  角 10 mhz geneartion 与赤  角计数器的 50 mhz 时钟代 然后什么我能为做那一个 implemneting 20 mhz 到 50 mhz，而无需使用任何 ip 核心使用直接从编码技术 我们可以为每个时钟生成实现的代码。

GPIO控制LED的简单C程序，希望对大家有所帮助。谢谢大家支持！-GPIO control LED simple C program, we hope to help. Thank you for support!

程序目的：从已知二叉树的前序和中序序列构造该二叉树-procedures Objective : known binary tree from the first sequence and the sequence structure of the sequence of binary tree

数据通信蓝牙HCI

主要帮助餐饮业的老总管理好自己的餐饮事业,即时了解单位的内总业务情况-manager hotel

一个线程钩子的例子-an example threaded hook

自己使用vb编的一个计算各种滤波器参数的程序-its own use vb series of the calculation of a variety of filter parameters of the process

Example project: Retrieving CE device info from Pascal code (using Free Pascal)