Sunday, November 15, 2015

Adaptive radar resource management



Radar Resource Management (RRM) is vital for optimizing the performance of modern phased array radars, which are the primary sensor for aircraft, ships, and land platforms. Adaptive Radar Resource Management gives an introduction to radar resource management (RRM), presenting a clear overview of different approaches and techniques, making it very suitable for radar practitioners and researchers in industry and universities.
Coverage includes:
  • RRM’s role in optimizing the performance of modern phased array radars
  • The advantages of adaptivity in implementing RRM
  • The role that modelling and simulation plays in evaluating RRM performance
  • Description of the simulation tool Adapt_MFR
  • Detailed descriptions and performance results for specific adaptive RRM techniques
  • The only book fully dedicated to adaptive RRM
  • A comprehensive treatment of phased array radars and RRM, including task prioritization, radar scheduling, and adaptive track update rates
  • Provides detailed knowledge of specific RRM techniques and their performance
Adaptive Radar Resource Management, 1st Edition | Peter Moo, Zhen Ding | ISBN 9780128029022
UC San Diego /Adaptive radar resource management / Peter W. Moo, Zhen Ding
Adaptive Radar Resource Management - ScienceDirect
Table of Contents Adaptive Radar Resource Management, 1st Edition
  • 1. Introduction
  • 2. Overview of RRM Techniques
  • 3. Comparison of Adaptive and Non-adaptive Techniques
  • 4. Adaptive Scheduling Techniques
  • 5. Radar Resource Management For Networked Radars
  • 6. Conclusions
  • Bibliography

Key Features


  • The only book fully dedicated to adaptive RRM
  • A comprehensive treatment of phased array radars and RRM, including task prioritization, radar scheduling, and adaptive track update rates
  • Provides detailed knowledge of specific RRM techniques and their performance

Description


Radar Resource Management (RRM) is vital for optimizing the performance of modern phased array radars, which are the primary sensor for aircraft, ships, and land platforms. Adaptive Radar Resource Management gives an introduction to radar resource management (RRM), presenting a clear overview of different approaches and techniques, making it very suitable for radar practitioners and researchers in industry and universities.
Coverage includes:
  • RRM’s role in optimizing the performance of modern phased array radars
  • The advantages of adaptivity in implementing RRM
  • The role that modelling and simulation plays in evaluating RRM performance
  • Description of the simulation tool Adapt_MFR
  • Detailed descriptions and performance results for specific adaptive RRM techniques

References:

  1. Z. Ding. A survey of radar resource management algorithms. In Electrical and Computer Engineering, 2008. CCECE 2008. Canadian Conference on, pages 001559-001564, May 2008.
  2. S. P Noyes. Calculation of next time for track update in the mesar phased array radar. In IEE Colloquium on Target Tracking and Data Fusion, pages 2/1-2/7, 1998.
  3. G. B. Dantzig. Recent advances in linear programming. Management Science, 2:131-144, 1956.
    [CrossRef] 
  4. A. J. Orman, C. N. Potts, A. K. Shahani, and A. R. Moore. Scheduling of tasks in phased array radar. European Journal of Operational Research, 90:13-25, 1996.
  5. S. L. C. Miranda, C. J. Baker, K. Woodbridge, and H. D. Griffiths. Comparison of scheduling algorithms for multifunction radar. IET Radar Sonar Navig., 1(6):414-424, 2007.

Zhen Ding

