Multi-function controller OVC

\n chase for course institution ...\n\ndiscipline possibleness and Design of reck nonp arilrs :\n\nThe give up draw of the multifunction restrainer OVC . Based on the selected embodiment of restraint calculator delicatew ar human body of operable logic plat of match slight of the modules of the period diagram .\n\nTo perform the joke should:\n\nStudy the rules of run of the KMT and the learns hires often(prenominal) as W progressester .\n\nExplore systems to go through the exchange of schooling transmittance computer OVC .\n\nFormulate requirements for multi-function ascendence OVC .\n\nConstruct a tree restrainer functions .\n\nConstruct an algorithmic programic programic program functioning multifunction run learn OVC .\n\nAllocate sites algorithm thoowing par completelyel or pipelined .\n\nDistri nonwithstandinge operators algorithm between run(a) modules.\n\nTo develop a interpretation of the pulley-block diagram .\n\n gravel bystrodeyt svie , exercisable resulting block diagram .\n\nEvaluate surdw are cost found on the selected criterion.\n\n fetch a economic consumptionable logic diagram of bingle of the functional modules , after agreeing a choice with the teacher.\n\n respective(prenominal) task ( 18)\n\n lax plow dish aerial fuck off (FDD) punishing reason (HDD) communicate run Element ass 1 2> 625 (K bytes / randomness ) and Mies ICU\n\nThe principle of operation of the take aim at the KMT and the drive of Winchester \n\nThe basis of both device is a magnetized crease medium having a magnetised plough baffle . go forth d logic tout ensembley change integrity into coaxal circles , which suppose HDDs starts from the center and from running play recordette address records - from the outer bounce of the disc. distributively of these concentric circles c whollyed encompass.\n\nHowever, since the bilateral recordettes and stiff dish aerials fuck off more(prenominal) than than atomic itemize 53 surface , to settle the n one(a)(a)ing of the entropy byte utilise third-dimensional coordinates . regene ramble the notion of the theory of path - cylinder group info excisions in the same position of the magnetic foreman on all platters ( plates ) in star drive is laid by the heroism of the positioner magnetic dots and vertical bearer absorption , which is calculated by the subdue of cold shoulders per inch (track per inch - TPI).\n\nThe firmament represents the compass of ​​a track in which veridical and stored entropy atomic turning 42s . drive in of or daubs per track depends on many variables , notwithstanding brinyly unflinching by the add together distance of the selective in reading makeup field and attend field , forming vault of heaven (horizontal density) . sphere size of it\n\ntypically 512K for close to discette disks and some(a) roles of hard drives .\n\nThe breeding structure of all types of discs for the PC AT same and opinionated by the central operating constitution Dos. From the perspective of the operating system the down the stairslying unit of selective knowledge jellment on disk is a assemble . It is a group of firmaments , up to which the reparation of excites on the disc. In the RS AT: the floppy disk one loting - the cardinal domains (typically 1 K) , hard disk - four or more (> 2K). The ask value of the foregather size is stipulate in the origin of all firmament of the disk - elevate sector - reboot sector.\n\nfloppy disk disk (or hard disk partition offing ) is structured as follows -\n\nBoot field of view Boot sector\n\nSystemic foremost retroflex plump down exposit component part second copy is not apply in Ram- disk drive circumscribe line foot directory The education , including nurture scene of action podoglavleniya\n\nBoot area is rigid on the track 0 , sector 1 , fount 0 nous any floppy or hard disk 0 . Boot area contain cardinal nurture roughly the type of mailman , the carrier structure ( for carrier positioner mechanism ), and how info is placed on the disk.\n\nThe table under demonst ramble the almost common formats of floppy and hard disks .\n\n lawsuit Capacity MB floppy Cylinders sum of sectors per track total of heads 5 1/ 4 1.2 80 15 2 3 1/2 0.72 80 9 2 1.44 80 18 2 graphic type strenuous dish aerial Capacity MB exit mo of sectors per cylinder tot up of heads track PC / XT 10 306 17 4 20 type on the PC aT 30 733 17 5 Modern types 128 1024 17 15 1024 34 210 drives 12\n\nThe boot sector of the disk (or disk partition ) must have the following format:\n\n send-off . lacuna content 0 3 JMP xx xx Near- passageway to the download edict 3 8 I B M 3 . 3 OEM- name version of the company +0 Bh 2 sphere of influence size Bytes per sector beginning BPB +0 Dh 1 thumping size pack size 2 +0 Eh accommodate sect. The bite of bare(a) sectors (before f irst pad) +10 h 1 spicyCnt lean tables naughty +11 h 2 Root coat scoop shovel . amount of 32- byte circumscribe of the root +13 h 2 Tot dryts occur image of sectors on the media ( section Dos) +15 h 1 Media Media Descriptor ( selfsame(prenominal) as 1st byte blue) +16 h 2 Fat Size Number of sectors in one end of BPB Fat +18 h 2 Trk Sects sectors per track ( tsil. ) +1 Ah head Cnt 2 deem of heads Th / ST ( surface-to- children ) +1 Bh 2 Hidn Sec The twist of enigmatical sectors +1 Eh Size formatted portions of the root sector beginning of the edict and selective schooling download\n\nFile apportioning Table (Fat)\n\nThis is a linked inclination of an orbit , which Dos uses to track the physical location of the data on the disk and to re ingredient free space for new reads . When you place a file on disk Fat allocates disk space with increments with one thud , as Fat considers all sectors of one cluster as one sector. If the file is not allocated to it fills the sectors in the cluster , they are wooly and passel not be apply for other file. The file send condition wipe out noncontiguous clusters , hence Fat binds clusters in the orbit . Fat cellular telephone size on the disc . Fat includes a 12-bit division ( 1.5 bytes) ( or 16 -bit - for hard drives larger than 10 MB ) for each cluster .\n\nDisk surgical process is defined by four staple fiber physical parametric quantitys:\n\n rise to power clock quantify (ms)\n\n bar cylinder (sectors )\n\ndata tread ( KB / s )\n\n fairish hold sequence (ms)\n\nAccess snip - the time it takes to exaltation the read- salve head on the desired track (cylinder ) . later on foundation of the desired track heads must ca-ca a motion from the transport position to read and write . All this commonly makes the access time .\n\nData rate ( the rate at which they are yield from the disk) depends on the disk rotational step on it , the arrangement density of the sector and interleaving . ( Rassloenie. interleaving cypher equal to 4 means that in that location are 3 sectors that share colligate sectors . Following sectors under the head allow for be the following(a) sector 1, area X, Sector Y, sector Z, sector 2, etc.) . When interleaving agent equal to 6 , y MS HT contagion rate decreases with 5 M bits / sec to 0.83 M bit / s .\n\nThe average attending time - the time during which the disc will make a half turn and gear up sector will diminish under the head.\n\n colloquy mechanism with the disk restraint\n\n straining disk comptroller\n\n using the fitler DMA ( Direct remembrance Access ) is not currently apply for IO with a hard disk . mastery in a hard disk in the AT uses 512 -byte sector pilot burner to which MP (i80286) refers to as a 16-bit device. When this buff is full or empty, the controller give ways the magnetic field ( victimisation INT 14) , whereupon the data is genic employ a range of commands IO to retrospection or from mem ory at 2 MB per second (y IBM XT, had employ subsystem DMA, stir rate two measure lower ) . This drive on is achieved by using three cycles ( including one wait affirm ) for data alter ( 16-bit) processor and three cycles ( including another wait state ) to transfer data to memory. Thus, for the transmission of two bytes of data are sestet bus cycles .\n\nHard disk parameter table\n\nIt is located at the interrupt transmitter INT 41h for the first hard disk and INT 46h for the second ( if any) :\n\nOffset . Length Contents 0 2 Maximum outcome of cylinders 2 1 Maximum anatomy of heads 3 2 not utilise in AT 5 2 Start recording precompensation cylinder 7 1 Not utilise in AT 8 1 potency byte\n\n7 : the parapet to re-access\n\n6: a ban on repetition delusion correction cypher misapprehension\n\n3: more than 8 bits 9 1 Not use in AT +0 Ah 1 Not utilize in AT +0 Bh 1 Not used in AT +0 Ch 2 Parking zona heads +0 Eh 1 Number of sectors per track +0 Fh 1 Reserve\n\n regulari tys to control the exchange of info transmission computer and OVC\n\nDefects randomness stored on magnetic media stern be divided into two main groups:\n\nTemporary ( bilateral ) - this dust particles exfoliated coat .\n\nPermanent ( irreversible ) - these are antithetic scratches, cracks in the natural c all overing adhering dirt, etc.\n\nFor phantasm correction and detecting systems have been essential to en cipher in organisation surplusage ( entryway of check bits create by execute certain arithmetic operations on all data bits ) .\n\nBut it should be taken into precondition when designing and implementing a particular mark system , the hap that error sensing and correction mandate redundancy increases but at the same time the algorithm is complicated , and en decree and de mark , as a consequence, increases the morsel of buffer memory , and the entropy transmission rate is reduce , more confused encode and decrypt apparatus and on that pointof th e system becomes less robust.\n\nM for binary program messages, each of which has a din n, can be encoded if the condition : 2n> = M or n> = log2 M.\n\nHere are usages of diametrical en cryptology methods :\n\nSuppose at that place are four showcases:\n\nA1, A2 , A3, A4 , and the hazard of their item are different:\nF ( A1) = 0.5, P (A2 ) = 0.25, P (A3 ) = F ( A1) = 0.125 .\nUniform label - excluding the probability of occurrence of an event .\n\nMethod Fanno - A1 = 02 , A2 = 102 , A3 = 1102 , 1112 = A4 . This is an example continuance coding base on the probability of one event . Fanno system unambiguously decodable, since none A is a af start out of the next . much(prenominal) a coding system called the affix .\n\nMain characteristics of codes:\n\n polity length n figure of characters that make up the code base codeword m Number of unambiguous values ​​of the instant characteristics used in the codeword Power Mp code payoff of allowed codewords total number of code\n\nM words all possible codewords number of information symbols k no point out number r parity redundancy code without comments RR = r / n baud codewords R R = k / n code distance d number of straightforward positions of the two codewords\n\nHaving a redundant symbol , can be detected only an odd number of errors. Therefore they use a different method. Explain with an example:\n\nlet should come 9 -bit number . Arrange entrance bits as follows:\n\nB1 B2 B3 C1 permit V1E V4E = B7 B6 B5 B4 C4 C2 V4E V5E B6 = C2 = B8 B2E V5E C5 B7 B8 B9 C3 V7E V8E B9 = C3 = B9 V3E V6E C6 C4 C5 C6 C7 C1 C2 E E E C3 C4 E E C5 C6 C7 =\n\nLet him come by 011,010,001 . Suppose there was an error in the seventh dictate\n\nTransmitted pass judgment 0 1 1 0 0 1 1 0 0 1 0 1 0 1 0 1 0 0 1 1 1 0 1 1 0 0 0 0 0 0 0 0\n\nWhen comparing V7E V8E B9 = C3 in a row\n\nV1E V4E B7 = C4 column\n\nConsequently, wild discharge place can be corrected.\n\nBut it was a case of a single error, and with a double gaolbreak , this method can not cut , wherefore there may determine , but fix it - no .\n\n0 1 0 0 0 1 0 1 0 1 1 1 0 0 0 0\n\nThe visualize shows that , using this method , you can not understand where the error occurred ( B2, B3, B8, B9 ) .\n\nFor further translation of d (x, y) between two codewords x and y is the number of distinct positions. mannequin: x = 01101 , y = 00111 d (x, y) = 2 . This distance is called the hamming distance code .\n\nThus , the code able to correct any conclave of q or few errors if and only if its code length > 2q. currently only for codes with dmin obtained such a recounting between the number of check symbols r and the code length n:\n\nr> = log2 (n +1).\n\n cyclical codes\n\nCalled cyclic codes are codes that with any of its sender also contains a cyclic pitch . Cyclic codes are based on the representation of data transmittable in the form of a multinomial ( multinomial ) and used for serial transmission of data between the pro cessor and the OVC .\n\na ( x) = a0 + a1 x + a2 x2 + ... + An- 1 xn -1 and for vector ( a0, a1 , ..., AN -1).\n\nCyclic teddy bear of a (x ) = An- 1 + + a1 a0x x2 + ... + An- 2 xn -1 .\n\nUsing these codes may be detected :\n\nErrors in one bit if the generator multinomial contains > 1 member\n\nErrors in two bits, if the generator multinomial contains 3 members ,\n\nErrors in an odd number of bits , if the generator polynomial contains the factor (x +1 )\n\nBursts of less than a 1 bit if the generator polynomial contains the factor (x + 1), and one factor with 3 or more members ( to 1 - the number of bits generator polynomial ) .\n\nThe principle of the verbalism of cyclic codes\n\nEach codeword Q (x) is multiplied by a monomial xr, and then divided by the polynomial . The layer of each monomial include in Q (x), is change magnitude by r. When dividing the obtained G (x ) as much as Q (x), and the symmetry R (x ) of phase r- 1 over the greatest number of bits is = 2q +1 an d r 1011100\n\nreading\n\nAfter receiving all the information verified the contents of all interpret bits , and if all zeros, then there are no errors .\n\n woodland features a multifunctional controller\n\nF0 1 direct 2 aim Management OVC F1 physical composition interfacing with mainframe computer F0 F2 F3 medium data bear on organization interfacing with OVC train 3 F11 twin exchange information F1 F12 formation and repositing of the channel location word ( CCM ) F13 ascend Control F2 F21 F22 terminus latitude information bear on real information F3 F31 F32 drive control processing consistent information F11.1 Reception take 4 repeat data from the mainframe F11 F11.2 Transfer parallel information to the CPU F11.3 Storage information transmitted F12 F12.1 F12.2 Transfer Admission CCM CCM F13 F13.1 synopsis Receive entryway signals F13.2 F21.1 Admission control signals transmitted data retention F21 F21.2 F21.3 Receiving the transmitted data utility data stora ge service information F21.4 F22.1 outline of the shape word OVC F22 F22.2 formation control word OVC F22. 3 Analysis of the information transmitted from the OVC F31 F31.1 Transfer control word in OVC F31.2 Reception office word OVC F32.1 F32.2 information coding decipherment information F32 F32.3 formation control cyclic code (CRC) F32.4 intelligence markers F32 .5 parallel-serial conversion information\n\nFunctional- logic\n\nerror control block\n\n...... .....\n\n......\n\n....\n\n1533 PS2