Need help with my Hardware Software assignment to develop Automatic control system

Question - Course Title : Hardware Software Co-deignTa s k 1 Write the specification of LOAD MOVER(detailed of the whole design and precise for automatic control section). Requirement : 1.It should be able to move 35 kgs. 2.It can be operated wirelessly, manually and automatically. 3.It can detect hindrances and take decision to avoid them. 4.It can store a map of 2 x 3 points to move on automatically.(A, B, C, D, E, F) 5.Map can be updated by serial port. 6.It can take snap of each load and store it in SD card. 7.It can climb a slope of 4 feet. 8.The weight panel should be around 1.5 x 3 feet. 9.It can talk to the customer and respond to fixed five questions. 10.It should run on battery (battery charger). 11.Decide the Processor/ASIC/ ...Read More ASIP/SOC/FPGA . 12.Divide the design into various modules. 13.Is the kernel required if yes which one? 14.Does the project has real time features. 15.Which class of SOC is suitable ? 16.What memories are required ? (SRAM/SDRAM/FLASH/EEPROM) 17.What does be the size of the memories ? 18.Engine control section 19.Wireless control section 20.Automatic control section 21.Weight sensor and Infrared sensor 22.Camera interface 23.Card reader section 24.Audio interfacing section 25.Battery charger section 26.Write the specification document for each section per group.   Design the Automatic control section using Statecharts using Stateflow and Simelectronics tool box.

Automatic Control System The aim of this project is to design an embedded system which can move loads from one place to another. The system can be operated manually, automatically and wirelessly. Rough Specification: 1. Maximum Weight: Maximum load on the system should not exceed 35 kg. 2. Maximum speed: of the system should not be more than 10kmph 3. 90 degree turns: It can make 90 degree turns easily 4. Inclination of slope: must be less than 25 degrees. 5. The system has to detect any obstacle in its path and should stop in advance of 50cm. 6. Dimensions: The dimensions of the system is 60cmx60cm. 7. There shouldn’t be any link to off-board computers. 8. The vehicle can use on-board memory to its advantage. Task 3 Write a SystemC/C++ program for Bus Arbiterallocate the control of the shared system bus to one master at a time depending priority. The device can support three bus masters and three slaves. It can accept bus request signals from bus masters and depending on the priority it can give bus grant signal to one of the master. The device has fixed priority. Each transfer takes five cycles at a time one master and slave communication occurs. component.

are not available. . F(a,b,c)= ∑(0,1,3,4,6,7); (3) Q2. Implement the Boolean function given below using minimum number of function generators (F, G) of XC2000. Draw the K-maps for the function and write the expression. combinational. (3) size. (3) F1(X,Y,Z)=Σ(1,4,5,7) F2(X,Y,Z)=Σ(0,2,5,6) Q4. Write the verilog code for the serial adder element given below (6)

(5) Course Title : NETWORK EMBEDDED APPLICATION

Q 1. Select a route by using LD, LC, DCUR heuristic and RDM heuristic for a call R whose specifications are R =(1,A,F, B,12) . Cost and delay values are specified in the brackets for the respective links. Compare the results. Assume that the call satisfies the bandwidth test (2,5) (5,2) (2,1) E B (3,2) (2,4) G (3,3) (3,2) (1,3) (1,2) (1,3) A F (2,2) H Q 2. a) An incomplete VTCSMA-L transmission status table for ή = 2 and transmission time equal to 20 is given below. Find how many calls can be sent and at what time? Show the working of LDCR and MDCR protocol on the given message set. For nodes Ni (arrival, slots, deadline) :{(4,3,30), (2,2,6), (0,1,2), (3,4,7), (5,4,16), (16,3,23)} A set of six tasks with backup copies is to be scheduled by using Myopic algorithm with some distance. Find that distance with which the tasks are feasibly scheduled. NodeRC at arrivalDMLMRC at Transmission12288210402031256364186848524866664010282

