专利汇可以提供A method and apparatus for displaying radar data专利检索,专利查询,专利分析的服务。并且A method and apparatus for displaying radar data on a display monitor, wherein the monitor is divided into octants, and wherein the radar data defines a pie-shaped slice to be displayed within an octant on the monitor. The radar data has a center point which is defined as a point on an x-y plane, a radius r which is a defined as a number of displacement units in length extending radially from the center point, a starting angle ϑ, a delta angle ∂ϑ, radial displacement data which defines the color of groups of displacement units along the radius r for the slice, and a quantity Q which is the number of groups of radial displacement data within said radar data. The radar data is received by a data processing system and stored in memory. The video display monitor is updated by a screen refresh memory controlled by a graphics accelerator. The graphics accelerator receives the radar data for the slice to be displayed from the data processing system; determines the octant in which the slice is to be displayed; expands the radial displacement data into a color table which correlates the radial displacement unit along the radius r has a color assigned to it; generates vertical or horizontal fill vectors for filling in the slice as determined by the octant in which the slice is to be displayed, said vectors having pixel colors as determined by the color table; and inhibits the loading step while the expaning or generating steps are being performed.,下面是A method and apparatus for displaying radar data专利的具体信息内容。
This invention relates to the display of radar data, and more particularly, to a method and apparatus for converting radar data to Cartesian coordinates and drawing the data in an accelerated fashion.
Radar data is typically displayed on a cathode ray tube employing a raster scan technique in which pixels defining the entire surface of the CRT are referenced by a Cartesian coordinate system. However, radar data is typically in polar coordinate form, such that a conversion from polar to Cartesian coordinates must take place in order to display the data. Algorithms for achieving this conversion are well known in the art, but take 2 seconds or more to update the raster over 360 degrees of data. A typical algorithm receives data and decodes it, filling a slice along a radial line while decoding.
It is an object of the present invention to provide a more efficient way to display radar data on a video display monitor.
The present invention provides a method and apparatus for displaying radar data on a video display monitor, wherein the display is divided into octants, and wherein the radar data defines a pieshaped slice to be displayed within an octant on the monitor. The radar data has a center point which is defined as a point on an x-y plane, a radius r which is a defined as a number of displacement units in length extending radially from the center point, a starting angle ϑ, a delta angle ∂ϑ, radial displacement data which defines the color of groups of displacement units along the radius r for the slice, and a quantity Q which is the number of groups of radial displacement data within said radar data. The radar data is received by a data processing system and stored in memory. The video display monitor is updated by a screen refresh memory controlled by a graphics accelerator. The present invention provides for:
These and other objectives, features and advantages of the present invention will be more readily understood upon consideration of the following detailed description of the present invention, taken in conjunction with the accompanying drawings.
A cathode ray display (CRT) 10 for displaying radar data is illustrated in Fig. 1. The actual drawing of the data on the CRT is performed by a raster scan (not shown) which illuminates pixels (not shown) which define the visual appearance of the entire screen surface of the CRT 10. Each pixel is referenced as a point x,y on a Cartesian coordinate system such as that defined by the x-axis 20 and the y-axis 30. The displayed radar data is updated by a slice 40 of new data. The slice has a pie shape which is defined in polar coordinate terms as having a radius r, and a delta angle ∂ϑ. The slice 40 is referenced in the x-y plane as emanating from a center point x₀,y₀ at an angle ϑ from the x axis 20. Each slice represents a ∂ϑ ranging from approximately 0.1° to 2°. A full screen update, i.e., a display of 360° of new slice data, takes less than one second under the method of the present invention.
A basic flow chart illustrating the present invention is given in Fig. 2. In step 2, radar data is received by a data processing system (CPU), such as a Texas Instruments 340'0 graphics processor, encoded and stored in CPU memory. In step 2, the CPU identifies the octant in which the slice of radar data is to be drawn. In step 3, a set of constants is calculated. In step 4, the CPU waits for a not busy signal to be set in a graphics accelerator status register, then reads from CPU memory into a graphics accelerator color register a portion of the radar data providing a number of radial displacement units which have the same color. In step 5, the data in the color register is expanded into a table which stores a color value for each radial displacement unit in successive registers. In step 6, a series of vectors is drawn to fill the slice using a procedure to correlate a color value from the color table with x,y coordinates corresponding to pixel locations, the result being stored in a first-in first-out buffer (FIFO). In step 7, the FIFO buffer continuously writes to a screen refresh memory and updates the video display with new slice information.
Referring to Figs. 3a-c, a group of radar data is received by a data processing system (CPU) 100, encoded, and stored in a memory 102. In order to reduce the complexity of Fig. 3c, the control and data paths between the various registers, multiplexers, and comparators of the graphics accelerator 104 and that of the CPU 100 are not shown, the appropriate interconnections being well known to one of ordinary skill in the art. Each data group is stored as a set of 16-bit words W₁, W₂ . . . Wn, wherein each group contains a center point x₀,y₀, a radius r, a delta angle ∂ϑ, a starting angle ϑ, a quantity Q, and a plurality of pairs of radial data N,C, where Q is the number of pairs N,C included in each data group, and where N equals the number of radial displacement units which have a color C. The pairs do not have x-y coordinates, rather the sum of all N's defines the radius r.
A graphics accelerator 104 performs an expansion of the radial data pairs. The result is a table 108 in which each displacement unit along the radius has a color assigned to it. Before expansion, the table is initialized to contain the value black in every address location, and the expansion process overwrites referenced locations. For example, if N₀ = 5 and C₀ = red, then five successive radial displacement units are red, and the pair N₀,C₀ is expanded by writing the value red into five successive address locations in table 108. Likewise, if N₁ = 10 and C₁ = green, the pair N₁,C₁ is expanded by writing the value green into ten successive address locations in table 108, and so on until all data pairs have been expanded into the table.
To accomplish the expansion, the CPU waits for the graphics accelerator status bit 107 to indicate that the graphics accelerator is not busy. Then the CPU sets the graphics accelerator's configuration register (not shown) to select an appropriate data path as shown by the arrows in Fig. 3c and enable a write operation to the static random access memory (SRAM) 108. A stop condition is set in the stop comparator 116 as equal to or greater than. The up/down counter 106 is set to zero. The color value C is then loaded into the color register 110. The integer accumulator register 112 is set to zero. The last point register 114 is loaded with the value N. The up/down counter 106 generates sequential addresses in the SRAM 108 where the value in the color register will be stored. The value in the color register 110 is then copied into the SRAM 108 at the location corresponding to the address provided by the output of the up/down counter 106. The integer accumulator 112 increments by one. The same color value C is copied from the color register 110 to successive locations in the SRAM 108 as addressed by the up/down counter output until the value in the integer accumulator 112 equals the value in the last point register 114. When the condition is met, the expansion loop begins again with the next data pair, continuing until all data pairs have been expanded, thus yielding a color table in which each radial displacement unit is associated with a specific color.
Referring now to Fig. 4, the method for filling in a slice 40 depends on where in the x-y plane the slice is to drawn, and this is determined from the starting angle ϑ. The x-y plane is divided into octants, each octant comprising a 45° region, where 0° is said to coincide with the positive x axis and degrees are measured counterclockwise about the intersection of the x and y axes. Thus, octant 1 comprises the region 0° < ϑ ≦ 45°; octant 2 comprises the region 45° < ϑ ≦ 90°; octant 3 comprises the region 90° < ϑ ≦ 135°; octant 4 comprises the region 135° < ϑ ≦ 180°; octant 5 comprises the region 180° < ϑ ≦ 225°; octant 6 comprises the region 225° < ϑ ≦ 270°; octant 7 comprises the region 270° < ϑ ≦ 315°; and octant 8 comprises the region 315° < ϑ ≦ 360°. For slices of data residing in octants 1, 4, 5, or 8, these slices are filled by drawing vertical vectors such as v₀ - va. For slices of data residing in octants 2, 3, 6, or 7, these slices are filled by drawing horizontal vectors such as h₀ - hb.
Once the octant in which the slice is to be drawn is determined, the values of sin ϑ, cos ϑ, tan ϑ, and sec ϑ are determined by use of a trigonometric lookup table (not shown). This lookup table may be stored in read-only memory (ROM). A set of constants are then calculated for that octant for use in a vector drawing procedure as follows: for 0° < ϑ ≦ 45°:
ϑ = ϑ;
dy = tan ϑ;
dn = cos ϑ;
bn = tan (ϑ + dϑ) - tan ϑ;
dr = sin ϑ;
dR = sec ϑ;
for 45° < ϑ ≦ 90°:
ϑ = 90° - ϑ;
dy = tan ϑ;
dn = cos ϑ;
bn = tan (ϑ + dϑ) - tan ϑ;
dr = sin ϑ;
dR = sec ϑ;
for 90° < ϑ ≦ 135°: ϑ = ϑ - 90°;
dy = -tan ϑ;
dn = cos ϑ;
bn = tan (ϑ + dϑ) - tan ϑ;
dr = -sin ϑ;
dR = sec ϑ;
for 135° < ϑ ≦ 180°:
ϑ = 180° - ϑ;
dy = tan ϑ;
dn = cos ϑ;
bn = tan (ϑ + dϑ) - tan ϑ;
dr = sin ϑ;
dR = sec ϑ;
for 180° < ϑ ≦ 225°:
ϑ = ϑ - 180°;
dy = -tan ϑ;
dn = cos ϑ;
bn = tan (ϑ + dϑ) - tan ϑ;
dr = -sin ϑ;
dR = sec ϑ;
for 225° < ϑ ≦ 270°:
ϑ = 270° - ϑ;
dy = -tan ϑ;
dn = cos ϑ;
bn = tan (ϑ + dϑ) - tan ϑ;
dr = -sin ϑ;
dR = sec ϑ;
for 270° < ϑ ≦ 315°:
ϑ = ϑ - 270°;
dy = tan ϑ;
dn = cos ϑ;
bn = tan (ϑ + dϑ) - tan ϑ;
dr = sin ϑ;
dR = sec ϑ;
for 315° < ϑ ≦ 360°:
ϑ = 360° - ϑ;
dy = -tan ϑ;
dn = cos ϑ;
bn = tan (ϑ + dϑ) - tan ϑ;
dr = -sin ϑ;
dR = sec ϑ.
A flow diagram showing the procedure for drawing a vertical vector in accordance with the present invention is illustrated in Fig. 5. In step 200, a color is retrieved from the color table based on first index RR, where RR = R, R being initially set at zero. RR is the location in the color table 108 from which the color of the pixel to be displayed is retrieved. In step 201, a pixel is drawn at point x,y having the color just retrieved in step 200. Point x,y is initially set equal to x₀,y₀. In step 202, the color table first index RR is updated to specify the color of the next pixel by adding to it the calculated constant dr. The constant dr is less than one. In step 203, the y coordinate is incremented by one to move to the next vertical pixel in which the vector will be drawn. In step 204, the incremented y coordinate is compared to the calculated end value yend for the x coordinate of the vertical vector being drawn, where yend = y + n, where n is the number of pixels required to fill the vertical slice. If the end value yend has not been reached, steps 200 through 204 are repeated until the condition is satisfied.
In step 205, the x coordinate is incremented by one. In step 206, the y coordinate is incremented by the calculated constant dy to move to the next vertical vector to be drawn. In step 207, a second color table index R is updated by adding to it the calculated constant dR. The constant dR is greater than one. In step 208, the number of pixels n required to fill the slice at the new x coordinate is updated by adding the calculated constant bn to n. In step 209, the end value yend is recalculated by adding the new value of n to y to reflect the difference in width of the slice at the new x coordinate.
In step 210, x is compared to the number of pixels xtotal which are required in the x direction in order to fill the slice, xtotal being a constant equal to the radius r multiplied by the calculated constant dn, an x projection. If the total number of x direction pixels xtotal have not been drawn, then steps 200 through 210 are repeated until all pixels have been drawn.
A flow diagram showing the procedure for drawing a horizontal vector in accordance with the present invention is illustrated in Fig. 6. In step 300, a color is retrieved from the color table based on first index RR, where RR = R, R being initially set at zero. RR is the location in the color table from which the color of the pixel to be displayed is retrieved. In step 301, a pixel is drawn at point x,y having the color just retrieved in step 300. Point x,y is initially set equal to x₀,y₀ . In step 302, the color table index RR is updated to specify the color of the next pixel by adding to it the calculated constant dr. The constant dr is less than one. In step 303, the x coordinate is incremented by one to move to the next horizontal pixel in which the vector will be drawn. In step 304, the incremented x coordinate is compared to the calculated end value xend for the y coordinate of the horizontal vector being drawn, where xend = x + n, where n is the number of pixels required to fill the horizontal slice. If the end value xend has not been reached, steps 300 through 304 are repeated until the condition is satisfied.
In step 305, the y coordinate is incremented by one. In step 306, the x coordinate is incremented by the calculated constant dy to move to the next horizontal vector to be drawn. In step 307, a second color table index R is updated by the calculated constant dR. The constant dR is greater than one. In step 308, the number of pixels n required to fill the slice at the new y coordinate is updated by adding the constant bn to n. In step 309, the end value xend is recalculated by adding the new value of the number of pixels n to x to reflect the difference in height of the slice at this new y coordinate.
In step 310, y is compared to the number of pixels ytotal which are required in the y direction in order to fill the slice, ytotal being a constant equal to the radius r multiplied by the calculated constant dn, a y projection. If the total number of y direction pixels ytotal have not been drawn, then steps 300 through 310 are repeated until all pixels have been drawn.
The hardware implementation of the drawing procedure is illustrated in Fig. 7 and will be discussed for a vertical vector. In order to reduce the complexity of Fig. 7, the control and data paths between the various registers, multiplexers, and comparators of the graphics accelerator 104 and that of the CPU 100 are not shown, the appropriate interconnections being well known to one of ordinary skill in the art. For each fill line, the CPU waits for the graphics accelerator status bit 107 to indicate that the graphics accelerator 104 is not busy. The CPU then sets the graphics accelerator's configuration register (not shown) to select an appropriate data path and set the appropriate bit values in comparators 120 and 122, SRAM address and data 108, FIFO register 124, and FIFO output multiplexers 126, 128, and 130. The stop comparator 116 is set to the condition equal to or greater than.
The x coordinate of the fill line is then loaded into the color register 110. The starting y coordinate is loaded into the up/down counter 106. The end value of y is loaded into the last point register 114. The first color table index RR is loaded into both the integer accumulator 112 and the fraction accumulator 132. The integer accumulator 112 and fraction accumulator 132 are used to calculate the index RR of the color table. The integer portion of the index is used as an address to access the color table stored in SRAM 108. The increment of the index is stored in registers 140 and 142. The results are then written to the FIFO buffer 124, where the raster will update the pixel information displayed on the CRT on its next scan.
The terms and expressions which have been employed here are used as terms of description and not of limitation, and there is no intention in the use of such terms and expressions to exclude equivalents of the features shown and described, or portions thereof, it being recognized that various modifications are possible within the scope of the invention as claimed.
标题 | 发布/更新时间 | 阅读量 |
---|---|---|
一种车辆紧急刹车防护系统及方法 | 2020-05-08 | 567 |
一种图形加速器IP验证方法和装置 | 2020-05-12 | 387 |
用于传送数据的方法、装置和系统 | 2020-05-14 | 337 |
一种基于非虚拟化体系架构的Android运行环境实现方法 | 2020-05-12 | 953 |
具有协同作用的页面、书脊、边缘延伸部和功率设计的智能书籍系统 | 2020-05-12 | 383 |
全视野摄像头主机控制器 | 2020-05-13 | 826 |
一种控制器局域网络测试装置 | 2020-05-18 | 836 |
그래픽 가속기에 기반한 3D 모델의 라인 드로잉 방법 및 이를 이용한 프로그램이 기록된 컴퓨터 판독가능 기록매체 | 2020-05-16 | 403 |
APPARATUS AND METHOD FOR ACCELERATING GRAPH ANALYTICS | 2020-05-15 | 803 |
METHOD AND SYSTEM OF HARDWARE ACCELERATED VIDEO CODING WITH PER-FRAME PARAMETER CONTROL | 2020-05-13 | 765 |
高效检索全球专利专利汇是专利免费检索,专利查询,专利分析-国家发明专利查询检索分析平台,是提供专利分析,专利查询,专利检索等数据服务功能的知识产权数据服务商。
我们的产品包含105个国家的1.26亿组数据,免费查、免费专利分析。
专利汇分析报告产品可以对行业情报数据进行梳理分析,涉及维度包括行业专利基本状况分析、地域分析、技术分析、发明人分析、申请人分析、专利权人分析、失效分析、核心专利分析、法律分析、研发重点分析、企业专利处境分析、技术处境分析、专利寿命分析、企业定位分析、引证分析等超过60个分析角度,系统通过AI智能系统对图表进行解读,只需1分钟,一键生成行业专利分析报告。