full wave rectifierDuring the period from 偽 to 蟺, the input voltage vs input current is are positive and the power flows from supply to the load. The converter is said to be operated at rectification mode .During the period from 蟺 to 蟺+偽 , the input voltage vs is negative and the input current is is positive and reverse power flows from load to the supply. The converter is said to be operated in inversion mode. Depending on the value of 偽, average output voltage can be either positive or negative and hence provides 2 quadrant operation.
標簽： input rectifierDuring the positive
上傳時間： 2017-04-10
上傳用戶：alan-ee
A combined space鈥搕ime block coding (STBC) and eigen-space tracking (EST) scheme in multiple-input-multiple-output systems is proposed. It is proved that the STBC-EST is capable of shifting hardware complexity from the receiver to the transmitter without any bit error rate (BER) performance loss. A computation efficient EST algorithm is also proposed, which makes the STBC-EST affordable. Simulation results show that the STBC-EST with a modest feedback requirement results in a negligible BER performance loss compared with a dual system configuration.
標簽： multiple-input-m eigen-space combined tracking
上傳時間： 2014-01-13
上傳用戶：磊子226
This is an interface program for flip flop emulation. At first pulse at the input pin the apropriate output will latch and at the second pulse will release. Very short and efficient program
標簽： apropriate interface emulation the
上傳時間： 2017-04-19
上傳用戶：a3318966
program which uses hashing techniques for storing and retrieving the data. Input to the program: Some random numbers. Input will be from a file. Output: First the program reads all the input and store it properly using some hash techniques. Once your program reads the complete input,it waits for the user input (prompt to the user). User now enters some number.program displays if this number exists in the list or not. it also display the time taken in the search operation.
標簽： program techniques retrieving the
上傳時間： 2017-04-27
上傳用戶：shus521
生成Trick文件工具 1.Open command line 2.input tricktest Usage: TrickTest -f -o -i -f source mpeg2 file to trick -o trick output directory -i output file id -m max coding error, default 0 -b max bitrate for trick generate, default 0 mean no limit -s trick buffer block size, must be n*188 -l log file, default c:\tricktest.log example: tricktest -f 黑鷹行動.mpg -o c:\temp -i A -m 1000 -b 3750000 soure file: 黑鷹行動.mpg output directory: c:\temp filename: 000000A,000000A.ff,000000A.fr,000000A.vvx max coding error: 1000 trick generation speed: 3750000 bps a
標簽： TrickTest tricktest command source
上傳時間： 2014-01-23
上傳用戶：水口鴻勝電器
NN Functions a program in Lisp to demonstrate working of an artificial neuron. (Enter an input vector X and weight vector W. Calculate weighted sum XW. Transform this using signal or activation functions like logistic, threshold, hyperbolic-tangent, linear, exponential, sigmoid or some other functions (syntax provided) and display the output).
標簽： demonstrate artificial Functions program
上傳時間： 2013-12-30
上傳用戶：hfmm633
Implementation for the Huffman Cod in Visual C++. Both, the encoder and the decoder take as input a file and write the output into another file.
標簽： the Implementation Huffman encoder
上傳時間： 2013-12-30
上傳用戶：ghostparker
Implementation for Lempel-Ziv code. Encoder and decoder are separated. The input is a file and the output is written in another file.
標簽： Implementation Lempel-Ziv and separated
上傳時間： 2017-07-05
上傳用戶：xuanjie
Calculates if the brackets in a sentence are correctly close. Input consists, one per line, sentences with brackets, and output say YES if its correctly close, or NO int if its not saying where is the error. Input: ()[]<>(**) (*) (ASA Output: YES NO 2 NO 4
標簽： Calculates correctly brackets consists
上傳時間： 2013-12-13
上傳用戶：aig85
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
標簽： Implementation calculates algorithm Edmonds
上傳時間： 2014-01-04
上傳用戶：kiklkook
