Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/8966
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPant, Anant Kumar-
dc.date.accessioned2014-11-18T07:06:16Z-
dc.date.available2014-11-18T07:06:16Z-
dc.date.issued1968-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/8966-
dc.guideLal, Manohar-
dc.description.abstractThis di sortation deals with the opts design of non'» linear filter" for discrete level prose ses. A design procedure, based on statistical deoi,ion theory, is evolved for aero and finite-memory discrete level grope*see. The procedure is illnat-rat d with the help of suitable examples» It is shown that the design can be easily carried out using simple etching devices. An important feature of the design procedure is that it can conveniently be ado ated for a very wide range of optimality criteria including even the graphical form as the loss function. The procedure is equally applicable even for the case *en signal and not*s are not additive. Certain practical applications of the results obtained, have been discussed in detail. In partic ar# very interesting results are obtained as a result of application of the results to telemetry, system protection$, radar traces, and Markov chain procesees4 The Importance of the results obtained from statistical decisfon theory is furth r illustrated by pointing out their applications in so many apparently different field* where optimum dec .sides have to be takenen_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.titleAn Optimum Design of Discrete Nonlinear Filtersen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number105290en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD105290.pdf2.83 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.