DESCRIPTION : BIN to seven segments converter -- segment encoding -- a -- +---+ -- f | | b -- +---+ <- g -- e | | c -- +---+ -- d -- Enable (EN) active : high -- Outputs (data_out) active : low
标签: DESCRIPTION converter segments encoding
上传时间: 2016-08-17
上传用户:ainimao
采用3D Bresenham算法在两点间划一直线 % This program is ported to MATLAB from: % B.Pendleton. line3d - 3D Bresenham s (a 3D line drawing algorithm) % ftp://ftp.isc.org/pub/usenet/comp.sources.unix/volume26/line3d, 1992 % % Which is referenced by: % Fischer, J., A. del Rio (2004). A Fast Method for Applying Rigid % Transformations to Volume Data, WSCG2004 Conference. % http://wscg.zcu.cz/wscg2004/Papers_2004_Short/M19.pdf
标签: Bresenham Pendleton program MATLAB
上传时间: 2013-12-10
上传用户:sz_hjbf
现色彩空间转换R’G’B’ to Y’CbCr的VHDL源代码。
上传时间: 2016-10-15
上传用户:cazjing
TI MSC121x This example uses floating point arithmetic to convert the A/D result.
标签: arithmetic floating example convert
上传时间: 2013-12-09
上传用户:vodssv
采用FPGA实现色彩空间转换R’G’B’ to Y’CbCr的VHDL和verilog源代码,支持xilinx的各种器件.
上传时间: 2013-12-12
上传用户:lps11188
ITU-T G.729 Annex C+ - Reference C code for floating point implementation of G.729 at 6.4/8/11.8 kbit/s with DTX functionality (integration of Annexes B, D and E)
标签: implementation 729 Reference floating
上传时间: 2017-04-10
上传用户:cccole0605
The purpose of the design pattern dictionary is to serve as reference point for commonly accepted software design patterns and idioms. It contains structured summaries of some 30 design patterns and idioms, commonly used in object oriented programming
标签: dictionary reference accepted commonly
上传时间: 2013-12-21
上传用户:leixinzhuo
Run RGB Video and watch the R-G-B Video Components parralel to the original Video
标签: Video Components the parralel
上传时间: 2017-05-07
上传用户:xmsmh
code to calculate a position of a robot using two laser mouse point on the ground.
标签: calculate position ground laser
上传时间: 2014-12-04
上传用户:皇族传媒
迷宫算法(maze) /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */
上传时间: 2013-12-27
上传用户:Divine