ICASSP '80. IEEE International Conference on Acoustics, Speech, and Signal Processing
DOI: 10.1109/icassp.1980.1171076
|View full text |Cite
|
Sign up to set email alerts
|

Frequency domain data transmission using reduced computational complexity algorithms

Abstract: In this paper we describe a frequency domain data transmission method to be used for digital data transmission over analog telephone lines which exploits recently derived reduced computational complexity algorithms, such as the Winograd Fourier Transform, to achieve a significantly lower computational rate than comparable time domain QAM modems implemented digitally using signal processing techniques. In addition to the lower computational rate, the proposed method also allows for better channel bandwidth util… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
184
0
9

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 408 publications
(205 citation statements)
references
References 3 publications
1
184
0
9
Order By: Relevance
“…From the figure it is also clear that maximizing a is desirable, within (19), in order to widen the low quantization noise region around DC. Recall that the goal is to minimize the residual quantization noise in the spatial frequency bins which carry data rather than minimizing the total quantization noise power.…”
Section: Halftoning Designmentioning
confidence: 99%
See 1 more Smart Citation
“…From the figure it is also clear that maximizing a is desirable, within (19), in order to widen the low quantization noise region around DC. Recall that the goal is to minimize the residual quantization noise in the spatial frequency bins which carry data rather than minimizing the total quantization noise power.…”
Section: Halftoning Designmentioning
confidence: 99%
“…The receive image is equal to the linear convolution of the transmit image and the channel PSF. By appending a cyclic extension [14,19] around the image, whose size is at least half the channel memory, the periodicity assumption of the DFT is satisfied and equalization is a complex multiplication per spatial frequency bin. In this case, the channel model (1) can be simplified in discrete spatial frequency domain (k 1 , k 2 ) as…”
Section: Spatial Discrete Multitone Modulationmentioning
confidence: 99%
“…Throughout the paper, we assume that the length of the cyclic prefix (CP) in the OFDM system is greater than the length of the discrete-time baseband channel impulse response. This assumption guarantees that the frequency-selective fading channel indeed decouples into a set of parallel frequency-flat fading channels [18].…”
Section: A Ofdm-based Spatial Multiplexingmentioning
confidence: 99%
“…Similarly, as in standard OFDM, the length of OFDM signal x is further extended by a cyclic prefix (CP) as illustrated in [22]. The use of CP provides some guard interval (GI) between consecutive OFDM transmissions, and involves copying the last N CP samples in x and placing them before the first sample in x. CP also serves to reduce channel induced inter-symbol interference (ISI).…”
Section: Transmittermentioning
confidence: 99%