Lab 2 Introduction To Labview and Usrp: Principle of Communication Lab Manual
Lab 2 Introduction To Labview and Usrp: Principle of Communication Lab Manual
Lab 2 Introduction To Labview and Usrp: Principle of Communication Lab Manual
Lab 2
Introduction to LabVIEW and USRP
Objective:
The main objective of this lab is to get familiar with LabVIEW graphical programing basics, programing
tools and debugging tools.
INTRODUCTION:
Like other programming languages, NI LabVIEW software has many different data types, and ways
to organize those data types. They can be distinguished by color and decoration, and they are each
used for particular reasons. This section illustrates the capabilities of various data types and
structures, and when to use one over another.
This section includes:
String Data Type
Numeric Data Type
Boolean Data Type
Dynamic Data Type
Data Structures in LabVIEW
Creating Array Controls and Indicators
Using Arrays With Loops
Clusters
Creating Clusters
Using Cluster Functions
Enums
Lab Task
In-Lab Task 1:
Create a VI in while loop. Create the logic to find out which (the first) index in the array that have the
number greater than 30. See front panel below.
In-Lab Task 2:
Implement the given VI in LABVIEW. In given VI the indexing of input tunnel is enabled. Disable the
indexing and find the correct indicator type for the output and explain the reason.
With Indexing
Without Indexing
In-Lab Task 3:
Take an input cluster having the record of a student’s profile such as name, age, and university name and
employment status. Unbundle this cluster to display the name and employment status of the student, also
modify the age of the student and display it.
Post-Lab Task 1:
Implement the given VI in LABVIEW. In given VI the indexing of input tunnel and output tunnel are
enabled. First, disable the indexing of input tunnel and explain the errors occurred. Find the solution for the
errors and repeat the same procedure for output tunnel.
With Indexing
Without Indexing
Error Corrected
Post-Lab Task 2:
Make an array v= [1 2 3 4 5 6 7 8 9 10], develop an algorithm such that the first element of the vector is
multiplied by length(v), second element by length(v)-1and similarly the last element i.e. 10 is multiplied
by length(v)-9. The final output array should be f= [10 18 24 28 30 30 28 24 18 10]. The algorithm
devised should only use the array size function of array v to achieve array f.