2000
DOI: 10.1119/1.19491
|View full text |Cite
|
Sign up to set email alerts
|

Advanced LabView Labs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2006
2006
2006
2006

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 0 publications
0
7
0
Order By: Relevance
“…This can also be used along with other third party software, making it more attractive for development applications such as this one. Apart from these, the other reason for choosing LabVIEW is for its inbuilt server facility that can be utilized to publish a GUI for Internet access to the experiments [13], [14].…”
Section: A Interfacing Hardware and Softwarementioning
confidence: 99%
“…This can also be used along with other third party software, making it more attractive for development applications such as this one. Apart from these, the other reason for choosing LabVIEW is for its inbuilt server facility that can be utilized to publish a GUI for Internet access to the experiments [13], [14].…”
Section: A Interfacing Hardware and Softwarementioning
confidence: 99%
“…A structure for sending particular command to analyzer is shown in this figure, and it represents one of the three stages, needed for full data interchange between computer and measurement hardware. Such program structure is universal and it can be used to implement most of GPIB functions [2]. Depending on what operation has to be performed, appropriate command (or command sequence) is entered into "Transferred string" field.…”
Section: Program For Gpib Interfacementioning
confidence: 99%
“…Most programs use just 6 to 8 commands so it is not necessary to learn all of the GPIB commands to develop a good GPIB program. Program complexity increases as the number of devices being controlled and number of tests increase [2,6].…”
Section: Program For Gpib Interfacementioning
confidence: 99%
“…The FFT algorithm exploits symmetries in the mathematics of the calculation to exponentially reduce the computational complexity required. For a data-set of 10 6 points, the FFT is 50,000 times faster than the discrete Fourier transform [10]. The horizontal scaling in the frequency domain is limited to Fs/2 because of the Nyquist-Shannon Sampling Theorem.…”
Section: Fast Fourier Transformmentioning
confidence: 99%