1 00:00:00,120 --> 00:00:06,870 So now what we tried to do is we'll cover how we use and function that can be used to receive the data 2 00:00:06,870 --> 00:00:07,860 from a new right. 3 00:00:08,370 --> 00:00:09,930 So if you just explore. 4 00:00:11,220 --> 00:00:12,100 You are obvious. 5 00:00:12,120 --> 00:00:17,550 OK, so you do have an EPA that views to receive the data, right? 6 00:00:17,550 --> 00:00:27,300 So if you just explore this, OK, so this required an instance structure, OK, then the second argument 7 00:00:27,300 --> 00:00:32,130 is the buffer where we want to store the data that we received in the buffer. 8 00:00:32,160 --> 00:00:32,430 Right. 9 00:00:32,700 --> 00:00:35,680 And the last one is the number of fight we want to see. 10 00:00:36,030 --> 00:00:38,130 So these are the three arguments that we have. 11 00:00:38,430 --> 00:00:41,370 And then this returns the number of victories you write. 12 00:00:41,370 --> 00:00:47,190 And this is very helpful because here will be specifying the number of bytes that we are planning to 13 00:00:47,190 --> 00:00:47,640 resume. 14 00:00:47,890 --> 00:00:51,910 OK, and this will return the number of bytes been deceived. 15 00:00:51,930 --> 00:00:54,290 So let us assume we with an eleven. 16 00:00:54,510 --> 00:01:02,160 So as soon as this count changes such as let's assume that we received a single by then, we must document 17 00:01:02,160 --> 00:01:06,520 that now we want to receive the ten bucks, right? 18 00:01:06,600 --> 00:01:09,420 So this is how we gonna implement the logic. 19 00:01:09,450 --> 00:01:17,010 So if you go to an OK, here, what we are doing is we are utilizing a same function and data that we 20 00:01:17,010 --> 00:01:19,560 have in the data buffer that we are sending. 21 00:01:19,650 --> 00:01:22,500 OK, and we have a total of 11 byte of the time. 22 00:01:22,500 --> 00:01:24,480 We already know that we are sending Halloway. 23 00:01:24,790 --> 00:01:33,310 OK, we are waiting for a completion of data transmission now to receive that data back in n receive. 24 00:01:33,990 --> 00:01:34,320 OK. 25 00:01:34,590 --> 00:01:37,640 We need to perform look back mode, right? 26 00:01:37,660 --> 00:01:43,590 So here, if you just perform a normal operation, we won't be able to receive anything. 27 00:01:43,590 --> 00:01:50,190 But if we look back at the same data that you have transmitted, we could fill up our before and then 28 00:01:50,820 --> 00:01:54,390 we could try to utilize the received function, right? 29 00:01:54,390 --> 00:01:57,600 So that will basically we return the data that we have an issue. 30 00:01:58,020 --> 00:02:03,780 So first thing that we want to do is to change our you work operating right. 31 00:02:03,780 --> 00:02:07,470 And to do that, we do have our specific API. 32 00:02:07,770 --> 00:02:12,320 So we have an unbiased set operating mode. 33 00:02:12,690 --> 00:02:15,720 So this required an agreement as an instance structure. 34 00:02:15,720 --> 00:02:19,420 And second, when we have a set operation, we're great. 35 00:02:19,440 --> 00:02:24,120 So we have four different operation which are supported by what we have normal operation mode. 36 00:02:24,630 --> 00:02:27,000 Get where we will be sending and receiving a data. 37 00:02:27,690 --> 00:02:31,340 Then we have a local loop, remote lubeck and automatically. 38 00:02:31,680 --> 00:02:34,010 So we want to perform a local loop. 39 00:02:34,200 --> 00:02:38,660 So whatever data that we are transmitting, we want to issue back to CMT, right? 40 00:02:39,030 --> 00:02:42,180 And to do that, you basically have certain macros, right? 41 00:02:42,210 --> 00:02:47,100 Certain values that we need to as an argument to this operation. 42 00:02:47,220 --> 00:02:47,480 Right. 43 00:02:47,790 --> 00:02:54,510 If you just go up, you will be finding the various operating mode that we have. 44 00:02:54,870 --> 00:02:57,750 So they will all really be defined in a headed wide. 45 00:02:58,080 --> 00:03:00,150 So if you just explore. 46 00:03:01,350 --> 00:03:07,170 So here you would see the different operating modes are declining to let just click a tree and then 47 00:03:07,170 --> 00:03:12,120 you get here, you have a definition for an operational rate of our normal rule. 48 00:03:12,120 --> 00:03:19,290 We need to pass zero zero four and what we do more, we need to pass one or a local lubeck zero, two 49 00:03:19,560 --> 00:03:21,120 and four and more lubeck. 50 00:03:21,120 --> 00:03:22,290 We need to pad Sidoti. 51 00:03:22,560 --> 00:03:24,800 So we just copy this look. 52 00:03:24,840 --> 00:03:27,360 Look back, OK, we'll go back to our call. 53 00:03:27,720 --> 00:03:34,290 And then when we say time order, which is nine six zero zero, we'll just be configuring or operating 54 00:03:34,290 --> 00:03:35,610 mode to be, look, look back. 55 00:03:35,950 --> 00:03:41,550 Now this will allow us to receive the data back in an hour before whatever we are transmitting, right? 56 00:03:41,550 --> 00:03:44,220 And then we are sending this data that is headed away. 57 00:03:44,460 --> 00:03:47,720 OK, and we are waiting for a completion of the transmission. 58 00:03:48,060 --> 00:03:51,060 The once data transmission is completed, OK? 59 00:03:51,360 --> 00:03:52,320 We are basically. 60 00:03:53,590 --> 00:03:59,920 Adding the message has come to sending that right, remember, now we are working and then. 61 00:04:01,260 --> 00:04:09,060 A local to back, all of the data that we are sending will be automatically stored in and received FIFA 62 00:04:09,160 --> 00:04:16,110 right, and our agenda is to take the details of our ISA people into a. 63 00:04:17,220 --> 00:04:25,320 A real nature to do that, we have declared energy a game of tape and consisting of an 11 element. 64 00:04:25,590 --> 00:04:26,790 So that is our agenda. 65 00:04:26,800 --> 00:04:28,970 So here we will be touring 11 character. 66 00:04:29,070 --> 00:04:31,710 It is hallowed right now if you just go ahead. 67 00:04:32,010 --> 00:04:36,940 We are waiting for a bite binary seem to be able to eliminate. 68 00:04:36,960 --> 00:04:43,220 So we know that with each bite we received, OK, with each bite we dig out from a received people are 69 00:04:43,230 --> 00:04:48,270 by to see will increment right because this will return the number of bite that we see, right? 70 00:04:48,280 --> 00:04:53,100 So even though we initialize this two to zero. 71 00:04:53,510 --> 00:04:56,700 So the first going forward will be zero. 72 00:04:56,970 --> 00:05:01,500 But then as soon as we receive the first bite, this will be implemented by one right and automatically 73 00:05:01,500 --> 00:05:03,870 bite received will be implemented by one right. 74 00:05:04,650 --> 00:05:08,340 And as we do this, we now need to receive only 10 bite. 75 00:05:08,340 --> 00:05:13,920 So we'll just be subtracting the bite received from our man maximum bite that we are expecting. 76 00:05:13,920 --> 00:05:14,790 That is great. 77 00:05:15,180 --> 00:05:18,820 And the data that can be stored in this area. 78 00:05:19,020 --> 00:05:19,300 Right. 79 00:05:19,320 --> 00:05:28,350 So each new element will be stored into the specific location of data with each new bite. 80 00:05:28,380 --> 00:05:36,240 We have our soon will be incrementing and then we will be touring the new element in the story. 81 00:05:37,380 --> 00:05:44,760 So once we complete this process, what we are doing is we are changing our operation back to the normal 82 00:05:44,970 --> 00:05:45,270 right. 83 00:05:45,270 --> 00:05:50,000 So once we do this now, we could just send the data that we have in. 84 00:05:50,000 --> 00:05:57,840 Then before that, we declare the various to the data that we receive to send the data to offensively, 85 00:05:58,110 --> 00:06:02,960 just to verify whether the redirect spending is matching to the data that we are receiving. 86 00:06:03,720 --> 00:06:09,150 So what we are doing, we are sending the first thing is setting up the border, OK, the respective 87 00:06:09,150 --> 00:06:12,870 border that you want to set, then changing the operating mode. 88 00:06:12,880 --> 00:06:15,690 So here we want to perform a loop back, OK? 89 00:06:15,780 --> 00:06:19,470 And for that, we have this macro, which we have added over here. 90 00:06:19,500 --> 00:06:21,930 Then we are sending the data, OK. 91 00:06:21,960 --> 00:06:25,800 We are waiting for a completion of our transmission. 92 00:06:25,860 --> 00:06:32,070 Then we are again giving an indication to any user that we have completed sending a data. 93 00:06:32,940 --> 00:06:40,030 OK, and then we are waiting for the 11 bytes to be received from our people. 94 00:06:40,080 --> 00:06:40,440 Right? 95 00:06:40,740 --> 00:06:47,790 So the function that will help, that will be helping us to receive the reader from the you. 96 00:06:47,790 --> 00:06:48,570 What is you? 97 00:06:48,570 --> 00:06:49,350 What is this? 98 00:06:49,500 --> 00:06:49,770 Right? 99 00:06:50,100 --> 00:06:50,340 Yeah. 100 00:06:50,340 --> 00:06:53,840 We just need to specify a buffer where we want to do the research read. 101 00:06:54,060 --> 00:06:58,590 And then this count should be dynamically updated as we receive the new details, right? 102 00:06:59,630 --> 00:07:06,050 So once we complete the respective account of the day that we want to receive from any what, we will 103 00:07:06,050 --> 00:07:11,660 be changing our operating mode back to a normal so that the leader we received, the the leader that 104 00:07:11,660 --> 00:07:16,930 we have in Buffalo could be sent to our council for verification and for that we are utilizing before 105 00:07:16,940 --> 00:07:17,710 look good. 106 00:07:17,840 --> 00:07:21,800 We already know that we have 11 bytes of data inside of buffer. 107 00:07:22,250 --> 00:07:28,850 OK, so we are sending what we are printing the data that we have in ready, right? 108 00:07:29,150 --> 00:07:35,120 So if you just perform an execution of this code, right, we already programmer FPGA let it just go 109 00:07:35,120 --> 00:07:37,580 ahead and try to perform an execution of this. 110 00:07:38,900 --> 00:07:43,430 So and to perform an execution of this goal, we have a computer sending data. 111 00:07:43,880 --> 00:07:44,220 OK. 112 00:07:44,240 --> 00:07:45,620 This is the message that we have. 113 00:07:46,310 --> 00:07:47,780 And then the Hallowe'en. 114 00:07:47,780 --> 00:07:51,110 So this is the same data that we are sending over here, right? 115 00:07:51,110 --> 00:07:59,330 So we are sending the reader that we have in an array data, which is lower and then we have the same 116 00:07:59,330 --> 00:08:02,000 data in our data receiver. 117 00:08:02,180 --> 00:08:02,460 Right. 118 00:08:02,540 --> 00:08:04,190 This is what we are printing more here. 119 00:08:04,640 --> 00:08:09,860 So this is how we could utilize the S.A.T. and we also understand. 120 00:08:10,890 --> 00:08:19,040 How we utilize the loopback more, OK, to send back the same data that we have to receive back seem 121 00:08:19,050 --> 00:08:21,210 data that you have transferring data and you are right. 122 00:08:21,450 --> 00:08:27,480 And this could be very helpful if we just want to develop the self checking function. 123 00:08:27,510 --> 00:08:33,600 OK, so we could randomly generate some data that we could sing and then we'll see you back the data 124 00:08:33,810 --> 00:08:36,030 and we'll just be performing the competition. 125 00:08:36,040 --> 00:08:43,740 So if data matches, whatever the data that you have seen is basically is what we are receiving in a 126 00:08:43,740 --> 00:08:44,010 loop. 127 00:08:44,700 --> 00:08:50,220 So this could be used to verify whether hardware is working functionally correct or. 128 00:08:50,490 --> 00:08:50,760 Right. 129 00:08:50,760 --> 00:08:53,280 So you could develop a function fed. 130 00:08:54,330 --> 00:09:01,280 You change the operating mood, then you generate some random data, send it to, yeah, you work and 131 00:09:01,290 --> 00:09:02,580 try to receive the data. 132 00:09:02,820 --> 00:09:09,000 So if the data is matches to the data that you have sent, you would see that hardware is working perfectly 133 00:09:09,000 --> 00:09:09,590 fine, right?