Zhen Ding - ResearchGate
  • Zhen Ding; Hong, L., "Development of a distributed IMM algorithm for multi-platform multi-sensor tracking," in Multisensor Fusion and Integration for Intelligent Systems, 1996. IEEE/SICE/RSJ International Conference on , vol., no., pp.455-461, 8-11 Dec 1996
    doi: 10.1109/MFI.1996.572217
    Abstract: In this paper, a distributed interacting multiple model (DIMM) algorithm for multi-platform multi-sensor tracking is presented, where the overall target model space is decomposed into all platforms. Each platform contains only a model subset, and interacting multiple model filtering is performed on all platforms. By exchanging some moderate filtering results through a platform communication datalink, a distributed interacting multiple model algorithm can be obtained. Since the DIMM has the advantages of distributed models and distributed measurements as well, significant computation can be saved and good performance can be achieved
    keywords: {Monte Carlo methods;filtering theory;sensor fusion;tracking;communication datalink;distributed interacting multiple model algorithm;interacting multiple model filtering;multi-platform multi-sensor tracking;Bandwidth;Bayesian methods;Distributed computing;Filter bank;Filtering algorithms;Merging;Missiles;Sensor fusion;State estimation;Target tracking},
    URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=572217&isnumber=12289

    Sergey, L.; Hubbard, O.; Zhen Ding; Ghadaki, H.; Jian Wang; Ponsford, T., "Advanced mitigating techniques to remove the effects of wind turbines and wind farms on primary surveillance radars," in Radar Conference, 2008. RADAR '08. IEEE , vol., no., pp.1-6, 26-30 May 2008
    doi: 10.1109/RADAR.2008.4721114
    Abstract: In the past decade many countries have launched programs to deploy wind turbines as alternative sources of electrical energy. When deployed in wind farms this technology has raised concerns from both air traffic control (ATC) and military authorities. This is due to the fact that the turbine blades return radar echoes that have the potential to distract and confuse the air traffic picture by creating false detections that can effectively mask genuine aircraft returns. Most of the mitigation solutions offered today are either primarily based on such measures as range-azimuth gating or inhibiting track initiation in the vicinity of wind farms. These draconian measures can result in a significant degradation in radar performance and potential air traffic control disruption. They may also require costly redesign of the existing radars. This paper presents a set of 'clean' solutions that mitigate, and in some cases completely eliminate the effect of wind turbine returns. The solution is based on the combination of discrimination techniques applied at the pre-detection, detection and post detection stages of the radar signal processing chain. The suit of mitigation solutions developed does not adversely affect aircraft detection, and can be readily retrofitted to the existing ATC primary surveillance radars (PSR).
    keywords: {air traffic control;interference suppression;radar signal processing;search radar;signal detection;wind turbines;air traffic control;constant false alarm rate;interference mitigation;primary surveillance radars;radar echoes;radar signal processing;range-azimuth gating;signal detection;turbine blades;wind farms;wind turbines;Air traffic control;Airborne radar;Blades;Degradation;Military aircraft;Radar detection;Radar tracking;Surveillance;Wind farms;Wind turbines;Radar;detection;feature aided tracking;mitigation;track classification;wind farm},
    URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4721114&isnumber=4720717

    Zhen Ding, "A survey of radar resource management algorithms," in Electrical and Computer Engineering, 2008. CCECE 2008. Canadian Conference on , vol., no., pp.001559-001564, 4-7 May 2008
    doi: 10.1109/CCECE.2008.4564804
    Abstract: This paper provides a preliminary survey of the multifunction phased array radar resource management algorithms. The survey is done based on selected forty three papers to illustrate existing algorithms for the radar resource optimization problem. The algorithms are categorized into six categories, where the first 3 categories are adaptive scheduling algorithms and the remaining categories are resource aided algorithms. The resource aided algorithms are relevant since a better algorithm needs less resource to achieve the same performance.
    keywords: {adaptive scheduling;phased array radar;resource allocation;adaptive scheduling algorithms;multifunction phased array RRM algorithms;radar resource management;radar resource optimization problem;resource aided algorithms;Fiber reinforced plastics;Radar;Resource management;Virtual reality;Multi-function phased array radar;radar resource management;survey},
    URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4564804&isnumber=4564482

    Hong, L.; Zhen Ding, "A distributed multirate IMM algorithm for multiplatform tracking," in American Control Conference, 1997. Proceedings of the 1997 , vol.3, no., pp.1458-1462 vol.3, 4-6 Jun 1997
    doi: 10.1109/ACC.1997.610712
    Abstract: Under the assumption that each model operates at an update rate proportional to the model's assumed dynamics, a multirate interacting multiple model (MRIMM) algorithm is briefly introduced. Based on the multirate IMM, its distributed version DMRIMM algorithm for multiplatform tracking is proposed. The MRIMM algorithm is first employed to perform each local/platform estimation. A global filter is then constructed to perform a fusion of MRIMM estimations. The advantages of low computation loads and performance improvement are demonstrated through Monte Carlo simulations
    keywords: {Markov processes;Monte Carlo methods;digital simulation;filtering theory;sensor fusion;target tracking;Monte Carlo simulations;distributed multirate interacting multiple model algorithm;global filter;multiplatform tracking;update rate;Adaptive algorithm;Data communication;Estimation;Filtering;Filters;History;Integrated circuit modeling;Signal resolution;Target tracking;Wavelet transforms},
    URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=610712&isnumber=13370

    Hong, L.; Zhen Ding, "Multiple target tracking using a multirate IMMJPDA algorithm," in American Control Conference, 1998. Proceedings of the 1998 , vol.4, no., pp.2427-2431 vol.4, 21-26 Jun 1998
    doi: 10.1109/ACC.1998.703069
    Abstract: A multirate interacting multiple model joint probabilistic data association (MRIMMJPDA) tracking algorithm is developed. The MRIMMJPDA combines two powerful algorithms, the multirate interacting multiple model (MRIMM) tracking algorithm and the joint probabilistic data association (JPDA) algorithm, such that both manoeuvring and nonmanoeuvring targets in clutter can be tracked effectively and efficiently
    keywords: {clutter;filtering theory;probability;target tracking;clutter;manoeuvring targets;multiple target tracking;multirate interacting multiple model joint probabilistic data association tracking algorithm;nonmanoeuvring targets;Computational complexity;Computer vision;Image processing;Image resolution;Noise measurement;Power measurement;Signal processing algorithms;Signal resolution;Spatial resolution;Target tracking},
    URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=703069&isnumber=15190

