Showing papers by "National Security Agency published in 1976"
[...]
TL;DR: Several properties of the graph-theoretic complexity are proved which show, for example, that complexity is independent of physical size and complexity depends only on the decision structure of a program.
Abstract: This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity. The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to illustrate the correlation between intuitive complexity and the graph-theoretic complexity. Several properties of the graph-theoretic complexity are then proved which show, for example, that complexity is independent of physical size (adding or subtracting functional statements leaves complexity unchanged) and complexity depends only on the decision structure of a program.
5,097 citations
01 Apr 1976
TL;DR: The real time implementation of a Linear Predictive Coding algorithm that has been developed over the past five years is described, using a modification of the Covariance Method for the analyzer and the system for pitch extraction and smoothing.
Abstract: This paper describes the real time implementation of a Linear Predictive Coding algorithm that has been developed over the past five years. The algorithm chosen for the analyzer is a modification of the Covariance Method introduced by B. S. Atal [1],[2] of Bell Labs. The system for pitch extraction uses a minimum distance function correlation technique. A dynamic programming algorithm [3] is used for pitch smoothing and correction of isolated pitch errors. The synthesizer uses a transversal filter. Considerable time has been devoted to optimizing the running time and integer scaling of the different algorithms for real time implementation on a 16 bit mini-computer.
17 citations