°£Æí°áÁ¦, ½Å¿ëÄ«µå û±¸ÇÒÀÎ
ÀÎÅÍÆÄÅ© ·Ôµ¥Ä«µå 5% (195,730¿ø)
(ÃÖ´ëÇÒÀÎ 10¸¸¿ø / Àü¿ù½ÇÀû 40¸¸¿ø)
ºÏÇǴϾð ·Ôµ¥Ä«µå 30% (176,030¿ø)
(ÃÖ´ëÇÒÀÎ 3¸¸¿ø / 3¸¸¿ø ÀÌ»ó °áÁ¦)
NH¼îÇÎ&ÀÎÅÍÆÄÅ©Ä«µå 20% (166,030¿ø)
(ÃÖ´ëÇÒÀÎ 4¸¸¿ø / 2¸¸¿ø ÀÌ»ó °áÁ¦)
Close

Sonar Signal Processing

¼Òµæ°øÁ¦

2013³â 9¿ù 9ÀÏ ÀÌÈÄ ´©Àû¼öÄ¡ÀÔ´Ï´Ù.

°øÀ¯Çϱâ
  • ÃâÆÇ»ç : Artech House
  • ¹ßÇà : 1991³â 07¿ù 01ÀÏ
  • Âʼö : 0
  • ISBN : 9780890064535
Á¤°¡

206,030¿ø

  • 206,030¿ø

    6,190P (3%Àû¸³)

ÇÒÀÎÇýÅÃ
Àû¸³ÇýÅÃ
  • S-Point Àû¸³Àº ¸¶ÀÌÆäÀÌÁö¿¡¼­ Á÷Á¢ ±¸¸ÅÈ®Á¤ÇϽŠ°æ¿ì¸¸ Àû¸³ µË´Ï´Ù.
Ãß°¡ÇýÅÃ
¹è¼ÛÁ¤º¸
  • 5/7(È­) À̳» ¹ß¼Û ¿¹Á¤  (¼­¿ï½Ã °­³²±¸ »ï¼º·Î 512)
  • ¹«·á¹è¼Û
ÁÖ¹®¼ö·®
°¨¼Ò Áõ°¡
  • À̺¥Æ®/±âȹÀü

  • ¿¬°üµµ¼­

  • »óÇ°±Ç

AD

¸ñÂ÷

