Добавил:
Upload Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:

Diss / 10

.pdf
Скачиваний:
143
Добавлен:
27.03.2016
Размер:
18.05 Mб
Скачать

Principles of Control Algorithm Design

233

(with the user view point) target tracking of the given number of targets and minimization of target detection time in searching mode, simultaneously.

When the number of tracked target is small, an excess of energy is spent to reduce the period of radar coverage scanning and, consequently, used to improve conditions of new target detection. As the number of tracked targets increases, the energy consumption for target tracking increases and under definite task conditions can reach such a value when a remainder of CRS power resources assigned

for searching new targets cannot satisfy the condition Tscan Tscanper . From this point, the process of limitation and redistribution of power resources issued for two modes is started. At first, for example,

the zone to search new targets is limited until some permissible dimension that allows us to save a

part of the energy and reduce the scanning period Tscan. Further, if it is impossible to reduce the scanning period Tscan in such a way, there is a need to move a part of the less important targets from the individual important target tracking to the group target tracking and so on. If the obtained scanning

time satisfies the following condition Tscani Tscanper , then there is no power resource imbalance in the considered CRS and there is no need to redistribute the power resource in the next scanning step. If the

condition mentioned earlier is not satisfied, then during the next scanning there is a need to reduce the searching zone or reschedule the service of targets in the individual target tracking mode. The solution of these tasks must be assigned to a control block of a higher level.

REFERENCES

1.Scolnik, M. 2008. Radar Handbook. 3rd edn. New York: McGraw Hill, Inc.

2.Scolnik, M. 2002. Introduction to Radar Systems. 3rd edn. New York: McGraw Hill, Inc.

3.Hansen, R.C. 1998. Phased Array Antenna. New York: John Wiley & Sons, Inc.

4.Mailloux, R.J. 2005. Phased Array Antenna Handbook. Norwood, MA: Artech House, Inc.

5.Cantrell, B., de Graaf, J., Willwerth, F., Meurer, G., Leibowitz, L., Parris, C., and R. Stableton. 2002. Development of a digital array radar. IEEE AEES Systems Magazine, 17(3): 22–27.

6.Scott, M. 2003. Sampson MFR active phased array antenna, in IEEE International Symposium on Phased Array Antenna Systems and Technology, October 14–17, Boston, Massachussets, Isle of Wight, U.K., pp. 119–123.

7.Brookner, E. 2006. Phased arrays and radars—Past, present, and future. Microwave Journal, 49(1): 24–46.

8.Brookner, E. 1988. Aspects of Modern Radar. Norwood, MA: Artech House, Inc.

9.Wehner, D.R. 1995. High-Resolution Radar. 2nd edn. Boston, MA: House, Inc.

10.Nathanson, F.E. 1991. Radar Design Principles. 2nd edn. New York: McGraw-Hill, Inc.

11.Rastrigin, L.A. 1980. Modern Control Principles of the Complex Objects. Moscow, Russia: Soviet Radio.

12.Picinbono, B. 1993. Random Signals and Noise. Englewood Cliffs, NJ: Prentice-Hall, Inc.

13.Porat, B. 1994. Digital Processing of Random Signals. Englewood Cliffs, NJ: Prentice-Hall, Inc.

14.Therrein, C.W. 1992. Discrete Random Signals and Statistical Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, Inc.

15.Bacut, P.A., Julina, Yu.V., and N.A. Ivanchuk. 1980. Detection of Moving Targets. Moscow, Russia: Soviet Radio.

16.Kontorov, D.S. and Yu.S. Golubev-Novogilov. 1981. Introduction to Radar Systems Engineering. Moscow, Russia: Soviet Radio.

17.Kuzmin, S.Z. 1974. Foundations of Radar Digital Signal Processing Theory. Moscow, Russia: Soviet Radio.

18.Helstrom, C.W. 1995. Elements of Signal Detection and Estimation. Upper Saddle River, NJ: PrenticeHall, Inc.

19.Levanon, N. and E. Mozeson. 2004. Radar Signals. New York: John Wiley/IEEE Press.

20.Middleon, D. 1996. An Introduction to Statistical Communication Theory. New York: McGraw-Hill. Reprinted by IEEE Press, New York.

21.Kay, S.M. 1998. Fundamentals of Statistical Signal Processing: Detection Theory. Englewood Cliffs, NJ: Prentice-Hall, Inc.

22.Levanon, N. 1988. Radar Principles. New York: John Wiley & Sons, Inc.

