Codex Corporation

About: Codex Corporation is a based out in . It is known for research contribution in the topics: Signal & Network packet. The organization has 189 authors who have published 241 publications receiving 32205 citations.

Systematic treatment of order-recursive least-squares algorithms

Abstract: In this paper we show that the order recursive least squares (LS) algorithms can be systematically studied as follows: (1) Determine various estimator structures (connection of basic building cells) based on the known properties of the input data vector and required output, and (2) Investigate possible realizations of time-updating and their properties implemented in the elementary cells. In view of this approach, we show that using a structure from (1) in combination with a time-update realization from (2) almost always forms a valid order-recursive LS (ORLS) algorithm. All known ORLS algorithms can be derived under a unified framework by using this approach. The properties of ORLS algorithms, such as computational complexity and sensitivity to the round-off error, can also be investigated in a systematic manner. This method not only simplifies the investigation of existing algorithms, but it also is powerful enough for creating new ORLS algorithms. These points will become clearer during the course of the development of this paper.© (1991) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Programmable logic array with delayed active pull-ups on the column conductors

Abstract: A programmable logic array operates with a single clock signal frequency which delays a control signal allowing time for the input signals to reach steady state on the column conductors of the AND-plane before enabling an active pull-up circuit to latch those column conductors left floating by the input signals. The control signal for the active pull-up circuit of the OR-plane is also delayed allowing time for the signals on the column conductors and row conductors of the OR-plane to reach steady state and provide glitch-free output signals. The propagation paths for the control signals are made slower than the worst case data path through the AND-plane and OR-plane to eliminate race conditions.

Systems and methods for behavior monitoring and identification

Abstract: Various embodiments herein provide system, method, and software solutions to facilitate not only timely, compliant monitoring of individuals housed within facilities, such as detention facilities, but also solutions that discover visible and latent behavior and mental conditions, among other potential issues that may be easily overlooked. Some embodiments focus on data collection and other embodiments focus on applying analytics to collected data to discover conditions and states of individuals, groups, a facility or portion thereof, staff, and procedures. Yet further embodiments include both data collection and analytic discovery. Some embodiments may also include messaging and other data processing and communication mechanisms implemented to facilitate compliance, safety, and monitoring accuracy.

Systolic arrays for implementation of order-recursive least-squares adaptive filtering algorithms

Abstract: Three systolic arrays suitable for implementation of order-recursive least-squares (ORLS) adaptive algorithms are considered. It is shown that they can be constructed using two types of elementary cells. A classification of systolic implementations of the ORLS adaptive algorithms is given by exploiting the possible variations of the elementary cells. The investigation of the array structures and variations of the elementary cells leads to a systematic approach to designing reconfigurable systolic arrays for implementation of ORLS algorithms. As an application of this approach, a novel least-squares (LS) lattice algorithm based on Givens rotations is derived. >

Decoding of lattices and codes

Abstract: Simplified decoding procedures based on trellis diagrams are given for lattices and codes. In one arrangement, for selecting a codeword near to a given N-tuple r, the codeword representing a point in an N-dimensional lattice, the N-tuple r comprising a sequence of N real values ri representing signals, the values r of the N-tuple r being organised into n sections r; respectively of lengths Nj, I ≦ j ≦ n, where n ≧ 3, and Nj < N, a decoder comprises at least first and second decoding stages. The first decoding stage comprises substages associated respectively with the sections rj, I ≦ j ≦n.Each such substage of the first stage comprises means for evaluating distances between multiple sets of possible partial codewords and the section rj, these partial codewords comprising the corresponding N of the symbols appearing in a subset of said codewords. Additionally, each first stage substage has means for selecting as a survivor from each of the multiple sets one of the partial codewords. The selection is based on the distances. Each substage also includes means for providing to the second decoding stage information indicative of each of the multiple survivors and its distance. The second decoding stage comprises n-I substages. Each such substage of the second stage corresponds to a supersection made up of a combination of two parts, each such part being a section or a supersection combined in an earlier substage of the second stage, a final such substage corresponding to a final supersection whose parts make up the complete N-tuple r. Each substage of the second stage except the final substage comprises means for evaluating distances between multiple sets of possible partial codewords and the received values in the corresponding supersection. This evaluation is based on the information indicative of survivor distances for the survivors corresponding to each of the two said parts. Each substage of the second stage other than the final substage also comprises means for selecting as a survivor from each of the multiple sets one partial codeword on the basis of the distances, and for providing information indicative of each of the multiple survivors and its distance to subsequent decoding substages of the second stage. The final substage comprises means for evaluating distances between said codewords and the N-tuple r. This evaluation is based on the indications of survivor distances for survivors corresponding to each of two of the parts. The final substage also includes means for selecting one codeword as a finally decoded codeword based on the distances between codewords and the N-tuple r, and for providing information indicative of the finally decided codeword as an output of the decoder.