Preface
Overview of Digital Signal Processingp. 1
Analog Signal Conditioningp. 1
Analog Filteringp. 2
Analog-to-Digital Conversionp. 7
Digital Filteringp. 13
Finite Impulse Response Filtersp. 14
Infinite Impulse Response Filtersp. 19
Multirate Signal Processingp. 22
Discrete Fourier Transformp. 29
Window Functionsp. 31
Fast Fourier Transform Implementationsp. 39
Real-Data Transformsp. 44
Appendicesp. 47
Approach 1p. 47
Approach 2p. 48
Referencesp. 49
Conventional Beamformingp. 51
Sensor Array Characteristicsp. 51
Beamforming as Spatial Filteringp. 52
Beamforming with a Three-Dimensional Arrayp. 54
Results for One-Dimensional Arraysp. 54
Array Gainp. 59
DFT of a Delayed Sequencep. 60
General Array Gain Expression for Three-Dimensional Arrays and Arbitrary Noise Fieldsp. 63
Array Gain for a Linear Array in Isotropic Noisep. 64
Array Weightingp. 65
Time-Domain Beamformingp. 69
Interpolation Beamformersp. 72
Tolerance Analysisp. 77
Frequency-Domain Beamformingp. 84
Quadrature Beamformingp. 91
Referencesp. 94
Optimum Detection and Estimation in Passive Sonarp. 95
Signal and Noise Environmentsp. 95
Signal Modelsp. 95
Noise Modelsp. 97
Optimum Detectionp. 100
Hypothesis Testingp. 100
Broadband Detector for a Linear Array of Sensorsp. 106
Narrowband Detectorp. 114
Modulation Detectorp. 123
Parameter Estimationp. 128
Cramer-Rao Lower Boundp. 128
Broadband Signal Parameter Estimationp. 130
Narrowband Signal Parameter Estimationp. 134
Delay Estimationp. 137
Conclusionp. 140
Referencesp. 140
Practical Implementations of Optimum Sonar Detectors and Estimatorsp. 143
Adapting Optimized Receivers to Real-World Conditionsp. 143
Background Noise Estimation and Removalp. 144
Noise-Mean Estimationp. 145
Noise Removalp. 147
Broadband Processingp. 150
Effect of F (k) on Broadband Performancep. 150
Broadband Processor Implementationp. 155
Narrowband Processingp. 158
Narrowband Processor Implementationp. 158
Narrowband Processor Performancep. 163
Modulation Processingp. 173
Correlation Processingp. 175
Appendixp. 181
Referencesp. 185
Active Sonarp. 187
Channel Modelingp. 187
Signal Considerationsp. 190
Signal Ambiguity Functionp. 191
Continuous Wave Pulsep. 194
Linear FM Pulsep. 199
Echo Excess Equationp. 205
Center Frequency Selectionp. 206
Range-Doppler-Shift Processingp. 211
Background Noise-Limited Environmentp. 211
Reverberation Noise-Limited Environmentp. 214
FFT-Based Implementationsp. 219
Block Diagram of an Active Sonar Processorp. 224
Appendixp. 225
Referencesp. 228
Conventional Passive Sonar Systemp. 231
Sonar System Specificationp. 231
Broadband Processingp. 233
Narrowband Processingp. 235
Modulation Processingp. 239
Total Computational Rate and Input-Output Ratep. 240
Computational Ratep. 241
Input-Output Ratep. 242
Sonar Signal Processing Architecturep. 244
Overall Sonar Processing Systemp. 246
Signal Processing Unitp. 246
Signal Processorp. 247
Composite Passive Sonar Displayp. 255
Chapter Summaryp. 256
Referencesp. 257
Matrix Processing for Sonarp. 259
Computation-Intensive Sonar Signal Processingp. 259
High-Resolution Beamformingp. 259
Adaptive-Combiner Beamformerp. 270
High-Resolution Spectral Estimationp. 273
Required Matrix Operationsp. 278
Modern Matrix Techniquesp. 278
Numerical Stabilityp. 280
QR Decompositionp. 282
Singular Value Decompositionp. 288
LU Decompositionp. 289
Computational Requirementsp. 291
Adding a New Set of Measurementsp. 292
High-Resolution Beamformerp. 295
Appendicesp. 297
Maximum-Likelihood Beamformer Calculationsp. 297
QR Decomposition via Givens Rotationsp. 299
QR Decomposition via Modified Gram-Schmidtp. 303
QR Decomposition via Householder Transformationsp. 305
Singular Value Decompositionp. 307
An Example of LU-Decompositionp. 310
Cholesky Factorizationp. 312
Referencesp. 313
Mapping Matrix Algorithms onto Processor Arraysp. 315
Processor Arrays for Matrix Algorithmsp. 315
Application-Specific Processor Arraysp. 316
The Multimesh Graph Methodp. 319
Stages in a Mapping Techniquep. 319
Outline of the Multimesh Graph Methodp. 320
Class of Admissible Algorithmsp. 322
The Regularization Stagep. 324
The Mapping Stagep. 327
The Performance Evaluation Measuresp. 329
Mapping the Regularized Algorithmp. 329
Example: Mapping the LU Decomposition Algorithmp. 335
The Target Architecturep. 336
The LU Decomposition Algorithmp. 336
Mapping onto a Linear Arrayp. 338
Mapping onto a Two-Dimensional Arrayp. 341
Referencesp. 344
Recent Developmentsp. 347
Wigner-Ville Distributionp. 347
Focused Beamformerp. 351
Bispectrump. 354
Conclusionp. 356
Referencesp. 356
Glossaryp. 359
Indexp. 363
Table of Contents provided by Syndetics. All Rights Reserved.