23.Di Franco, J.V. and W.L. Rubin. 1980. Radar Detection. Norwood, MA: Artech House, Inc.

24.Carrara, W.G., Goodman, R.S., and R.M. Majewski. 1995. Spotlight Aperture Radar—Signal Processing Algorithms. Norwood, MA: Artech House, Inc.

Part II

Design Principles of Computer System for Radar Digital Signal Processing and Control Algorithms

7 Design Principles of Complex

Algorithm Computational

Process in Radar Systems

The exponential growth in digital technology since the 1980s, along with the corresponding decrease in its cost, has had a profound impact on the way radar systems are designed. More and more functions that were historically implemented in analog hardware are now being performed digitally, resulting in increased performance and flexibility and reduced size and cost. Advances in analog-to-digital converter (ADC) and digital-to-analog converter (DAC) technologies are pushing the border between analog and digital processing closer and closer to the antenna. For example, Figure 7.1 shows a simplified flowchart of the receiver front end of a typical radar system that would have been designed around 1990. Note that this system incorporated analog pulse compression (PC). It also included several stages of analog downconversion in order to generate baseband in phase (I) and quadrature (Q) signal components with a small enough bandwidth so that the ADCs of the day could sample them. The digitized signals were then fed into digital Doppler/moving target indicator (MTI) and detection processors.

By contrast, Figure 7.2 depicts a typical digital receiver for a radar front end. The radio frequency (RF) input usually passes through one or two stages of analog downconversion to generate an intermediate frequency (IF) signal that is sampled directly by the ADC. A digital downconverter (DDC) converts the digitized signal samples to complex form at a lower rate for passing through a digital pulse compressor to backend processing. Note that the output of the ADC has a slash through the digital signal line with a letter provided earlier. The letter depicts the number of bits in the digitized input signal and represents the maximum possible dynamic range of the ADC. The use of digital signal processing (DSP) can often improve the dynamic range, stability, and overall performance of the system, while reducing size and cost, compared with the analog approach.

7.1  DESIGN CONSIDERATIONS

In coherent radar systems, all local oscillators (LOs) and clocks that generate system timing are derived from a single reference oscillator. However, this fact alone does not ensure that the transmitted waveform starts at the same RF phase on every pulse, which is a requirement for coherent systems. Consider a system with a 5 MHz reference oscillator, from which is derived a 75 MHz IF center frequency (on transmit and receive) and a complex sample rate of 30 MHz. A rule of thumb is that the clock used to produce the pulse repetition interval (PRI) needs to be a common denominator of the IF center frequencies on transmit and receive and the complex sample frequency in order to assure pulse-to-pulse phase coherency. For this example, with an IF center frequency of 75 MHz and a complex sample rate of 30 MHz, allowable PRI clock frequencies would include 15 and 5 MHz.

In the past, implementing a real-time radar digital signal processor typically required the design of a custom computing machine, using thousands of high-performance integrated circuits (ICs). These machines were very difficult to design, develop, and modify. Digital technology has advanced to the point where several implementation alternatives exist that make the processor more programmable and easier to design and change.

237

238

Signal Processing in Radar Systems

 

 

 

 

 

 

 

 

 

 

 

RF

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Input

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

×

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

LO1

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Analog|Digital

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

I

 

 

 

 

 

I

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Low-pass

 

 

 

 

 

 

 

 

 

 

 

 

 

Band-pass

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

lter

 

 

 

 

×

 

 

 

 

lter

 

 

 

ADC

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

IF1

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

LO2

 

 

 

 

×

 

 

 

Pulse

 

 

 

 

 

LO4

 

 

Sample

 

 

 

 

 

 

 

 

 

 

compression

 

 

 

 

 

 

 

 

clock

 

 

 

To backend

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

processing

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Band-pass

 

 

 

 

90°

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

lter

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

IF2

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Q

 

 

 

 

Q

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Low-pass

 

 

 

 

LO3

 

 

 

 

×

 

 

 

 

 

 

×

 

 

 

ADC

 

 

 

 

 

 

 

 

 

 

 

 

 

 

lter

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Analog|Digital

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Band-pass

 

IF3

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

lter

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

FIGURE 7.1  Typical radar receiver front end design from 1990.

 

Input

 

RF

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

LO1

 

 

 

 

×

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Band-pass

 

 

 

 

 

Sample

 

 

 

 

 

 

 

 

 

 

 

 

 

filter

 

 

 

 

 

clock

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

IF1

 

 