Peter W Moo 

  • www.dtic.mil/cgi-bin/GetTRDoc?AD=ADA545072&Location...
  • Moo, P.W., "Scheduling for multifunction radar via two-slope benefit functions," in Radar, Sonar & Navigation, IET , vol.5, no.8, pp.884-894, Oct. 2011
    • doi: 10.1049/iet-rsn.2010.0237
    • Abstract: The scheduling of tracking and surveillance looks for multifunction radar is considered. A technique called the sequential scheduler is proposed, whereby tracking looks and high-priority surveillance looks are scheduled first, and lower-priority surveillance looks are then scheduled to occupy gaps in the radar time line. A method called the two-slope benefit function (TSBF) sub-scheduler is used and requires that each tracking look and high-priority surveillance look has a benefit function, which specifies benefit as a function of start time. This method accounts for both look priority and target dynamics in formulating a look schedule. If the radar is overloaded with tracking look requests, the TSBF sub-scheduler down-selects a set of looks that can be scheduled, using a method that favours higher priority looks. Looks are scheduled to maximise the total benefit, and it is shown that the resulting maximisation is equivalent to a linear program which can be solved efficiently using the simplex method. A technique called the gap-filling sub-scheduler is used to schedule lower-priority surveillance looks. An example is presented which illustrates the properties of the sequential scheduler.
    • keywords: {linear programming;radar tracking;scheduling;surveillance;gap-filling subscheduler;high-priority surveillance;linear program;multifunction radar;scheduling;sequential scheduler;simplex method;tracking;two-slope benefit functions},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6036241&isnumber=6036231
  • Moo, P.W.; Xiaolin Wu, "Resynchronization properties of arithmetic coding," in Data Compression Conference, 1999. Proceedings. DCC '99 , vol., no., pp.540-, 29-31 Mar 1999
    • doi: 10.1109/DCC.1999.785697
    • Abstract: Summary form only given. Arithmetic coding is a popular and efficient lossless compression technique that maps a sequence of source symbols to an interval of numbers between zero and one. We consider the important problem of decoding an arithmetic code stream when an initial segment of that code stream is unknown. We call decoding under these conditions resynchronizing an arithmetic code. This problem has importance in both error resilience and cryptology. If an initial segment of the code stream is corrupted by channel noise, then the decoder must attempt to determine the original source sequence without full knowledge of the code stream. In this case, the ability to resynchronize helps the decoder to recover from the channel errors. But in the situation of encryption one would like to have very high time complexity for resynchronization. We consider the problem of resynchronizing simple arithmetic codes. This research lays the groundwork for future analysis of arithmetic codes with high-order context models. In order for the decoder to achieve full resynchronization, the unknown, initial b bits of the code stream must be determined exactly. When the source is approximately IID, the search complexity associated with choosing the correct sequence is at least O(2 b/2). Therefore, when b is 100 or more, the time complexity required to achieve full resynchronization is prohibitively high. To partially resynchronize, the decoder must determine the coding interval after b bits have been output by the encoder. For a stationary source and a finite-precision static binary arithmetic coder, the complexity of determining the code interval is O(22s), where the precision is s bits
    • keywords: {arithmetic codes;cryptography;decoding;digital arithmetic;error correction codes;search problems;synchronisation;arithmetic coding;binary arithmetic;coding interval;cryptology;decoding;encryption;error resilience;high-order context models;lossless compression;resynchronization;search complexity;source sequence;stationary source;time complexity;Computer science;Context modeling;Costs;Cryptography;Decoding;Digital arithmetic;Image coding;Resilience;Streaming media;Video compression},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=785697&isnumber=16375
  • Moo, P.W.; Neuhoff, D.L., "Optimal compressor functions for multidimensional companding," in Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on , vol., no., pp.515-, 29 Jun-4 Jul 1997
    • doi: 10.1109/ISIT.1997.613452
    • Abstract: We determine the asymptotically optimal compressor function for a multidimensional compander when the source is stationary and memoryless. The mean squared error of optimized companding is compared to that of optimal vector quantization and to that of scalar companding
    • keywords: {vector quantisation;asymptotically optimal compressor function;mean squared error;multidimensional companding;stationary memoryless sources;Computer errors;Lattices;Multidimensional systems;Pulse width modulation;Shape;Vector quantization},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=613452&isnumber=13396
  • Moo, P.W.; Zhen Ding, "Tracking Performance of MIMO Radar for Accelerating Targets," in Signal Processing, IEEE Transactions on , vol.61, no.21, pp.5205-5216, Nov.1, 2013
    • doi: 10.1109/TSP.2013.2274278
    • Abstract: Multiple-input multiple-output (MIMO) radar utilizes orthogonal waveforms on each transmit element to achieve virtual aperture extension. Compared to a directed beam radar, MIMO radar has increased Doppler resolution due to the longer integration times required to maintain the same energy on target. However, the requirement for longer integration times can also cause target returns to be spread over multiple range-Doppler bins, which decreases probability of detection. This paper derives an analytical expression for probability of detection that explicitly accounts for range-Doppler migration. The effect of target velocity, target acceleration and integration time on range-Doppler migration is analyzed. A framework for velocity and acceleration compensation and step sizes for full and partial compensation are proposed. Single-target track completeness and track accuracy are compared for directed beam radar, MIMO radar with full compensation, MIMO radar with partial compensation, and uncompensated MIMO radar. Results indicate that compensation is required to prevent degraded probability of detection and track completeness as target velocity and acceleration increase. Full compensation mitigates the effects of range-Doppler migration but requires additional computational complexity. The use of partial compensation reduces computational complexity requirements but has diminished tracking performance due to coasting over missed measurements.
    • keywords: {Doppler radar;MIMO radar;compensation;probability;radar tracking;waveform analysis;Doppler resolution;MIMO radar;acceleration compensation;directed beam radar;multiple range-Doppler bins;multiple-input multiple-output radar;orthogonal waveform;partial compensation;range-Doppler migration;single-target track completeness;target acceleration;target velocity;track accuracy;tracking performance;velocity compensation;virtual aperture extension;Acceleration;Doppler effect;MIMO;MIMO radar;Radar tracking;Target tracking;Acceleration compensation;coherent MIMO radar;phased array radar;range-Doppler migration;single target tracking;velocity compensation},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6567993&isnumber=6601658
  • Moo, P.W., "GMTI performance of ΣΔ-STAP for a forward-looking radar," in Radar Conference, 2001. Proceedings of the 2001 IEEE , vol., no., pp.258-263, 2001
    • doi: 10.1109/NRC.2001.922987
    • Abstract: The GMTI performance of ΣΔ-STAP for a forward looking phased array radar is analyzed using the simulation tool RLSTAP. ΣΔ-STAP processes the returns from sum and difference antenna channels. When used in conjunction with partially adaptive STAP methods ΣΔ-STAP is shown to achieve good GMTI performance
    • keywords: {antenna phased arrays;phased array radar;radar antennas;radar detection;radar signal processing;radar target recognition;radar theory;simulation;space-time adaptive processing;ΣΔ-STAP;GMTI performance;RLSTAP;forward-looking radar;partially adaptive STAP;phased array radar;simulation tool;sum/difference antenna channels;Airborne radar;Antenna arrays;Computational modeling;Mathematical model;Phased arrays;Pulse compression methods;Radar antennas;Radar clutter;Radar cross section;Space vector pulse width modulation},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=922987&isnumber=19954
  • Moo, P.W.; Neuhoff, D.L., "Uniform polar quantization revisited," in Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on , vol., no., pp.100-, 16-21 Aug 1998
    • doi: 10.1109/ISIT.1998.708687
    • Abstract: Using a recent result on the support of uniform scalar quantization, we optimize uniform polar quantization by choosing the asymptotically optimal support of the magnitude quantizer and deriving the optimal rate allocation between the magnitude and phase quantizers
    • keywords: {optimisation;quantisation (signal);asymptotically optimal support;magnitude quantizer;optimal rate allocation;optimization;phase quantizers;uniform polar quantization;uniform scalar quantization;Delta modulation;Discrete Fourier transforms;Mathematics;Noise figure;Phase estimation;Phase noise;Quantization;Signal to noise ratio},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=708687&isnumber=15310
  • Moo, P.W., "Range-doppler migration in coherent MIMO radar," in Radar Conference (EuRAD), 2011 European , vol., no., pp.138-141, 12-14 Oct. 2011
    • Abstract: The detection performance of coherent MIMO radar with orthogonal waveforms is compared to that of a radar using a directed beam. For an accelerating target and Doppler processing detection, an analytical expression for probability of detection which explicitly accounts for range-Doppler migration is presented. It is shown that radar and target parameters should satisfy particular conditions in order to ensure that range- Doppler migration does not occur. Due to longer integration times, MIMO radar suffers degraded detection performance compared to that of a directed beam radar. Doppler migration due to target acceleration is the dominant cause of range-Doppler migration as the number of antenna elements increases.
    • keywords: {MIMO radar;probability;radar detection;Doppler processing detection;coherent MIMO radar detection performance;detection probability;directed beam radar;orthogonal waveforms;range-Doppler migration;target acceleration;Acceleration;Doppler effect;Doppler radar;MIMO radar;Radar antennas;Signal to noise ratio;MIMO radar;radar detection;radar theory},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6101025&isnumber=6100963
  • Xiaolin Wu; Moo, P.W., "Joint image/video compression and encryption via high-order conditional entropy coding of wavelet coefficients," in Multimedia Computing and Systems, 1999. IEEE International Conference on , vol.2, no., pp.908-912 vol.2, Jul 1999
    • doi: 10.1109/MMCS.1999.778609
    • Abstract: As the Internet and multimedia systems grow in size and popularity, compression and encryption of image and video data are becoming increasingly important. However, independent compression and encryption is too slow for many multimedia applications. This paper presents a new joint compression and encryption method for images and videos that uses high-order conditional entropy coding of wavelet coefficients to facilitate encryption. As a result, state-of-the-art compression and significantly enhanced security are achieved, with no extra computational complexity
    • keywords: {cryptography;data compression;entropy codes;image coding;multimedia systems;video coding;wavelet transforms;Internet;computational complexity;data security;encryption;high-order conditional entropy coding;joint image video compression;multimedia systems;wavelet coefficients;Arithmetic;Computer science;Cryptography;Data security;Entropy coding;Image coding;Internet;Streaming media;Video compression;Wavelet coefficients},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=778609&isnumber=16898
  • Moo, P.W.; Zhen Ding, "Adaptive radar scheduling of track updates," in Radar Conference (Radar), 2014 International , vol., no., pp.1-6, 13-17 Oct. 2014
    • doi: 10.1109/RADAR.2014.7060239
    • Abstract: The scheduling of tracking update looks for a phased array radar is considered. A method called the Two-Slope Benefit Function (TSBF) Scheduler is formulated and requires that each tracking look have a benefit function, which specifies benefit as a function of start time. This method accounts for both look priority and target dynamics in formulating a look schedule. If the radar is overloaded with tracking look requests, the TSBF Scheduler down-selects a set of looks which can be scheduled, using a method which favours higher priority looks. Looks are scheduled to maximize the total benefit, and it is shown that the resulting maximization is equivalent to a linear program which can be solved efficiently using the simplex method. This technique attempts to optimize target tracking performance while making the best use of radar resources. An example is presented which illustrates the properties of the TSBF Scheduler and compares performance to the state-of-the-art.
    • keywords: {adaptive scheduling;linear programming;phased array radar;radar tracking;target tracking;TSBF scheduler;adaptive radar scheduling;benefit function;linear program;phased array radar;simplex method;target dynamics;target tracking performance;tracking look request;tracking update scheduling;two-slope benefit function;Arrays;Dynamic scheduling;Radar tracking;Schedules;Target tracking;Phased array radar;adaptive scheduling;radar resource management;radar tracking},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7060239&isnumber=7060235
  • Moo, P.W.; Zhen Ding, "Coordinated radar resource management for networked phased array radars," in Radar, Sonar & Navigation, IET , vol.9, no.8, pp.1009-1020, 10 2015
    • doi: 10.1049/iet-rsn.2013.0368
    • Abstract: A phased array radar has the ability to rapidly and adaptively position beams and adjust dwell times, thus enabling a single radar to perform multiple functions, such as surveillance, tracking and fire control. A radar resource manager prioritises and schedules tasks from the various functions to best use available resources. Networked phased array radars that are connected by a communication channel are studied. This study considers whether coordinated radar resource management (RRM), which exploits the sharing of tracking and detection data between radars, enhances performance compared with independent RRM. Two types of distributed management techniques for coordinated RRM are proposed, with each type characterised by varying amounts of coordination between the radars. A two-radar network and 30-target scenario are modelled in the simulation tool Adapt_MFR, to analyse the performance of the two coordinated RRM techniques against the baseline case of independent RRM. Results indicate that the coordinated RRM techniques achieve the same track completeness as independent RRM, while decreasing track occupancy and frame time. Therefore, coordinated RRM can improve reaction time against threats, at the expense of sending data across a communication channel. The performance of coordinated RRM for a communication channel with errors is also modelled and analysed.
    • keywords: {phased array radar;30-target scenario;adapt_MFR;baseline case;communication channel;coordinated radar resource management;detection data;distributed management techniques;dwell times;fire control;independent RRM;networked phased array radars;reaction time;simulation tool;surveillance;tracking;two-radar network},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7272150&isnumber=7272144
  • Moo, P.W.; Xiaolin Wu, "Resynchronization properties of arithmetic coding," in Image Processing, 1999. ICIP 99. Proceedings. 1999 International Conference on , vol.2, no., pp.545-549 vol.2, 24-28 Oct. 1999
    • doi: 10.1109/ICIP.1999.822955
    • Abstract: This paper considers decoding an arithmetic code stream when an initial portion of the code stream is unknown. Full resynchronization is hypothesized to have complexity that is exponential in the length of the initial portion. Experimental results specify the time complexity of determining the current arithmetic code interval, which is the important task in partial resynchronization.
    • keywords: {computational complexity;data compression;image coding;arithmetic coding;image coding;image compression;partial resynchronization;time complexity;Computer science;Cryptography;Decoding;Digital arithmetic;Image analysis;Image coding;Performance loss;Streaming media;Transform coding;Video compression},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=822955&isnumber=17708
  • Moo, P.W., "Multiple-input multiple-output radar search strategies for high-velocity targets," in Radar, Sonar & Navigation, IET , vol.5, no.3, pp.256-265, March 2011
    • doi: 10.1049/iet-rsn.2010.0044
    • Abstract: The radar detection of high-velocity targets with a multiple-element antenna array is considered. The detection performance of multiple-input multiple-output (MIMO) radar with orthogonal waveforms is compared with that of a radar using a directed beam. An analytical expression for the probability of detection for a radar with a multiple-element array is derived. For high-velocity targets, the decrease in probability of detection because of the longer integration time required for MIMO radar is quantified. It is shown that for lower-velocity targets, sector search using orthogonal waveforms results has similar detection range performance to that of scanning directed beams. For higher-velocity targets, the use of scanning directed beams yields larger detection range.
    • keywords: {MIMO radar;antenna arrays;multifrequency antennas;radar detection;MIMO radar;high-velocity targets;multiple-element antenna array;multiple-input multiple-output radar search strategies;orthogonal waveforms;radar detection;scanning directed beams},
    • URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5704829&isnumber=5704823

 

No comments:

Post a Comment