東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

RF-to-text transcription without pri...

Johnson, Jeffrey Robert.

Linked to FindBook

Google Book

Amazon

博客來

RF-to-text transcription without prior knowledge of modulation format, channel- or source-coding.

Record Type:	Electronic resources : Monograph/item
Title/Author:	RF-to-text transcription without prior knowledge of modulation format, channel- or source-coding./
Author:	Johnson, Jeffrey Robert.
Description:	288 p.
Notes:	Source: Dissertation Abstracts International, Volume: 66-04, Section: B, page: 2285.
Contained By:	Dissertation Abstracts International66-04B.
Subject:	Engineering, System Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3170638
ISBN:	0542070812

RF-to-text transcription without prior knowledge of modulation format, channel- or source-coding.
Johnson, Jeffrey Robert.

RF-to-text transcription without prior knowledge of modulation format, channel- or source-coding. - 288 p.

Source: Dissertation Abstracts International, Volume: 66-04, Section: B, page: 2285.

Thesis (Ph.D.)--Vanderbilt University, 2005.

Documented prior investigations in signal classification for non-cooperative communications have focused on modulation recognition. Modulation assigns message-bearing symbols to waveforms selected for near optimal propagation through a given radio frequency communications channel. Waveform design for modern data communications systems augments modulation with coding, compression, and interleaving. So, communications protocols number in the thousands. Under conventional design methodologies each protocol requires a unique receiver structure or a signal classifier which can configure a programmable demodulator and/or decoder for one of a number previously anticipated signals types. Our investigation revealed that for each known human language, a single schema can be used to recover text messages from all members of the class of unencrypted proforma signals without regard to the specific method for synthesizing those signals.

ISBN: 0542070812Subjects--Topical Terms:

1018128
Engineering, System Science.

RF-to-text transcription without prior knowledge of modulation format, channel- or source-coding.
LDR:03610nmm 2200301 4500 001 1813459
005 20060503131725.5
008 130610s2005 eng d
020 $a 0542070812
035 $a (UnM)AAI3170638
035 $a AAI3170638
040 $a UnM $c UnM
100 1 $a Johnson, Jeffrey Robert. $3 1902963
245 1 0 $a RF-to-text transcription without prior knowledge of modulation format, channel- or source-coding.
300 $a 288 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-04, Section: B, page: 2285.
500 $a Director: Mitchell Wilkes.
502 $a Thesis (Ph.D.)--Vanderbilt University, 2005.
520 $a Documented prior investigations in signal classification for non-cooperative communications have focused on modulation recognition. Modulation assigns message-bearing symbols to waveforms selected for near optimal propagation through a given radio frequency communications channel. Waveform design for modern data communications systems augments modulation with coding, compression, and interleaving. So, communications protocols number in the thousands. Under conventional design methodologies each protocol requires a unique receiver structure or a signal classifier which can configure a programmable demodulator and/or decoder for one of a number previously anticipated signals types. Our investigation revealed that for each known human language, a single schema can be used to recover text messages from all members of the class of unencrypted proforma signals without regard to the specific method for synthesizing those signals.
520 $a Channel and error control coding; data compression; and encryption are remappings of a M-ary symbol set to achieve three different sets of goals. Channel coding remaps a sequence of bits to a sequence of waveform primitives that fulfills certain synchronization and spectral occupancy requirements; error control coding augments a bit sequence with redundant bits that are also transmitted through the communications channel and are used at the receiver to detect and correct transmission errors. Data compression replaces a symbol sequence sufficient to carry a certain message with an equivalent, strictly necessary sequence. Encryption may operate on the M-ary symbols or their component bits. In either case, components of a message are resequenced or interleaved so that message content can not be inferred either from the symbols transmitted or their statistics. In the receiver developed in this investigation, digitized samples from the analog communications channel are collected into frames corresponding to single K-bit symbol segments. We assume the message is in a known human language. These symbol segments are labeled arbitrarily on the basis of their order of appearance in a given message, then the sequence of labels is de-interleaved and statistically analyzed on an iterative basis until a measure of language structure is satisfied. At this point, the co-occurrence statistics of the groups of arbitrarily labeled symbol segments are associated with text symbol groups in the assumed language. The symbol labeling process is based on finding waveform critical points in the presence of broadband random noise and so is independent of source coding, error-control coding, channel coding, and modulation type.
590 $a School code: 0242.
650 4 $a Engineering, System Science. $3 1018128
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0790
690 $a 0984
690 $a 0544
710 2 0 $a Vanderbilt University. $3 1017501
773 0 $t Dissertation Abstracts International $g 66-04B.
790 1 0 $a Wilkes, Mitchell, $e advisor
790 $a 0242
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3170638