IF2

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

DDC

 

 

LO2

 

 

 

 

×

 

 

 

Band-pass

 

 

ADC

 

 

 

 

 

 

 

 

 

 

 

 

 

filter

 

 

 

 

 

 

 

Q I

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Analog|Digital

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

DDC—digital downconverter

 

 

 

 

 

 

 

Digital

 

 

 

 

 

PC—pulse compression

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

PC

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Q

 

 

 

I

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

To backend processing

FIGURE 7.2  Typical digital receiver front end.

7.1.1  Parallel General-Purpose Computers

This architecture employs multiple general-purpose processors that are connected via high-speed communication networks. Included in this class are high-end servers and embedded processor architectures. Servers are typically homogeneous processors, where all of the processing nodes are identical and are connected by a very high-performance data bus architecture. Embedded processor

Design Principles of Complex Algorithm Computational Process in Radar Systems

239

architectures are typically composed of single-board computers (blades) that contain multiple general-purpose processors and plug into standard backplane architecture. This configuration offers the flexibility of supporting a heterogeneous architecture, where a variety of different processing blades or interface boards can be plugged into the standard backplane to configure a total system. At this writing, backplanes are migrating from parallel architectures, where data are typically passed as 32 or 64 bit words, to serial data links, which pass single bits at very high clock rates (currently in excess of 3 GB/s [GBps]). These serial data links are typically point-to-point connections. In order to communicate with multiple boards, the serial links from each board go to a high-speed switchboard that connects the appropriate source and destination serial links together to form a serial fabric. It is apparent that high-speed serial links will be the primary communication mechanism for multiprocessor systems in the future, with ever-increasing data bandwidths. These parallel processor architectures offer the benefit of being programmable using high-level languages, such as C and C++. A related advantage is that programmers can design the system without knowing the intimate details of the hardware. In addition, the software developed to implement the system can typically be moved relatively easily to new hardware architecture as part of a technology refresh cycle.

On the negative side, these systems can be difficult to program to support real-time signal processing. The required operations need to be split up appropriately among the available processors, and the results need to be properly merged to form the final result. A major challenge in these applications is to support the processing latency requirements of the system, which define the maximum length of time allowed to produce a result. The latency of the microprocessor system is defined as the amount of time required to observe the effect of a change at a processor’s input on its output. Achieving latency goals often requires assigning smaller pieces of the workload to individual processors, leading to more processors and a more expensive system. Another challenge facing these systems in radar application is reset time. In a military application, when a system needs to be reset in order to fix a problem, the system needs to come back to full operation in a very short period of time. These microprocessor systems typically take a long time to reboot from a central program store and, hence, have difficulty meeting reset requirements. Developing techniques to address these deficiencies is an active area of research. Finally, these processors are generally used for nonreal time or near-real time data processing, as in target tracking and display processing. Since the 1990s, they have started to be applied to real-time signal processing applications. Although they might be cost-effective for relatively narrowband systems, their use in wideband DSP systems in the early twenty-first century is typically prohibitively expensive due to the large number of processors required. This situation should improve over time as faster and faster processors become available.

7.1.2  Custom-Designed Hardware

Through the 1990s, real-time radar DSP systems were built using discrete logic. These systems were very difficult to develop and modify, but in order to achieve the required system performance, it was the only option available. Many radar systems were built using application-specific integrated circuits (ASICs), which are custom devices designed to perform a particular function. The use of ASICs allowed DSP systems to become very small with high performance. However, they were (and still are) difficult and expensive to develop, often requiring several design interactions before the device was fully operational. If an ASIC-based system needs to be modified, the ASICs need to be redesigned, incurring significant expense. Typically, the use of ASICs makes sense if tens or hundreds of thousands of units are to be sold, so that the development costs can be amortized over the life of the unit. This is rarely the case for radar systems. However, many ASICs have been developed to support the communication industry, such as digital upand downconverter, which can be utilized in radar systems.

The introduction of the field programmable gate array (FPGA) in the 1980s heralded a revolution in the way real-time DSP systems were designed. FPGAs are integrated circuits that consist of a large array of configurable logic elements that are connected by a programmable interconnect structure. At the time of this writing, FPGAs can also incorporate hundreds of multipliers that can

240

Signal Processing in Radar Systems

