Architectural, Parallelism, and Resynchronization Issues in Sequential Decoding
{'Code': '05010700', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Dwight D. Fisher', 'PO_EMAI': None, 'PO_PHON': None}
The research aims to improve the architecture of sequential                decoders of both the ZJ Stack and Fano types, to exploit code                   parallelism for increased decoder speed and performance, and to                 establish an objective basis for the jump-ahead resynchronization               method often used in continuous sequential decoders.  Pipelining,               branch order and metric increment mechanizations, and a unique                  "file-drawer" memory for ZJ decoders are among the architectural                issues to be investigated.  A computer search using the San Diego               Supercomputer will be made to find good convolutional codes of                  rate m/n where n is moderately large and not necessarily                        relatively prime to m.  The resultant codes will be used in an                  investigation of decoder features that permit this intrinisic                   parallelism to be exploited.                                                         Acceptable compromises in providing partial branch metrics                 and rank order for decoders operating in a multiple-branch-per-                 node mode will be studied through an anlysis of the impact on the               exponental bound parameter, RO.  To determine the optimum size of               jump, the resynchronization method will be studied by simulation                using a specially constru>ted trial encoder circuit board.  A                   related analysis of the optimum constraint length of decoders                   will be made based on t>e tradeoff between undetected error                     probablility and the error event span during resychronization.                  The research will result in improved performance of this                        important constituent of many modern telecommunication systems.
{'FirstName': 'Jay', 'LastName': 'Harris', 'PI_MID_INIT': 'H', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Jay H Harris', 'EmailAddress': None, 'NSF_ID': '000165368', 'StartDate': '09/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'San Diego State University Foundation', 'CityName': 'SAN DIEGO', 'ZipCode': '921821901', 'PhoneNumber': '6195945731', 'StreetAddress': '5250 CAMPANILE DR', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'California', 'StateCode': 'CA', 'CONGRESSDISTRICT': '51', 'CONGRESS_DISTRICT_ORG': 'CA51', 'ORG_UEI_NUM': 'H59JKGFZKHL7', 'ORG_LGL_BUS_NAME': 'SAN DIEGO STATE UNIVERSITY FOUNDATION', 'ORG_PRNT_UEI_NUM': 'H59JKGFZKHL7'}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '409600', 'Text': 'COMMUNICATIONS RESEARCH'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8709194.xml'}