International Telemetering Conference Proceedings / October 27-30, 1997 / Riviera Hotel and Convention Center, Las Vegas, Nevada / The system throughput capacities of modern data systems exceed the bit rate capacity of current range telemetry capabilities. Coupling this with the shrinking spectrum allocated for telemetry results in a serious problem for the Test, Training, and Space telemetry users. Acknowledging this problem, the Department of Defense (DoD) has embarked on an aggressive improvement and modernization program that will benefit both the government and commercial range providers and users. The ADVANCED RANGE TELEMETRY (ARTM) program was created and funded by the Central Test and Evaluation Investment Program (CTEIP) under the Office of the Secretary of Defense, Undersecretary for Acquisition and Technology to address this problem. The ARTM program goals are to improve the efficiency of spectrum usage by changing historical methods of acquiring telemetry data and transmitting it from systems under test to range customers. The program is initiating advances in coding, compression, data channel assignment, and modulation. Due to the strong interactions of these four dimensions, the effort is integrated into a single focused program. This paper describes the ARTM program and how academia research, emerging technology, and commercial applications will lay the foundation for future development.

<p>This thesis addresses the rate-distortion optimal packetization (RDOP) of embedded bitstreams into independent source packets for the purpose of limiting error propagation in transmission over packet noisy channels. The embedded stream is assumed to be an interleaving of $K$ independently decodable basic streams. The goal is to partition these basic streams into $N (N</p> <p>The RDOP problem previously formulated by Wu \emph{el al.} focused on finding the partition that minimizes the distortion when all packets are decoded. The authors proposed a dynamic programming algorithm which worked under both high bit rate and low bit rate scenarios. In this thesis, we extend the problem formulation to finding the partition which minimizes the expected distortion at the receiver for a wide range of transmission scenarios including unequal/equal error/erasure protection and multiple description codes. Then we show that the dynamic programming algorithm of \citep{DBLP:journals/tmm/WuCX01} can be extended to solve the new RDOP problem.</p> <p>Furthermore, we propose a faster algorithm to find the globally optimal solution based on the divide-and-conquer technique, under the assumption that all \emph{basic} streams have convex rate-distortion curves. The proposed algorithm reduces the running time from $O(K^{2}LN)$ achieved by the dynamic programming solution to $O(NKL\log K)$. Experiments performed on SPIHT coded images further validate that the speed up is significant in practice.</p> / Master of Applied Science (MASc)