be clocked at rates up to a half billion operations per second, and memory blocks, microprocessors, and serial communication links that can support multigigabit-per-second data transfers. Circuits are typically designed using a hardware description language (HDL), such as VHDL (VHSIC hardware description language) or Verilog. Software tools convert this high-level description of the processor to a file that is sent to the device to tell it how to configure itself. High-performance FPGAs store their configuration in volatile memory, which loses its contents when powered down, making the devices infinitely reprogrammable.

FPGAs allow the designer to fabricate complex signal processing architectures very efficiently. In typical large applications, FPGA-based processors can be a factor of 10 (or more) smaller and less costly than systems based on general-purpose processors. This is due to the fact that most microprocessors only have one or few processing elements, whereas FPGA have an enormous number of programmable logic elements and multipliers. For example, to implement a 16 tap FIR filter in a microprocessor with a single multiplier and accumulator, it would take 16 clock cycles to perform the multiplications. In an FPGA, we could assign 16 multipliers and 16 accumulators to the task, and the filter could be performed in 1 clock cycle. In order to use an FPGA most efficiently, we have to take advantage of all of the resources it offers. These include not only the large numbers of logic elements, multipliers, and memory blocks but also the rate at which the components can be clocked. In the previous example, assume that the data sample rate is 1 MHz and also assume that the multipliers and logic can be clocked at 500 MHz. If we simply assign one multiplier to each coefficient, we would use 16 multipliers clocking at 500 MHz. Since the data rate is only 1 MHz, each multiplier would only perform one significant multiplication every microsecond and then be idle for the other 499 clocks in the microsecond, which is very inefficient. It would be much more efficient, in this case, to use one multiplier to perform as many products as possible. This technique, called time-domain multiplexing, requires additional logic to control the system and provide the correct operands to the multiplier at the right time. Since an FPGA can incorporate hundreds of multipliers, one can appreciate the power of this technique.

On the negative side, utilizing an FPGA to its best advantage typically requires the designer to have a thorough understanding of the resources available in the device. This typically makes efficient FPGA-based systems harder to design than radar systems based on general-purpose processors, where a detailed understanding of the microprocessor system architecture is not necessarily required. In addition, FPGA designs tend to be aimed at a particular family of devices and take full advantage of the resources provided by that family. Hardware vendors are constantly introducing new products, invariably incorporating new and improved capabilities. Over time, the older devices become obsolete and need to be replaced during a technology refresh cycle. When a technology refresh occurs several years down the road, typically the available resources in the latest FPGAs have changed or a totally different device family is used, which probably requires a redesign. On the other hand, software developed for general-purpose processors may only need to be recompiled in order to move it to a new processor. Tools currently exist that synthesize C or MATLAB® code into an FPGA design, but these tools are typically not very efficient. The evolution of design tools for FPGAs to address these problems is an area of much research and development.

Hybrid processors: Although it would be very desirable to simply write C code to implement a complex radar signal processor, the reality in the early twenty-first century is that, for many radar systems, implementing such a system would be prohibitively expensive or inflict major performance degradation. Although the steady increase in processor throughput may someday come to the rescue, the reality at the time of writing is that high-performance radar signal processors are usually a hybrid of application-specific and programmable processors. Dedicated processors, such as FPGAs or ASICs, are typically used in the high-speed front end of radar signal processors, performing demanding functions such as digital downconversion and pulse compression, followed by programmable processors in the rear, performing the lower-speed tasks such as detection processing. The location of the line that separates the two domains is application-dependent, but over time, it is constantly moving toward the front end of the radar system.

Design Principles of Complex Algorithm Computational Process in Radar Systems

241

7.2  COMPLEX ALGORITHM ASSIGNMENT

The complex algorithm of a computational process is a set of elementary DSP algorithms for all stages and complex radar system (CRS) modes of operation. Off-line complex algorithms of DSP individual stages that are not associated with each other by information processes and control operations are possible, too. To design the complex algorithm of a computational process, there is a need to have an unambiguous definition of microprocessor system functioning under solution of goal-oriented DSP problems. This definition must include the elementary DSP and control algorithms, a sequence of their application, the conditions of implementation of each elementary DSP and control algorithm, and intercommunication between the DSP and control algorithms using input and output information. A general form of such definition and description can be presented using the logical and graph flowchart of the DSP and control algorithms.

The complex algorithm can be realized by a multiprocessor system. In this case, the elementary operations are distributed among the microprocessors taking into consideration their operation speed, and the complex algorithm must be transformed into the form suitable for realization in parallel microprocessor systems (parallelization of the complex algorithm). The method of algorithmic representation and transformation is the subject of investigation in the theory of algorithms.