´ëÇб³Àç/Àü¹®¼­Àû ºÐ¾ß¿¡¼­ ¸¹Àº ȸ¿øÀÌ ±¸¸ÅÇÑ Ã¥

    ¸®ºä

    0.0 (ÃÑ 0°Ç)

    100ÀÚÆò

    ÀÛ¼º½Ã À¯ÀÇ»çÇ×

    ÆòÁ¡
    0/100ÀÚ
    µî·ÏÇϱâ

    100ÀÚÆò

    0.0
    (ÃÑ 0°Ç)

    ÆǸÅÀÚÁ¤º¸

    • ÀÎÅÍÆÄÅ©µµ¼­¿¡ µî·ÏµÈ ¿ÀǸ¶ÄÏ »óÇ°Àº ±× ³»¿ë°ú Ã¥ÀÓÀÌ ¸ðµÎ ÆǸÅÀÚ¿¡°Ô ÀÖÀ¸¸ç, ÀÎÅÍÆÄÅ©µµ¼­´Â ÇØ´ç »óÇ°°ú ³»¿ë¿¡ ´ëÇØ Ã¥ÀÓÁöÁö ¾Ê½À´Ï´Ù.

    »óÈ£

    (ÁÖ)±³º¸¹®°í

    ´ëÇ¥ÀÚ¸í

    ¾Èº´Çö

    »ç¾÷ÀÚµî·Ï¹øÈ£

    102-81-11670

    ¿¬¶ôó

    1544-1900

    ÀüÀÚ¿ìÆíÁÖ¼Ò

    callcenter@kyobobook.co.kr

    Åë½ÅÆǸž÷½Å°í¹øÈ£

    01-0653

    ¿µ¾÷¼ÒÀçÁö

    ¼­¿ïƯº°½Ã Á¾·Î±¸ Á¾·Î 1(Á¾·Î1°¡,±³º¸ºôµù)

    ±³È¯/ȯºÒ

    ¹ÝÇ°/±³È¯ ¹æ¹ý

    ¡®¸¶ÀÌÆäÀÌÁö > Ãë¼Ò/¹ÝÇ°/±³È¯/ȯºÒ¡¯ ¿¡¼­ ½Åû ¶Ç´Â 1:1 ¹®ÀÇ °Ô½ÃÆÇ ¹× °í°´¼¾ÅÍ(1577-2555)¿¡¼­ ½Åû °¡´É

    ¹ÝÇ°/±³È¯°¡´É ±â°£

    º¯½É ¹ÝÇ°ÀÇ °æ¿ì Ãâ°í¿Ï·á ÈÄ 6ÀÏ(¿µ¾÷ÀÏ ±âÁØ) À̳»±îÁö¸¸ °¡´É
    ´Ü, »óÇ°ÀÇ °áÇÔ ¹× °è¾à³»¿ë°ú ´Ù¸¦ °æ¿ì ¹®Á¦Á¡ ¹ß°ß ÈÄ 30ÀÏ À̳»

    ¹ÝÇ°/±³È¯ ºñ¿ë

    º¯½É ȤÀº ±¸¸ÅÂø¿À·Î ÀÎÇÑ ¹ÝÇ°/±³È¯Àº ¹Ý¼Û·á °í°´ ºÎ´ã
    »óÇ°À̳ª ¼­ºñ½º ÀÚüÀÇ ÇÏÀÚ·Î ÀÎÇÑ ±³È¯/¹ÝÇ°Àº ¹Ý¼Û·á ÆǸÅÀÚ ºÎ´ã

    ¹ÝÇ°/±³È¯ ºÒ°¡ »çÀ¯

    ·¼ÒºñÀÚÀÇ Ã¥ÀÓ ÀÖ´Â »çÀ¯·Î »óÇ° µîÀÌ ¼Õ½Ç ¶Ç´Â ÈÑ¼ÕµÈ °æ¿ì
    (´ÜÁö È®ÀÎÀ» À§ÇÑ Æ÷Àå ÈѼÕÀº Á¦¿Ü)

    ·¼ÒºñÀÚÀÇ »ç¿ë, Æ÷Àå °³ºÀ¿¡ ÀÇÇØ »óÇ° µîÀÇ °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì
    ¿¹) È­ÀåÇ°, ½ÄÇ°, °¡ÀüÁ¦Ç°(¾Ç¼¼¼­¸® Æ÷ÇÔ) µî

    ·º¹Á¦°¡ °¡´ÉÇÑ »óÇ° µîÀÇ Æ÷ÀåÀ» ÈѼÕÇÑ °æ¿ì
    ¿¹) À½¹Ý/DVD/ºñµð¿À, ¼ÒÇÁÆ®¿þ¾î, ¸¸È­Ã¥, ÀâÁö, ¿µ»ó È­º¸Áý

    ·½Ã°£ÀÇ °æ°ú¿¡ ÀÇÇØ ÀçÆǸŰ¡ °ï¶õÇÑ Á¤µµ·Î °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì

    ·ÀüÀÚ»ó°Å·¡ µî¿¡¼­ÀÇ ¼ÒºñÀÚº¸È£¿¡ °üÇÑ ¹ý·üÀÌ Á¤ÇÏ´Â ¼ÒºñÀÚ Ã»¾àöȸ Á¦ÇÑ ³»¿ë¿¡ ÇØ´çµÇ´Â °æ¿ì

    »óÇ° Ç°Àý

    °ø±Þ»ç(ÃâÆÇ»ç) Àç°í »çÁ¤¿¡ ÀÇÇØ Ç°Àý/Áö¿¬µÉ ¼ö ÀÖÀ½

    ¼ÒºñÀÚ ÇÇÇغ¸»ó
    ȯºÒÁö¿¬¿¡ µû¸¥ ¹è»ó

    ·»óÇ°ÀÇ ºÒ·®¿¡ ÀÇÇÑ ±³È¯, A/S, ȯºÒ, Ç°Áúº¸Áõ ¹× ÇÇÇغ¸»ó µî¿¡ °üÇÑ »çÇ×Àº ¼ÒºñÀÚºÐÀïÇØ°á ±âÁØ (°øÁ¤°Å·¡À§¿øȸ °í½Ã)¿¡ ÁØÇÏ¿© 󸮵Ê

    ·´ë±Ý ȯºÒ ¹× ȯºÒÁö¿¬¿¡ µû¸¥ ¹è»ó±Ý Áö±Þ Á¶°Ç, ÀýÂ÷ µîÀº ÀüÀÚ»ó°Å·¡ µî¿¡¼­ÀÇ ¼ÒºñÀÚ º¸È£¿¡ °üÇÑ ¹ý·ü¿¡ µû¶ó ó¸®ÇÔ

    (ÁÖ)KGÀ̴Ͻýº ±¸¸Å¾ÈÀü¼­ºñ½º¼­ºñ½º °¡ÀÔ»ç½Ç È®ÀÎ

    (ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º´Â ȸ¿ø´ÔµéÀÇ ¾ÈÀü°Å·¡¸¦ À§ÇØ ±¸¸Å±Ý¾×, °áÁ¦¼ö´Ü¿¡ »ó°ü¾øÀÌ (ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º¸¦ ÅëÇÑ ¸ðµç °Å·¡¿¡ ´ëÇÏ¿©
    (ÁÖ)KGÀ̴Ͻýº°¡ Á¦°øÇÏ´Â ±¸¸Å¾ÈÀü¼­ºñ½º¸¦ Àû¿ëÇÏ°í ÀÖ½À´Ï´Ù.

    ¹è¼Û¾È³»

    • ±³º¸¹®°í »óÇ°Àº Åùè·Î ¹è¼ÛµÇ¸ç, Ãâ°í¿Ï·á 1~2Àϳ» »óÇ°À» ¹Þ¾Æ º¸½Ç ¼ö ÀÖ½À´Ï´Ù.

    • Ãâ°í°¡´É ½Ã°£ÀÌ ¼­·Î ´Ù¸¥ »óÇ°À» ÇÔ²² ÁÖ¹®ÇÒ °æ¿ì Ãâ°í°¡´É ½Ã°£ÀÌ °¡Àå ±ä »óÇ°À» ±âÁØÀ¸·Î ¹è¼ÛµË´Ï´Ù.

    • ±ººÎ´ë, ±³µµ¼Ò µî ƯÁ¤±â°üÀº ¿ìü±¹ Åù踸 ¹è¼Û°¡´ÉÇÕ´Ï´Ù.

    • ¹è¼Ûºñ´Â ¾÷ü ¹è¼Ûºñ Á¤Ã¥¿¡ µû¸¨´Ï´Ù.

    • - µµ¼­ ±¸¸Å ½Ã 15,000¿ø ÀÌ»ó ¹«·á¹è¼Û, 15,000¿ø ¹Ì¸¸ 2,500¿ø - »óÇ°º° ¹è¼Ûºñ°¡ ÀÖ´Â °æ¿ì, »óÇ°º° ¹è¼Ûºñ Á¤Ã¥ Àû¿ë