Assignment 3 (SEE 312)
Students are required to submit:
1. one report(.pdf format) by the due date (refer to the unit guide) for both parts (A and B) of this assignment via CloudDeakin.
2. .m (Matlab) file of your implementation of Part B.
by the due date indicated in the unit guide.
Allocation of marks are as follows:
• 10% of the marks will be for the presentation aspects of the report.
• Part A : 50% - Technical accuracy
• Part B : 40% - Technical accuracy
Note: Documentary evidence indicating circumstances beyond your control is required for any extensions beyond the due date.
Part A
1. Draw the waveform for the sequence 011100101 using
a. NRZI (Initial instance starts with low)
b. Manchester (Initial instant start with a high)
c. Differential Manchester (Initial instant start with a high) (6 Marks)
2. Given the bit pattern 101011010, encode the data using ASK, BFSK and BPSK. (6 Marks)
3. Pseudoternary waveform representing the binary sequence 01010010110 was transmitted in a noisy channel. The received waveform is given below (Figure 1). Find where the error(s) and explain your answer. (2 Marks)
Figure 1
4. Why would you expect CRC to detect more errors than simply using a parity bit? (2 Marks)
5. In a CRC error-detection scheme, choose ??(??)=??&+??(+??)+1,
a. Encode the bits 10011011011. (5 Marks)
b. Introduce an error pattern 010010000000000 (i.e. invert the digit in the code word where “1” appears in the error pattern sequence.) and see if the error can be detected.
(3 Marks)
c. Introduce an error pattern 111010000000000 and see if the error can be detected. What can be deduced? (6 Marks)
6. Consider four different cellular systems that share the following characteristics. The frequency bands are 820 to 850MHz for mobile unit transmission and 860 to 890MHz for base station transmission. A duplex circuit consists of one 20kHz channel in each direction. The systems are distinguished by the reuse factor which is 4,7,12 and 19 respectively.
a. Suppose that each of the system, the cluster of cells (4,7,12,19) is duplicated 16 times. Find the number of simultaneous communications that can be supported by each system. (Hint: consider the overall bandwidth in the cell corresponding to mobile unit and base
station transmission) (4 Marks)
b. Find the number of simultaneous communications that can be supported by a single cell in each system. (2 Marks) c. What is the area covered, in cells, by each system? (2 Marks)
d. Suppose the cell size is the same in all four systems and a fixed area of 100 cells is covered by each system. Find the number of simultaneous communications that can be supported by each system. (2 Marks)
7. Use,
a. Dijkstra’s algorithm, (5 Marks)
b. Bellman ford algorithm, (5 Marks)
to find the least cost path from node N1 through node N6 in the following figure 2.
Figure 2
Part B (Laboratory exercise)
• This Laboratory requires the use of Matlab. Your Matlab program, as a soft copy, is required to be submitted in a .m file format (directly executable in Matlab) together with your laboratory report, (Please do not submit the code in a document).
• Matlab help is an effective tool to obtain usage information about plethora of Matlab predefined functions when trying to solve a real-world problems. Some additional investigative literature search will also be required to complete this task. This exercise is aimed at training your skills to investigate and use the strong Matlab functionality. Your ability to investigate and search for information is also tested through this exercise.
1. Implement the graph in Figure 2 in Matlab as a directed graph. (8 Marks)
2. Find the shorted path from “N1” to “N6” using Matlab implemented algorithm and show the shortest path(by highlighting using Matlab) in the Matlab figure. You can verify this with the
manually obtained path in part A (Figure 2). (12 Marks)
3. Discuss the pros and cons of Bellman-Ford and Dijkstra algorithm and other more sophisticated algorithms implemented in Matlab. (5 Marks)
4. Dynamic routing of packets in a computer network poses a similar problem to the traffic mitigation problem.
Regularly updated traffic information can be used to provide an estimate of time taken to go from one suburb to another in a city and plan a journey. Use the given .mat file which consists of a cost matrix with the times to go from one suburb to another at a particular instant in time. The cost matrix variable name is M and there are 10 suburbs. Draw the network and find the least cost and the corresponding path from suburb 1 to 10. (15 Marks)
5. Install the “Acoustic Transmitter” App from Google Play or iTunes. Write a Matlab code to capture the Transmitted a Carrier frequency signal of 1000Hz and 2000Hz respectively and confirm transmitted frequencies through the FFT analysis.