7.2.1  Logical and Matrix Algorithm Flowcharts

Universal ways of algorithm assignment are designed by the theory of algorithms. At that time, any general way to assign the complex algorithms is based on the dual character objects, namely, the counting operators and the logical operators (or recognizers). In our case, the counting operators A1, A2,…, Ai are the elementary DSP algorithms. The logical operators (recognizers) P1, P2,…, Pi are used to recognize some features of information processed by the complex DSP algorithm and to change a sequence of elementary algorithms depending on results of recognition.

One of the best-known ways to assign the complex DSP algorithm depending on complexity is the logical or formula-logical algorithmic flowchart. The elementary operators and recognizers are presented in the geometrical form in the logical algorithm flowchart (rectangle, jewel boxes, trapeziums, etc.) connected with each other by arrows in accordance with the given sequence of counting operators and recognizers in the complex algorithm. Titles of elementary operations (DSP algorithms) are written inside the geometrical forms. Sometimes the formulas of logical operations carried out and logical conditions under test are written inside the geometrical forms. In this case, the corresponding logical flowchart of the complex DSP algorithm is called the formula-logical block diagram.

The complex algorithm can be presented also by operator diagram consisting of elementary counting operators (the elementary DSP algorithms), recognizers, and indicators to carry out operations in sequence. Additionally, we use the specific operators to start A0 and to stop Ak. For example, we can design the following operator diagram of algorithms based on the counting operators A1, A2, A3, A4, and A5 and recognizers P1, P2, P3, and P4:

3 1

A0 A1P1 A2P2

where

means the arrow beginning means the arrow end

2

1

3

2

4

4

 

↑ ↓ P3 A3 A4P4 As Ak ,

(7.1)

The beginning and the end of the same arrow are designated by the same number. The algorithm starts to work after using the operator A0 “Start.” The order to work for other blocks of the

242

Signal Processing in Radar Systems

operational flowchart is the following. If the last active block is the counting operator, then the next in step-by-step block works. If the last active block is the recognizer, then two cases are possible. If the test condition is satisfied, then the neighbor at the right side block works. If the test condition is not satisfied, then the block marked by the arrow directed from the recognizer works. The algorithm stops working if the last active operator possesses an assignment to pass to the operator Ak “Stop.” The operator flowcharts of algorithms are very compact but not so obvious and require additional explanations and the operator sense decoding.

To write the order of the elementary DSP algorithms functioning as components of the complex algorithm, we use the matrix form:

A0

A1

A = A2

An

A1

A2

An Ak

 

α01 α02

α0n α0k

 

 

 

 

 

 

 

 

α11 α12 α1n α1k

 

 

 

 

 

α21

α22

α2n α2k

 

 

 

,

(7.2)

. . . . . . . . . . . . . . . . .

 

 

 

 

 

αn1

αn2 αnn αnk

 

 

 

 

 

where

αij = αij (P1, P2 ,…, Pl ), i = 0,1, 2,…, n; j = 1, 2,…, n, n + 1

(7.3)

are the logical functions satisfying the following condition: if after the algorithm Ai performance the function αij at some set of the logical elements P1, P2,…, Pl taking magnitudes Pi = 1 or Pi = 0 is equal to unit, then the algorithm Aj must be the next to operate. If some functions αij 1, then the algorithm Aj must operate after the algorithm Ai. Conversely, if some functions αij 0, then under realization of the complex algorithm the operation of the elementary algorithm Aj is impossible after operation of the elementary algorithm Ai. The matrix flowchart of the operator algorithm given by (7.1) takes the following form:

 

 

 

 

 

A1 A2

 

A3

 

A4

As

 

Ak

 

A0

 

 

 

1

0

0

0

0

0

 

 

 

 

 

 

 

 

A1

 

 

 

 

 

 

 

 

 

 

 

0

0 0

 

 

 

P1P3 P1 P1P3

 

A = A2

 

 

 

P2

 

 

P2P3

 

 

 

0

0

.

 

P3 0

P2

(7.4)

A3

 

 

 

0

0

0

1

0

0

 

 

 

A4

 

 

 

0

0

0

0

P4

 

 

 

 

 

P4

 

 

A5

 

 

 

0

0

0

0

0

1

 

 

 

Let notation Ai Aj mean that after the algorithm Ai operation there is a need to carry out the algorithm Aj. Then the notation

Aj → αi1A1 + αi2 A2 + + αin An

(7.5)

Соседние файлы в папке Diss