Draw schedule also. If the set of tasks given in Q 3 a) is scheduled on three processors using The Backup Overloading Algorithm, how much time do you save? ************* 1.Answer following questions in short and to the point only. (a)What are the strategies, kernel chooses for handling aperiodic and sporadic jobs? (b)What are the advantages of modular programming in RTS ? (c)How redundancies are provided in preventive type of fault-tolerant systems? (d)Discuss in short, advantages and disadvantages of static and dynamic memory allocation. (e)Why semaphores are important in RTOS? 2.A s y s t e m o f f o u r t a s k s T1 = (4,1), T2 = (10,2), T3 = (12,2) T4 = (30,3) is scheduled with executive cyclic clock driven scheduling algorithm. A stream of sporadic jobs arrives as follows, Si = {(2,2,16) ;(18,4,32); (18,3,28)} (a)Schedule these sporadic jobs applying acceptance test. (b)Draw neat schedule up to 10 frames showing accepted sporadic jobs scheduled. 
Task TiridiciT10206T20258T34305T46405T58504T68506

3.A s y s t e m o f f i v e p e r i o d i c t a s k s Ti {(5, 1); (7, 1); (8, 1); (12, 1.5); (25, 4)} is found to be schedulable using RMA. Now find out the maximum value of context switch ‘CS’, such that the system remains schedulable. 4.A set of hard real-time periodic tasks need to be scheduled using RMA. The following table contains the details of these tasks and their use of shared resources. Can all the tasks meet their respective deadlines when priority ceiling protocol is used for resource scheduling? Use Petri Net for 2x2 matrix multiplication. Write all the places and transitions clearly. Write firing table also. Course Title : Digital Signal Processing Q.1 Design a digital Chebyshev-II filter that satisfies the following constraints |H(ω)| ≤ 0.2, for 0.6π ≤ ω ≤ π (15M) Q.2 The frequency response of an FIR filter is given by Ta s k Pi ei R1 R2 R3R4R5T1 50 15 6 7 --103T2100 25 -- -- --8--T3150 40 4 14 8 --10T4200 35 -- -- ------T5250 50 6 11 --97

H(ω) = e-3jω (1+1.8cos3ω+1.2cos2ω+0.5cosω) Determine the coefficients of the impulse response h(n) of the FIR filter. (5M) specifications: Passband : 0.30-0.50 (normalized) Transition width : 0.05 (normalized) Stopband Deviation : 0.02 Passband Deviation : 0.01 (i) Sketch the tolerance scheme for the filter. (ii) Express the filter bandedge frequencies, assuming a sampling frequency of 5KHz and the stopband and passband deviations in decibels. (5M) Explain the various FIR Filter design methods. (15M) Determine the Z-transforms and sketch the ROC of the following signals. (a) 
 # (b) 
 # (c) x3(n) = x1(n-4) x4(n) = x1(-2n) (10M)

# Using the radix-2 decimation-in time and decimation-in frequency algorithms. (15M) x1(n) = {1,2,3,4} x2(n) = {5,6,7,8} using DFT - IDFT method (15M) Consider an FIR lattice filter with coefficients K1=0.5, K2= -0.45, K3=0.6. (a) Find its impulse response by tracing a unit impulse input through the lattice structure (b) Draw the equivalent direct form structure. (15M) a(t) is band limited to the range 150 ≤ F ≤ 750 Hz. It is used as an input to the system shown in fig below. In this system, H(w) is an ideal low pass filter with cutoff frequency Fc =250 Hz. Determine and sketch the spectra for the signal x(n), w(n), v(n) and y(n). (15M) shown in fig. 3 3x(n)y1(n) 5 5x(n)y2(n)

(b) For what values of D and I, the systems are identical in general. (15M) Prove the equivalence of the two decimator and interpolator configurations shown in fig. (15M) Q.12 Discuss briefly on each of the following concepts using diagrams. (a) SHARC Architecture (b) Pipelining and parallel processing (c) MAC Unit (d) Special instructions (e) Data and program memory (10M) corrupted by noise x(n) = d(n)+w(n), where rw(k) = 0.25δ(k) and rdw(k) = 0. The signal d(n) is an AR(1) process that satisfies the difference equation d(n) = 0.25d(n-1)+v(n), where v(n) is the white noise with variance =1. Assume that w(n) and v(n) are uncorrelated. (a) design a first-order FIR linear predictor w(z) = w(0)+w(1)z-1 for d(n) and find the mean square error ξ = E{[d(n+1) - d(n+1)2]}. (10M) ≡H(ZD) D DH(Z)x(n)y(n)x(n)y(n) DH(Z)x(n)y(n) H(Z) Ix(n)y(n)≡ IH(ZI) x(n)y(n) ...Read Less

Solution Preview - No Solution Preview Available

Original Question Documents

N/A