The Dynamics of Group Codes: Dual Abelian Group Codes and Systems

Fundamental results concerning the dynamics of abelian group codes (behaviors) and their duals are developed. Duals of sequence spaces over locally compact abelian groups may be defined via Pontryagin duality; dual group codes are orthogonal subgroups of dual sequence spaces. The dual of a complete code or system is finite, and the dual of a Laurent code or system is (anti-)Laurent. If C and C^\perp are dual codes, then the state spaces of C act as the character groups of the state spaces of C^\perp. The controllability properties of C are the observability properties of C^\perp. In particular, C is (strongly) controllable if and only if C^\perp is (strongly) observable, and the controller memory of C is the observer memory of C^\perp. The controller granules of C act as the character groups of the observer granules of C^\perp. Examples of minimal observer-form encoder and syndrome-former constructions are given. Finally, every observer granule of C is an "end-around" controller granule of C.Comment: 30 pages, 11 figures. To appear in IEEE Trans. Inform. Theory, 200

Computer Program for Assessing the Economic Feasibility of Solar Energy for Single Family Residences and Light Commercial Applications

Computer program, SHCOST, was used to perform economic analyses of operational test sites. The program allows consideration of the economic parameters which are important to the solar system user. A life cycle cost and cash flow comparison is made between a solar heating system and a conventional system. The program assists in sizing the solar heating system. A sensitivity study and plot capability allow the user to select the most cost effective system configuration

USAF NDE Program - Requirements for Technology Transition

The final session of our meeting is intended to be a change of pace with the express purpose of better focusing on the realistic aspects of the application of NDE in the field; practical problems and limitations, the requirements, potential and opportunities. Actually, Gerry Posakony did a good job of kicking off this end of the meeting subject last night with a discussion of his problem with the rather complex looking structures for which he has to develop operational inspection techniques

Structured optical receivers to attain superadditive capacity and the Holevo limit

When classical information is sent over a quantum channel, attaining the ultimate limit to channel capacity requires the receiver to make joint measurements over long codeword blocks. For a pure-state channel, we construct a receiver that can attain the ultimate capacity by applying a single-shot unitary transformation on the received quantum codeword followed by simultaneous (but separable) projective measurements on the single-modulation-symbol state spaces. We study the ultimate limits of photon-information-efficient communications on a lossy bosonic channel. Based on our general results for the pure-state quantum channel, we show some of the first concrete examples of codes and structured joint-detection optical receivers that can achieve fundamentally higher (superadditive) channel capacity than conventional receivers that detect each modulation symbol individually.Comment: 4 pages, 4 figure

Concatenated codes Technical report 440

Concatenation method for decoding of complex short code

Autonomous Flight Safety System Road Test

On February 3, 2005, Kennedy Space Center (KSC) conducted the first Autonomous Flight Safety System (AFSS) test on a moving vehicle -- a van driven around the KSC industrial area. A subset of the Phase III design was used consisting of a single computer, GPS receiver, and UPS antenna. The description and results of this road test are described in this report.AFSS is a joint KSC and Wallops Flight Facility project that is in its third phase of development. AFSS is an independent subsystem intended for use with Expendable Launch Vehicles that uses tracking data from redundant onboard sensors to autonomously make flight termination decisions using software-based rules implemented on redundant flight processors. The goals of this project are to increase capabilities by allowing launches from locations that do not have or cannot afford extensive ground-based range safety assets, to decrease range costs, and to decrease reaction time for special situations

Acoustic noise removal by combining wiener and wavelet filtering techniques

This thesis investigates the application of Wiener filtering and wavelet techniques for the removal of noise from underwater acoustic signals. Both FIR and IIR Wiener filters are applied in separate methods which involve the filtering of wavelet coefficients which have been produced through a discrete wavelet decomposition of the acoustic signal. The effectiveness of the noise removal methods is evaluated by applying them to simulated data. The combined Wiener wavelet filtering methods are compared to traditional denoising techniques which include Wiener filtering and wavelet thresholding methodshttp://www.archive.org/details/acousticnoiserem00fornLieutenant Commander, United States NavyApproved for public release; distribution is unlimited

Optimal and Efficient Decoding of Concatenated Quantum Block Codes

We consider the problem of optimally decoding a quantum error correction code -- that is to find the optimal recovery procedure given the outcomes of partial "check" measurements on the system. In general, this problem is NP-hard. However, we demonstrate that for concatenated block codes, the optimal decoding can be efficiently computed using a message passing algorithm. We compare the performance of the message passing algorithm to that of the widespread blockwise hard decoding technique. Our Monte Carlo results using the 5 qubit and Steane's code on a depolarizing channel demonstrate significant advantages of the message passing algorithms in two respects. 1) Optimal decoding increases by as much as 94% the error threshold below which the error correction procedure can be used to reliably send information over a noisy channel. 2) For noise levels below these thresholds, the probability of error after optimal decoding is suppressed at a significantly higher rate, leading to a substantial reduction of the error correction overhead.Comment: Published versio