Browse Prior Art Database

Diversity Multiplexing

IP.com Disclosure Number: IPCOM000091310D
Original Publication Date: 1968-Jan-01
Included in the Prior Art Database: 2005-Mar-05
Document File: 2 page(s) / 30K

Publishing Venue

IBM

Related People

Corr, FP: AUTHOR [+3]

Abstract

Where signals are transmitted through media which imposes selective fading on one or more channels, arrangements must be devised to insure that whatever information was contained on the faded channel is not lost. The described technique adds redundancy into the transmitted message by spreading n messages over m channels where m is greater than or equal to n. Messages, n in number, can be recovered without error on a noiseless but selective fading transmission medium if up to m-n channel fail.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 81% of the total text.

Page 1 of 2

Diversity Multiplexing

Where signals are transmitted through media which imposes selective fading on one or more channels, arrangements must be devised to insure that whatever information was contained on the faded channel is not lost. The described technique adds redundancy into the transmitted message by spreading n messages over m channels where m is greater than or equal to n. Messages, n in number, can be recovered without error on a noiseless but selective fading transmission medium if up to m-n channel fail.

This communications system uses this technique. Transmitter 1 transmits the signals >X(i) = sigma a(ij)e(j) i=1, 2...m| j=1, 2...n x = AE.

Here n = the number of messages which can be samples or functions of time, m = the number of channels, e(j) =jth message a(ij) = a linear transformation, multiplex, coefficient, x(i) = ith transmitted signal, E = the column matrix e(j) where j=1, 2...n, A = the linear transformation coefficient matrix, and S = the matrix of x(i) where i=1, 2...m.

Assuming the transmission path can be characterized by a diagonal matrix, receiver 2 sees a signal X' = TX. Here T = the diagonal transformation matrix characterizing the transmission media, and X' = the matrix characterizing the received signal.

If m-n channels are deleted from X' and all the remaining channels are assumed not to have deteriorated since transmission, a matrix B can be found such that E = BR>TAE|, where R = the matrix deleting m-n channels, rows.

Delete...