GB2433397A - Multiple access communication systems - Google Patents

Multiple access communication systems Download PDF

Info

Publication number
GB2433397A
GB2433397A GB0525641A GB0525641A GB2433397A GB 2433397 A GB2433397 A GB 2433397A GB 0525641 A GB0525641 A GB 0525641A GB 0525641 A GB0525641 A GB 0525641A GB 2433397 A GB2433397 A GB 2433397A
Authority
GB
United Kingdom
Prior art keywords
orthogonal
user
block
sub
spreading
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
GB0525641A
Other versions
GB0525641D0 (en
GB2433397B (en
Inventor
Justin Coon
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Toshiba Europe Ltd
Original Assignee
Toshiba Research Europe Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Toshiba Research Europe Ltd filed Critical Toshiba Research Europe Ltd
Priority to GB0525641A priority Critical patent/GB2433397B/en
Publication of GB0525641D0 publication Critical patent/GB0525641D0/en
Priority to US11/534,791 priority patent/US8228784B2/en
Priority to JP2006339358A priority patent/JP4346639B2/en
Publication of GB2433397A publication Critical patent/GB2433397A/en
Application granted granted Critical
Publication of GB2433397B publication Critical patent/GB2433397B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/0001Arrangements for dividing the transmission path
    • H04L5/0014Three-dimensional division
    • H04L5/0016Time-frequency-code
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/16Code allocation
    • H04J13/18Allocation of orthogonal codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • H04L27/2602Signal structure
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • H04L27/2614Peak power aspects
    • H04L27/2615Reduction thereof using coding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B2201/00Indexing scheme relating to details of transmission systems not covered by a single group of H04B3/00 - H04B13/00
    • H04B2201/69Orthogonal indexing scheme relating to spread spectrum techniques in general
    • H04B2201/707Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation
    • H04B2201/70703Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation using multiple or variable rates
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B2201/00Indexing scheme relating to details of transmission systems not covered by a single group of H04B3/00 - H04B13/00
    • H04B2201/69Orthogonal indexing scheme relating to spread spectrum techniques in general
    • H04B2201/707Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation
    • H04B2201/70706Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation with means for reducing the peak-to-average power ratio
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B2201/00Indexing scheme relating to details of transmission systems not covered by a single group of H04B3/00 - H04B13/00
    • H04B2201/69Orthogonal indexing scheme relating to spread spectrum techniques in general
    • H04B2201/707Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation
    • H04B2201/7097Direct sequence modulation interference
    • H04B2201/709709Methods of preventing interference
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/14Relay systems
    • H04B7/15Active relay systems
    • H04B7/204Multiple access
    • H04B7/208Frequency-division multiple access [FDMA]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/14Relay systems
    • H04B7/15Active relay systems
    • H04B7/204Multiple access
    • H04B7/216Code division or spread-spectrum multiple access [CDMA, SSMA]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0074Code shifting or hopping
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L2025/0335Arrangements for removing intersymbol interference characterised by the type of transmission
    • H04L2025/03375Passband transmission
    • H04L2025/03414Multicarrier
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L2025/0335Arrangements for removing intersymbol interference characterised by the type of transmission
    • H04L2025/03426Arrangements for removing intersymbol interference characterised by the type of transmission transmission using multiple-input and multiple-output channels
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/0202Channel estimation
    • H04L25/024Channel estimation channel estimation algorithms
    • H04L25/0242Channel estimation channel estimation algorithms using matrix methods
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L25/03159Arrangements for removing intersymbol interference operating in the frequency domain
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • H04L27/2602Signal structure
    • H04L27/2605Symbol extensions, e.g. Zero Tail, Unique Word [UW]
    • H04L27/2607Cyclic extensions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/0001Arrangements for dividing the transmission path
    • H04L5/0026Division using four or more dimensions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/02Channels characterised by the type of signal
    • H04L5/023Multiplexing of multicarrier modulation signals
    • H04L5/026Multiplexing of multicarrier modulation signals using code division

Abstract

A multiple-access communication system uses spreading codes which may be orthogonal, shift orthogonal or self shift orthogonal. Blocks of symbols spread with these codes are pre-coded prior to transmission to effect a phase rotation in the blocks. A guard interval, cyclic prefix or zero padding is then added to the symbols prior to transmission. Reverse operations occur at the receiver. The system eliminates multi-user interference (MUI). Particular embodiments described include reduced-complexity SC-FDMA, reduced-complexity OFDMA and self shift orthogonal CP-CDMA.

Description

<p>M&C Folio: GBP93914 Document: 1137286</p>
<p>A CONFIGURABLE BLOCK CDMA SCHEME</p>
<p>This invention relates to a method of generating a signal for transmission. More particularly it relates to a method of generating a signal for multiple access transmission. It also relates to a method of receiving such a signal.</p>
<p>The invention relates to a block CDMA scheme that is general by nature, but encompasses several special cases, two of which are reduced-complexity multiple access techniques that are related to OFDMA and SC-FDMA.</p>
<p>Code division multiple access (CDMA) is a popular multiple access technique that is used to support multiple users simultaneously in a network. Many variants of CDMA exist, including direct sequence (DS) CDMA, multi-carrier (MC) CDMA, cyclic prefixed (CP) CDMA, and chip interleaved block spread (CIBS) CDMA. In addition to these variations, many receiver architectures are often available for implementation in CDMA systems, such as the well-known RAKE receiver, interference cancellation receivers, and receivers that rely on channel equalisation.</p>
<p>Some CDMA schemes are interference limited; that is to say, as the number of users in the network increases, residual interference caused by each user eventually also increases and eventually cripples the network, thus rendering simultaneous multiple access nearly impossible. This residual interference generally results from the loss of orthogonality amongst users, which primarily occurs when the channel is temporally dispersive.</p>
<p>Several recent developments in block CDMA systems, including so-called generalised MC-CDMA' (GMC-CDMA), CIBS-CDMA, single-carrier frequency division multiple access (SC-FDMA) (also known as DFT-spread OFDM), and a throughput-efficient block CDMA system, have led to multi-user interference (MIJI) free transmission techniques.</p>
<p>US 2004120274, incorporated herein by reference, discloses CDMA transceiver techniques for wireless communications.</p>
<p>US 2002126740, also incorporated herein by reference, proposes chip-interleaved, block-spread multi-user communication.</p>
<p>An example of a so-called generalised MC-CDMA' system is described in "Wireless multicarrier communications", Zhendao Wang, Giarinakis, G.B., Signal Processing Magazine, Vol. 17, No. 3, pages 29 -48, May 2000, incorporated herein by reference.</p>
<p>Shengli Zhou, Giannakis, G.B., Le Martret, C. describe a system using CIBS-CDMA in: "Chip-interleaved block-spread code division multiple access", IEEE Transactions on Communications, Vol. 50, No. 2, pages 235 -248, February 2002, incorporated herein by reference.</p>
<p>Single-carrier frequency division multiple access using DFT-spread OFDM is described in "Performance comparison of distributed FDMA and localised FDMA with frequency hopping for EUTRA uplink," NEC Group and NTT DoCoMo, TSG RAN WG1 Meeting 42 Rl-050791, August 2005, incorporated herein by reference, and "A low complexity transmitter structure for OFDM-FDMA uplink systems", D. Galda and H. Rohling, in Proceedings of the iEEE Vehicular Technology Conference (VTC), Vol. 4, pages 1737-1 741, May 2002, also incorporated herein by reference.</p>
<p>A throughput-efficient block CDMA system has been proposed by S. Tomasin and F. Tosato: "Throughput Efficient Block-Spreading CDMA: Sequence Design and Performance Comparison" in: Proceedings of the IEEE Global Telecommunications Conference (Globecom), November -December 2005, incorporated herein by reference.</p>
<p>In these systems, any number of users -up to a given maximum number -can theoretically transmit simultaneously without causing any degradation in system performance. However, beyond this maximum number of allowable users, the system becomes interference limited in a similar manner to other CDMA systems.</p>
<p>The invention can be briefly summarised as follows: the proposed method aims to combine the advantages of many of the M1UI-free techniques described above, while overcoming their respective disadvantages. In particular, the invention addresses three important special cases: reduced-complexity SC-FDMA, reduced-complexity OFDMA, and seif-shifi-orthogonal CP-CDMA. These methods are of particular interest since they represent scalable, low-complexity, M1JI-free techniques. Furthermore, these techniques can easily be extended to multiple-input multiple-output (MIMO) systems.</p>
<p>As will be seen from the detailed description below, the present invention offers a number of advantages over the known systems. In particular, the present invention supports sub-block precoding and decoding. This flexibility can be used to reduce the peak-to-average power ratio (PAPR) of the transmission or increase the robustness of the transmission (by spreading across the bandwidth andlor introducing redundancy).</p>
<p>It is worth noting that the precoding and decoding according to the present invention is not supported by the prior-art systems.</p>
<p>Furthermore, the present invention is highly configurable through the precoders and decoders as will be discussed below. As a result, it is easy, for example, to switch between single-carrier and multi-carrier transmissions by simply including an Inverse Discrete Fourier Transform (1DFT) in the precoder/decoder design.</p>
<p>In a first aspect of the present invention, a method of generating a signal for multiple access transmission comprises spreading blocks of symbols in time or frequency by applying a user-specific spreading code; and applying a guard interval in the form of a cyclic prefix (CP) or zero padding (ZP) to separate different spread blocks, wherein the spreading code is selected from the group comprising orthogonal, mutually shift-orthogonal, and sell-shift orthogonal spreading codes.</p>
<p>In one configuration of the above aspect, the user-specific spreading codes are orthogonal and mutually shift-orthogonal.</p>
<p>In another configuration of the above aspect, the user-specific spreading codes are orthogonal but not mutually shift-orthogonal.</p>
<p>In a further configuration of the above aspect, the user-specific spreading codes are mutually shift-orthogonal but not orthogonal.</p>
<p>In yet another configuration of the above aspect, the user-specific spreading codes are orthogonal, mutually shift-orthogonal, and self-shift-orthogonal.</p>
<p>In a configuration of the above aspect, the length of the user-specific spreading codes may change so as to change the data rate for each user.</p>
<p>In a further configuration of the above aspect, precoding is applied to each sub-block of data in a spread block. The precoding may further comprise linear transmit filtering.</p>
<p>In a more particular configuration of the preceding configuration, the step of precoding comprises the step of applying linear transmit filtering.</p>
<p>In another configuration of the above aspect, the step of precoding comprises progressively rotating the phase of each sub-block identically by a user-dependent amount.</p>
<p>In a more particular configuration of the preceding configuration, the step of precoding comprises first applying an inverse discrete Fourier transform (IDFT) to each sub-block and then progressively rotating the phase of each sub-block identically by a user-dependent amount.</p>
<p>In another configuration of the above aspect, a plurality of antennas for transmission are utilised for transmission.</p>
<p>In a further configuration of the above aspect, identical spreading codes are applied to the signals at all transmit antennas for a given user.</p>
<p>In yet another configuration of the above aspect, different spreading codes are applied to any combination of some or all of the signals at various transmit antennas for a given user.</p>
<p>In another aspect of the present invention a method of receiving a signal from multiple access transmission comprises removing the guard interval (CP/ZP); and dc-spreading by correlating the received signal with the desired user's spreading code In one configuration of the above aspect, each sub-block of received data in a spread block is decoded.</p>
<p>In another configuration of the above aspect, the phase of each sub-block is identically progressively rotated in phase by a user-dependent amount.</p>
<p>In yet another configuration of the above aspect, a discrete Fourier transform (DFT) is applied to each phase-rotated sub-block.</p>
<p>In a further configuration of the above aspect, a single-tap frequency-domain equaliser is applied to the dc-spread data at the output of the filter.</p>
<p>In yet a further configuration of the above aspect, the equalised signal is transformed into the time domain with an IDFT for further processing.</p>
<p>In another aspect of the above aspect, a plurality of antennas are utilised for receiving.</p>
<p>These and other aspects of the invention will now be further described, by way of example only, with reference to the accompanying figures in which: Figure 1 shows a block diagram of a transmitter/receiver structure according to the invention.</p>
<p>Figure 2 illustrates the spreading operation.</p>
<p>Figure 3 shows an example of users' signals interfering with each other in the channel and combining at the receiver.</p>
<p>Figure 4 illustrates bandwidth utilisation when DFT codes are used as spreading codes and when self-shift-orthogonal spreading codes are used.</p>
<p>Figure 5 illustrates user separation and subsequent MIMO detection.</p>
<p>Figure 6 shows joint user and multiple stream separation.</p>
<p>Figure 7 shows the complexity of frequency-domain equalisation vs. sub-block length for distributed SC-FDMA systems with R 33.</p>
<p>Figure 8 shows a block diagram of a MIMO system incorporating the invention.</p>
<p>A method of generating a signal for multiple access transmission is disclosed. Also disclosed is a method of receiving a signal from multiple access transmission. In the following description a number of specific details are presented in order to provide a thorough understanding of embodiments of the present invention. It will be apparent, however, to a skilled person in the art that these specific details need not be employed to practice the present invention.</p>
<p>MULTIPLE ___________ PERFORMANCE_METRIC ____________ ____________</p>
<p>ACCESS MUD # INTERFERENCE USE OF TECHNIQUE PAPR COMPLEXITY REQUIRED OVERHEAD USERS LIMITED? FREQUENCY DS-CDMA ()) MODERATE (a) YESt () LOW (+) R (+) YES (-) GOOD (+) CP.CDMA (MODERATE))) MODERATE (a) YES (-) MODERATE (a) R(-i-) NO(+) GOOD (+) CIBS-CDMA (MODERATE LOW (+) NO (4-) HIGH (-) R (+) NO (+) GOOD (+)</p>
<p>SELF-SHIFT-</p>
<p>ORTHOGONAL MODERATE MODERATE (0) NO(-s-) MODERATE (o) Ri2 (-) NO (4-) GOOD (+)</p>
<p>CP-CDMA ____________ ___________ _________ ___________ ______ ____________ ____________</p>
<p>SC.FDMA (MODERATE ()) MODERATE (o) NO (+) MODERATE (a) R (-1-) NO (-I-) MODERATE (o)</p>
<p>REDUCED</p>
<p>COMPLEXITY,, , LOW (-1-) NO (+) MODERATE (0) R ( ) NO (-I-) MODERATE (a) SC.FDMA " MC-CDMA HIGH (-) MODERATE (o) YES)-) MODERATE (0) R (+) NO (+) MODERATE (0) OFDMA HIGH (-) MODERATE (a) NO (+) MODERATE (a) R(-s-) NO (+) POOR (-) REDUCED.</p>
<p>COMPLEXITY HIGH (-) LOW(-4-) NO(+) MODERATE(o) R(+) NO(1-) POOR(-)</p>
<p>OFDMA ___________ __________ ________ __________ _____ ___________ ___________</p>
<p>tAithough not required, it is beneficial to employ multi-user detection (MUD) on down-link DS-CDMA signals.</p>
<p>Table 1</p>
<p>A Summary of advantages and disadvantages of various multiple access techniques is shown in Table 1. Entries marked with (+) are desirable, entries marked with (-) are undesirable, and entries marked with (o) are in between. Entries inside brackets correspond to a down- link transmission, and entries without brackets relate to an up- link transmission; if only one value is present in a cell, that value relates to both the up-link and the down-link.</p>
<p>Table 1 gives an overview of the advantages and disadvantages of various multiple access techniques. The three entries entitled reduced-complexity SC-FDMA', reduced-complexity OFDMA', and self-shift-orthogonal CP-CDMA' are three configurations of the present invention. These embodiments will be described in detail below. As observed in this table, the proposed invention can be used to reduce the complexity of the system relative to the known systems which were mentioned above.</p>
<p>Alternatively, it can be used to lower the peak-to-average power ratio (PAPR) of a multiple access transmission. In short, the advantages that may be obtained by using the proposed invention are dependent upon the specific embodiment of the invention.</p>
<p>However, one advantage that the invention has is that it is easily configurable to all of the specific embodiments as will be described below.</p>
<p>The proposed invention has a general transmitter/receiver structure as illustrated in Figure 1. Data coming from the source is encoded before it is interleaved and subsequently mapped. Alternatively, one or both of the encoding and interleaving steps may be omitted. The key elements of this structure are the spreading/de-spreading blocks and the precoding block. Before transmitting, a guard interval is applied in the form of a cyclic prefix (CP) or zero padding (ZP) to separate different spread blocks.</p>
<p>Also shown in Figure 1, the receiver removes the guard interval before de-spreading the received signal. The equaliser block can, in general, represent any single-user, linear or nonlinear, time-domain or frequency-domain equaliser (i.e. linear zero forcing (ZF), linear minimum mean-squared error (MMSE), decision feedback equaliser (DFE), etc.). De-mapped and de-interleaved, the signal is then decoded for outputting to a data sink. Alternatively, one or both of the de-interleaving or decoding steps may be omitted.</p>
<p>Let us first consider the operation of the transmitter. The transmitted message is constructed in the form of a stream of bits that may be encoded andlor interleaved.</p>
<p>These bits are mapped to complex baseband symbols that are members of a given constellation, such as M-PSK or M-QAM where M is the number of elements in the constellation. The resulting complex constellation symbols are arranged into groups of N symbols.</p>
<p>Let the vector s(i) denote the uth user's length-N symbol (column) vector at time i.</p>
<p>The spreading operation shown in Figure 1 performs a simple R-fold repetition on the vector s(i), which can be mathematically defined as t (i) =(1R I)s (i) where 1R is the length-R column vector of ones, N is the N x N identity matrix, and is the Kronecker product operator. This repetition is illustrated in Figure 2. The skilled person will recognise that this block spreading' can be achieved by simple symbol spreading as in a convention DS-CDMA system followed by an appropriate chip interleaver.</p>
<p>Following the spreading operation, a precoding operation is applied to the data vector.</p>
<p>This precoder is linear; thus the precoded signal can be represented as ,, (i) = eat,, (i) where Q is the uth user's P' x P (possibly redundant) precoding matrix. Note that P = RN, P' = RI'.", N' = N and P' = P. If L is the memory order of the channel impulse response, it is important that N' = L + 1 holds true in order to perform low-complexity de-spreading and detection at the receiver.</p>
<p>Following the precoding operation, a cyclic extension is appended to the user's message. This extension takes the form of a cyclic prefix (CP) or zero padding (ZP). It is assumed that the CP/ZP consists of Q = L symbols so that inter-block interference is mitigated. It is further assumed that the channel remains static for the duration of each individual block. Consequently, the temporal argument i can be omitted from the following discussion without loss of generality.</p>
<p>We will now discuss the operation of the receiver. Assuming simultaneous synchronous transmission, the signals from all U users interfere with each other in the channel and are subsequently combined at the receiver as shown in Figure 3. Thus, the signal at the receiver, after removal of the CP/ZP, can be represented by r=Hx +v =>HUOU(1R IN)sU + v where H is a P' x P' circulant channel matrix describing the impulse response of the channel between the uth user and the receiver and v is a length-P' vector of zero-mean white Gaussian noise samples, each with a variance of o/2 per dimension.</p>
<p>The received vector r is passed through a de-spreader to separate the desired user's signal from all other users' signals, which gives c =I''r where f is the uth user's P' x N de-spreading matrix. Consequently, the precoding and de-spreading matrices should be designed such that c =4'HUOU(1R 1N)SU +I'V for all u. Furthermore, it is desirable from a detection point of view that the modified noise remains white. This design criterion can be summarised as follows: For MTJT-free communication, the precoding and de-spreading matrices should be designed such that G(u,u')_-'1'HUOU(1R IN)=ON, Vu,u'suchthatu!=u' and I''I'U=CIN, Vu where N is the Nx N matrix of zeros and c is a constant.</p>
<p>Finally, the length-N de-spread symbol vector Yu is passed through an equaliser to recover an estimate of the transmitted data. It is important to note that the de-spread symbol vector Yu ideally does not contain interference from other users. Consequently, any conventional single-user linear or non-linear equaliser can be applied to the de- spread signal.</p>
<p>The following considerations apply to the design of the precoding and de-spreading matrices. It can be shown that the circulant channel matrix H can be expressed as -IR 0 H0 + R H1 where JR is just R circularly shifted downward along its columns by one element, and H,o and H,1 are lower and upper N' x N' Toeplitz matrices that define the channel impulse response. With this representation of the channel matrix, it is intuitive to define the uth user's precoding matrix as follows: e,, =c A,, where C is an R x R diagonal spreading code matrix and A is an IV' x N sub-block precoding matrix. Similarly, the uth user's de-spreading matrix should be designed as follows: * where d is an R x 1 de-spreading vector and r is an N' x N sub-block decoding matrix. With these definitions, G(u,u') can be written as G(u,u') = dCU1R I'HUOAU + d'JRCU 1R I'H1A which shows that users can be perfectly separated at the receiver through careful design of the spreading codes (i.e. the elements on the diagonal of C) and the de-spreading vectors d.</p>
<p>Considering the equation above, the spreading and de-spreading codes can be designed.</p>
<p>The expression for G(u,u') given above suggests that in order for users to be perfectly separable at the receiver, the spreading codes for all users must be orthogonal (i.e. du'Cu1R=O for all u!=u') and mutually shift-orthogonal (i.e. d"1JRC1R0 for all u!=u').</p>
<p>Spreading codes that satisfy these criteria include the columns of an R x R DFT matrix, as may be easily verified.</p>
<p>Alternatively, the spreading codes can be defined such that they are orthogonal but not mutually shift-orthogonal. In this case, the sub-block precoding and decoding matrices can be designed such that they lie in the null space of the N' x N' upper triangular matrix H,1 as long as N' -L = N. For example, if N = 2 and N' = 5, the uth user's sub-block precoding matrix can be defined as k1 &2 A21 A2,2 A=0 0 or the uth user's sub-block decoding matrix can be defined as 0 0 0 0 r'=o 0 241 4,2 25,2 or both. Note that the important aspect about designing the sub- block precoders/decoders is that the only non-zero entries in the sub-block precoder matrix are confined to the first N rows while the only non-zero entries in the sub-block decoder matrix are confined to the last N rows. The benefit of designing the spreading codes and the precoder/decoder matrices in this fashion is that the design restrictions on the spreading codes are relaxed. As a result, it is possible to use real-valued lengthR Hadamard-Walsh sequences as spreading codes instead of complex-valued spreading sequences such as the columns of a DFT matrix. This result has significant implications for systems that use low-resolution digital-to-analogue converters (DACs) and analogue-to-digital converters (ADCs), such as UWB systems (where the DAC/ADC resolution is typically only four or five bits).</p>
<p>An alternative approach to designing the spreading codes is to ensure that the condition of mutual shift-orthogonality between user codes is met while orthogonality is not met.</p>
<p>In this case, there will be residual interference regardless of the precoder/decoder design since the matrix H,0 is always full rank and thus has an empty null space.</p>
<p>However, multi-user detection (MUD) techniques can still be used to recover the users' messages, although this approachis often computationally complex.</p>
<p>Finally, the spreading codes can be designed such that they are orthogonal, mutually shift-orthogonal, and self-shift-orthogonal (i.e. du''JRCu1RO for all u). The advantage of taking this approach is that the resulting received, dc-spread signal resembles a conventional single-carrier transmission that has passed through a linear time-invariant channel (rather than a circulant channel as has been the case up until now). Techniques such as successive interference cancellation and other conventional time-domain equalisers can be employed with ease given this scenario. Also, the transmitted signal in this case spans the entire bandwidth; thus, the frequency diversity in the channel is maximally exploited. In contrast, when the columns of a DFT matrix are used as spreading codes, the transmitted signal has an FDMA-like structure. This result is illustrated in Figure 4, which depicts bandwidth utilisation when DFT codes are used as spreading codes and when self-shift-orthogonal spreading codes are used. Defining C=ClR, an example of sequences with these orthogonality properties is given below: 1 -1 -1 -1 -1 2= 1 -1 -1 The codes given in this example can support two users simultaneously. It is important to note that the extra degree of freedom that is required to impose the self-shift-orthogonality condition on the sequences causes a reduction in the number of users that can be supported simultaneously in a network (by half).</p>
<p>The data rate is adapted by altering the length of the spreading codes. It is easy to see from the discussion above that the data rate of a user can be changed simply by altering the spreading factor R. If this approach were taken, the spreading codes themselves would change. For example, if R decreased from four to two (i.e. an increase in throughput), the spreading code for a given user might change from a length four DFT code to a length two Hadamard-Walsh code. The skilled engineer will recognise that there are an infinite number of possible alterations to the spreading codes and the spreading factor.</p>
<p>in the following, we will consider the phase-rotating precoder. As discussed above, a linear precoder can be applied to each sub-block prior to transmission. One special case of this precoder might take the form of a non-redundant (i.e. N' -A') length-N phase ramp. In this case, the uth user's sub-block precoding matrix should be designed as I 2,r 2,r 2g I 1-7, j2--j(N-I)-y, A =diag 1,e RN,e RN,...,e RN where diag {. . . } denotes the diagonal matrix with the elements in the argument on the diagonal and is a user-specific parameter that is an integer in the set {O, 1, ... ,R-1}.</p>
<p>We will now develop the corresponding phase-rotating decoder. As discussed above, a linear decoder can be applied to each received sub-block. One special case of this decoder might take the form of a non-redundant (i.e. N' = A') length-N phase ramp.</p>
<p>Typically, this decoder is used when the sub-block precoder is also a phase ramp. In this case, the uth user's sub-block decoding matrix should be equal to the uth user's sub-block precoding matrix, and is given by I.2,r 2ff 2ff I J-7, j2-y, j(N-I)-y, 1 =diag 1,e RN,e RN,...,e RN Turning now to the IDFT/Phase-Rotating Precoder, it is worth noting that in addition to applying a phase rotation, the precoder can be designed to include the IDFT operation.</p>
<p>In this special case, the precoder might take the form of a non-redundant (i.e. N' = A') N-point IDFT followed by a length-N phase ramp. Thus, the uth user's sub-block precoding matrix should be designed as I 2,r 2 2ff 1 , j2-y, j(N-I)-y, I H A =diag 1,e RN,e RN,...,e RN FN where FN is the N x N DFT matrix and is a user-specific parameter that is an integer in the set {O, 1,... ,R-l}.</p>
<p>Let us now consider the DFT/phase-rotating decoder. Although the sub-block decoding matrix comprises an IDFT, the actual application of the sub-block decoder involves the conjugate-transpose of this matrix, which results in the application of a DFT. The uth user's sub-block decoder can be designed to include the DFT operation. In this special case, the decoding matrix might take the form of a non-redundant (i.e. N' = A') N-point IDFT followed by a length-N phase ramp. Typically, this decoder is used when the sub-block precoder is a phase ramp or an IDFT followed by a phase ramp as discussed above. This decoding matrix is given by I 2,r 2r 2r) I i-jr j2--y I H F=diag 1,e,e,...,e FN.</p>
<p>A single-tap equaliser is applied to the de-spread, decoded message. When the sub- block decoder includes a DFT operation as specified above, a single-tap frequency-domain equaliser can be employed to remove distortion from the decoded message.</p>
<p>This equaliser can be designed according to any number of criteria that can be found in the literature, such as zero forcing (ZF), minimum mean-squared error (MMSE), decision feedback, etc. When the sub-block precoding matrix does not perform the IDFT on each transmitted sub-block (i.e. the transmitted message is defined in the time domain as with single-carrier transmissions), the equalised frequency-domain message at the receiver should be transformed back into the time domain with an N-point IDFT for further processing, such as channel decoding and symbol mapping.</p>
<p>In the following, the use of multiple transmit andlor receive antennas is considered.</p>
<p>When multiple transmit antennas are employed, the techniques described above can be applied at each of the antennas. In particular, different spreading codes can be applied to any subset of the messages at the different transmit antennas for a single user. For example, the same spreading code can be applied to the messages at all transmit antennas, in which case the receiver can de-spread the received signal to recover the desired user's multi-antenna transmission. This case is illustrated in Figure 5 depicting user separation and subsequent MIMO detection. It is observed that the well-studied multiple-input multiple-output (MIMO) detection problem remains after the de-spreading process is complete.</p>
<p>Alternatively, a different spreading code can be applied at each transmit antenna for a single user. In this case, the receiver is able to separate all users as well as a single user's messages that were transmitted from the various transmit antennas as shown in Figure 6. Joint user and multiple stream separation is illustrated with the example of user 1 and user 2 simultaneously transmitting streams to receiver RX. In this example each of users 1 and 2 uses three code vectors {c11}, {c12}, {c13}, and {c21}, {c22}, {c23}, respectively for precoding the streams. Upon reception, receiver RX de-spreads the streams from users 1 and 2 received at each antenna q. Eventually, the received message is equalised. If multiple receive antennas are employed, the received message is de-spread for each receive antenna prior to further processing such as MIMO detection.</p> <p>The present invention described above encompasses at least three
special cases which all have their own characteristics. Each of these cases is defined by the spreading code used and the design of the sub-block precoding/decoding matrices. In the following, the advantages of each of these three special cases are summarised.</p>
<p>Reduced-Complexity SC-FDMA * Spreading code: columns of a DFT matrix * Sub-block precoding matrix: N x N phase ramp * Sub-block decoding matrix: N x N phase ramp The main advantage of the reduced-complexity SC-FDMA special case is, as the name implies, a reduction in complexity over conventional SC-FDMA systems. This reduction follows from the fact that only an N-point DFT/IDFT is required to perform frequency-domain equalisation as opposed to an RN-point DFT/]DFT, which is used in conventional SC-FDMA techniques. This complexity reduction is illustrated in Figure 7, displaying the complexity of frequency-domain equalisation versus sub-block length for distributed SC-FDMA systems with R 33.</p>
<p>Reduced-Complexity OFDMA * Spreading code: columns of a DFT matrix * Sub-block precoding matrix: IDFT, Nx N phase ramp * Sub-block decoding matrix: IDFT, Nx Nphase ramp As with reduced-complexity SC-FDMA, the main advantage of the reduced-complexity OFDMA special case is a reduction in complexity over conventional OFDMA systems.</p>
<p>This reduction follows from the fact that only an N-point DFT/IDFT is required to perform frequency-domain equalisation as opposed to an RN-point DFT/IDFT, which is used in conventional SC-FDMA techniques. This complexity reduction is illustrated in Figure 7.</p>
<p>Self-Shift-Orthogonal CP(ZP)-CDMA * Spreading code: self-shift-orthogonal sequences * Sub-block precoding matrix: anything * Sub-block decoding matrix: anything The main advantage of the self-shift-orthogonal method is its efficient exploitation of frequency diversity in the channel. In the two aforementioned special cases, MUI-free transmission is maintained through an FDMA-like transmission structure. This is not the case in self-shift-orthogonal transmissions, which spread the data across the bandwidth as shown in Figure 4.</p>
<p>A typical block diagram of a MIMO system incorporating the invention is illustrated for convenience in Figure 8. Data coming from the source is encoded before it is interleaved and subsequently mapped. Alternatively, one or both of the encoding and interleaving steps may be omitted. The serial data stream is then converted into a number of parallel data streams. The key elements of this structure are again the spreading/de-spreading blocks and the precoding block through which the now parallel streams are passed. Before transmitting, a guard interval is applied to each stream in the form of a cyclic prefix (CP) or zero padding (ZP) to separate different spread blocks.</p>
<p>Also shown in Figure 8, the receiver removes the guard interval of each stream before de-spreading the received parallel signals. As described earlier, the equaliser block can, in general, represent any single-user, linear or nonlinear, time-domain or frequency-domain equaliser (i.e. linear zero forcing (ZF), linear minimum mean-squared error (MMSE), decision feedback equaliser (DFE), etc.). The parallel streams are then converted into a serial data stream. De-mapped and de-interleaved, the signal is decoded for outputting to a data sink. Alternatively, one or both of the interleaving or decoding steps may be omitted.</p>
<p>No doubt many other effective alternatives will occur to the skilled person. It will be understood that the invention is not limited to the described embodiments and encompasses modifications apparent to those skilled in the art lying within the spirit and scope of the claims appended hereto.</p>

Claims (1)

  1. <p>CLAIMS</p>
    <p>1. A method of generating a signal comprising a sequence of symbols for multiple access transmission, the method comprising: spreading blocks of symbols in time or frequency by applying a user-specific spreading code; and applying a guard interval in the form of a cyclic prefix (CP) or zero padding (ZP) to separate different spread blocks, wherein the spreading code is selected from the group comprising orthogonal, mutually shift-orthogonal, and self-shift orthogonal spreading codes.</p>
    <p>2. The method according to claim 1, wherein the user-specific spreading codes are orthogonal and mutually shift-orthogonal.</p>
    <p>3. The method according to claim 1, wherein the user-specific spreading codes are orthogonal but not mutually shift-orthogonal.</p>
    <p>4. The method according to claim 1 wherein the user-specific spreading codes are mutually shift-orthogonal but not orthogonal.</p>
    <p>5. The method according to claim 1 wherein the user-specific spreading codes are orthogonal, mutually shift-orthogonal, and self-shift-orthogonal.</p>
    <p>6. The method according to any one of the preceding claims, wherein the length of the user-specific spreading codes may change so as to change the data rate for each user.</p>
    <p>7. The method according to any one of the preceding claims, further comprising the step of applying precoding to each sub-block of data in a spread block.</p>
    <p>8. The method according to claim 7, where the step of precoding comprises progressively rotating the phase of each sub-block identically by a user-dependent amount.</p>
    <p>9. The method according to claim 7, wherein the step of precoding comprises first applying an inverse discrete Fourier transform (IDFT) to each sub-block and then progressively rotating the phase of each sub-block identically by a user-dependent amount.</p>
    <p>10. The method according to any of the preceding claims further comprising the step of utilising a plurality of antennas for transmission.</p>
    <p>11. The method according to claim 10, wherein identical spreading codes are applied to the signals at all transmit antennas for a given user.</p>
    <p>12. The method according to claim 10 wherein different spreading codes are applied to any combination of some or all of the signals at various transmit antennas for a given user.</p>
    <p>13. A method of receiving a signal comprising a sequence of symbols from multiple access transmission, the method comprising: removing the guard interval in the form of a cyclic prefix (CP) or zero padding (ZP) to obtain different spread blocks; de-spreading the blocks of symbols in time or frequency by applying a user-specifics spreading code, wherein the spreading code is selected from the group comprising orthogonal, mutually shift-orthogonal, and self-shift orthogonal spreading codes.</p>
    <p>14. The method according to claim 13 further comprising the step of decoding each sub-block of received data in a spread block.</p>
    <p>15. The method according to any one of claims 13 or 14, where the decoder progressively rotates the phase of each sub-block identically by a user-dependent amount.</p>
    <p>16. The method according to claim 15 wherein the step of decoding further comprises applying a discrete Fourier transform (DFT) to each phase-rotated sub-block.</p>
    <p>17. The method according to claim 16 wherein the step of decoding further comprises applying a single-tap frequency-domain equaliser to the de-spread data at the output of the filter.</p>
    <p>18. The method according to claim 17, further comprising the step of transforming the equalised signal into the time domain with an JDFT for further processing.</p>
    <p>19. The method according to any one of claims 13 to 18 further comprising the step of utilising a plurality of receiving antennas.</p>
GB0525641A 2005-12-16 2005-12-16 A configurable block cdma scheme Expired - Fee Related GB2433397B (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
GB0525641A GB2433397B (en) 2005-12-16 2005-12-16 A configurable block cdma scheme
US11/534,791 US8228784B2 (en) 2005-12-16 2006-09-25 Configurable block CDMA scheme
JP2006339358A JP4346639B2 (en) 2005-12-16 2006-12-18 Configurable block CDMA scheme

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB0525641A GB2433397B (en) 2005-12-16 2005-12-16 A configurable block cdma scheme

Publications (3)

Publication Number Publication Date
GB0525641D0 GB0525641D0 (en) 2006-01-25
GB2433397A true GB2433397A (en) 2007-06-20
GB2433397B GB2433397B (en) 2008-09-10

Family

ID=35736268

Family Applications (1)

Application Number Title Priority Date Filing Date
GB0525641A Expired - Fee Related GB2433397B (en) 2005-12-16 2005-12-16 A configurable block cdma scheme

Country Status (3)

Country Link
US (1) US8228784B2 (en)
JP (1) JP4346639B2 (en)
GB (1) GB2433397B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009031801A2 (en) 2007-09-03 2009-03-12 Lg Electronics Inc. Method of transmitting data using repetition coding
GB2472569A (en) * 2009-08-04 2011-02-16 Toshiba Res Europ Ltd An asynchronous block CDMA system uses serial interference cancellation, based on the order of arrival of signals, to cancel multi-user interference
US8498329B2 (en) 2008-09-24 2013-07-30 Kabushiki Kaisha Toshiba MMSE equaliser
USRE46039E1 (en) 2007-09-03 2016-06-21 Lg Electronics Inc. Method of transmitting data using repetition coding
US20160330061A1 (en) * 2014-01-22 2016-11-10 Huawei Technologies Co., Ltd. Information processing apparatus, network node, and information processing method
US20180205586A1 (en) * 2017-01-19 2018-07-19 Qualcomm Incorporated Low peak-to-average power ratio waveform design for frequency multiplexing of multiple streams

Families Citing this family (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4505025B2 (en) * 2004-11-04 2010-07-14 サムスン エレクトロニクス カンパニー リミテッド Spatio-temporal frequency block coding apparatus and method
US8638771B2 (en) * 2005-08-12 2014-01-28 Qualcomm Incorporated Transmission structure supporting multi-user scheduling and MIMO transmission
US7558330B2 (en) * 2005-12-07 2009-07-07 Telefonaktiebolaget L M Ericsson (Publ) Multiple stream co-phasing for multiple-input-multiple-output (MIMO) systems
US8102931B2 (en) * 2006-09-29 2012-01-24 Apple Inc. Method and device for operating a precoded MIMO system
US20080192854A1 (en) * 2007-02-09 2008-08-14 Taeyoon Kim Single carrier frequency division multiple access receiver for mimo systems
US7843801B2 (en) * 2007-03-16 2010-11-30 Nokia Corporation Optimum technique for encoding and decoding physical resource block locations
KR20090006708A (en) 2007-07-12 2009-01-15 엘지전자 주식회사 Method for transmitting scheduling request signal
WO2009013432A1 (en) * 2007-07-13 2009-01-29 France Telecom Method for transmitting a multicarrier signal using a multiple access technique by code distribution, and corresponding device, computer program product and signal
KR101514476B1 (en) 2007-09-03 2015-04-22 삼성전자주식회사 Sequence hopping in sc-fdma communications systems
USRE47602E1 (en) 2007-09-03 2019-09-10 Lg Electronics Inc. Method of transmitting data using repetition coding
US8532066B2 (en) * 2007-10-18 2013-09-10 Qualcomm Incorporated Transmission structure supporting multi-user scheduling and MIMO transmission
JP5047834B2 (en) * 2008-02-15 2012-10-10 株式会社エヌ・ティ・ティ・ドコモ Wireless communication apparatus and wireless communication method
US8582622B2 (en) * 2008-05-11 2013-11-12 Qualcomm Incorporated Spread-spectrum coding of data bursts
EP2340638A4 (en) * 2008-10-30 2013-09-18 Commw Scient Ind Res Org Block spreading for orthogonal frequency division multiple access systems
CN102687475B (en) * 2009-10-13 2015-08-05 骁阳网络有限公司 For method and the optic network parts of deal with data in optic network parts
KR101733489B1 (en) * 2010-01-17 2017-05-24 엘지전자 주식회사 Apparatus and method of transmitting control information in wireless communication system
JP5883845B2 (en) * 2010-04-04 2016-03-15 エルジー エレクトロニクス インコーポレイティド Method and apparatus for transmitting control information in wireless communication system
CN102377534B (en) * 2010-08-24 2014-07-09 华为技术有限公司 Multiple input and output decoding method, decoding device and receiver
US8665693B1 (en) * 2011-08-18 2014-03-04 Applied Micro Circuits Corporation Uplink single carrier frequency division multiple access multiple-input multiple-output soft interference cancellation receiver
GB2498937A (en) * 2012-01-31 2013-08-07 Texas Instruments Ltd A high data rate SerDes receiver arranged to receive input from a low data rate SerDes transmitter
US9479272B2 (en) * 2014-05-14 2016-10-25 Samsung Electronics Co., Ltd Method and apparatus for processing a transmission signal in communication system
US10365358B2 (en) * 2016-06-23 2019-07-30 GM Global Technology Operations LLC Low latency decoding in multi-input multi-output radar
US11502790B2 (en) 2020-04-09 2022-11-15 Qualcomm Incorporated Orthogonal sequence generation for multi-bit payloads
WO2023015450A1 (en) * 2021-08-10 2023-02-16 株式会社Ntt都科摩 Electronic device
US20230093484A1 (en) * 2021-09-23 2023-03-23 Apple Inc. Systems and methods for de-correlating coded signals in dual port transmissions

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6590889B1 (en) * 1997-08-11 2003-07-08 Gte Internetworking Incorporated Data communications system and hybrid time-code multiplexing method
WO2004047390A1 (en) * 2002-05-23 2004-06-03 Indian Institute Of Technology, Dehli Blind detection of bpsk signals in a multi-user environment
US20050117628A1 (en) * 2002-08-12 2005-06-02 Brethour Vernon R. Method for generating communication signal sequences having desirable correlation properties and system for using same
US20050220200A1 (en) * 2004-03-12 2005-10-06 Giannakis Georgios B Bandwidth and power efficient multicarrier multiple access
EP1628410A1 (en) * 2003-05-20 2006-02-22 Intelligent Cosmos Research Institute Transmitter apparatus and communication system

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5790514A (en) * 1996-08-22 1998-08-04 Tellabs Operations, Inc. Multi-point OFDM/DMT digital communications system including remote service unit with improved receiver architecture
KR100365346B1 (en) * 1997-09-09 2003-04-11 삼성전자 주식회사 Apparatus and method for generating quasi-orthogonal code of mobile communication system and diffusing band by using quasi-orthogonal code
US6700881B1 (en) * 1998-03-02 2004-03-02 Samsung Electronics Co., Ltd. Rate control device and method for CDMA communication system
KR100441989B1 (en) * 2001-11-16 2004-07-30 한국전자통신연구원 The method of Phase Factor Establishment for Partial Transmit Sequence OFDM
CN1682507A (en) * 2002-07-17 2005-10-12 索马网络公司 Frequency domain equalization in communications systems with scrambling
CN1679252A (en) * 2002-08-30 2005-10-05 横浜Tlo株式会社 Transmission signal formation method, communication method, and transmission signal data structure
US7738836B2 (en) * 2003-09-26 2010-06-15 Andrew Corporation System and method of operation for network overlay geolocation system with repeaters using AM Golay Hadamard signatures
KR100995031B1 (en) * 2003-10-01 2010-11-19 엘지전자 주식회사 Method for controlling signal transmitting applying for MIMO
WO2005069523A1 (en) * 2004-01-20 2005-07-28 Agency For Science, Technology And Research A system, a transceiver structure for use therein and a method of processing signals in such a system
US20070263735A1 (en) * 2004-04-02 2007-11-15 Nortel Networks Limited Wireless Communication Methods, Systems, and Signal Structures
US8233555B2 (en) * 2004-05-17 2012-07-31 Qualcomm Incorporated Time varying delay diversity of OFDM
US20050276341A1 (en) * 2004-06-14 2005-12-15 Infineon Technologies Ag Method and apparatus for transmitting and/or receiving data
US7564908B2 (en) * 2004-09-23 2009-07-21 Motorola, Inc. Method and apparatus for encryption of over-the-air communications in a wireless communication system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6590889B1 (en) * 1997-08-11 2003-07-08 Gte Internetworking Incorporated Data communications system and hybrid time-code multiplexing method
WO2004047390A1 (en) * 2002-05-23 2004-06-03 Indian Institute Of Technology, Dehli Blind detection of bpsk signals in a multi-user environment
US20050117628A1 (en) * 2002-08-12 2005-06-02 Brethour Vernon R. Method for generating communication signal sequences having desirable correlation properties and system for using same
EP1628410A1 (en) * 2003-05-20 2006-02-22 Intelligent Cosmos Research Institute Transmitter apparatus and communication system
US20050220200A1 (en) * 2004-03-12 2005-10-06 Giannakis Georgios B Bandwidth and power efficient multicarrier multiple access

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
USRE46039E1 (en) 2007-09-03 2016-06-21 Lg Electronics Inc. Method of transmitting data using repetition coding
WO2009031801A2 (en) 2007-09-03 2009-03-12 Lg Electronics Inc. Method of transmitting data using repetition coding
EP2183895A4 (en) * 2007-09-03 2012-09-26 Lg Electronics Inc Method of transmitting data using repetition coding
KR101445388B1 (en) * 2007-09-03 2014-09-26 엘지전자 주식회사 Method of Transmitting Data using Repetition Coding
US8391380B2 (en) 2007-09-03 2013-03-05 Lg Electronics Inc. Method of transmitting data using repetition coding
EP2183895A2 (en) * 2007-09-03 2010-05-12 Lg Electronics Inc. Method of transmitting data using repetition coding
USRE45902E1 (en) 2007-09-03 2016-02-23 Lg Electronics Inc. Method of transmitting data using repetition coding
US8498329B2 (en) 2008-09-24 2013-07-30 Kabushiki Kaisha Toshiba MMSE equaliser
GB2472569B (en) * 2009-08-04 2012-11-21 Toshiba Res Europ Ltd A block spread code division multiple access transmission system and a method of and receiver for cancelling interference in such a transmission system
GB2472569A (en) * 2009-08-04 2011-02-16 Toshiba Res Europ Ltd An asynchronous block CDMA system uses serial interference cancellation, based on the order of arrival of signals, to cancel multi-user interference
US20160330061A1 (en) * 2014-01-22 2016-11-10 Huawei Technologies Co., Ltd. Information processing apparatus, network node, and information processing method
US9912508B2 (en) * 2014-01-22 2018-03-06 Huawei Technologies Co., Ltd. Information processing apparatus, network node, and information processing method
US20180205586A1 (en) * 2017-01-19 2018-07-19 Qualcomm Incorporated Low peak-to-average power ratio waveform design for frequency multiplexing of multiple streams
WO2018136655A1 (en) * 2017-01-19 2018-07-26 Qualcomm Incorporated Low peak-to-average power ratio waveform design for frequency multiplexing of multiple streams
US10530625B2 (en) 2017-01-19 2020-01-07 Qualcomm Incorporated Low peak-to-average power ratio waveform design for frequency multiplexing of multiple streams

Also Published As

Publication number Publication date
JP4346639B2 (en) 2009-10-21
GB0525641D0 (en) 2006-01-25
JP2007181199A (en) 2007-07-12
US8228784B2 (en) 2012-07-24
US20070140105A1 (en) 2007-06-21
GB2433397B (en) 2008-09-10

Similar Documents

Publication Publication Date Title
US8228784B2 (en) Configurable block CDMA scheme
CA2455859C (en) Diversity transmitter and diversity transmission method
US7263133B1 (en) MIMO-based multiuser OFDM multiband for ultra wideband communications
EP1550278B1 (en) Channel mapping for ofdm frequency-hopping
US7403508B1 (en) Multiband MIMO-based W-CDMA and UWB communications
WO2010052800A1 (en) Two-dimensional code spreading for interleaved fdma system
JP2014147082A (en) Systems and methods for sc-fdma transmission diversity
US20060274708A1 (en) System and method for wireless communication
WO2005081487A1 (en) Transmission signals, methods and apparatus
GB2391775A (en) Space and time diversity in multicarrier CDMA transmission
WO2006037835A1 (en) Block modulation
KR101107631B1 (en) Emission for cdma communications systems on the mimo channel
KR101025719B1 (en) Communication system, transmitter, receiver, and multiple access method
GB2434510A (en) Using a plurality of predetermined spreading codes to enhance frequency diversity in a block CDMA system
WO2007111198A1 (en) Transmission method and transmission device
JP4483218B2 (en) Space-time transmit diversity multi-carrier CDMA receiver, transmitter, and radio communication system including the receiver
EP1580919B1 (en) Communications systems, method and device in MIMO systems with time domain spreading
Priya et al. An efficient scheme for PAPR reduction in Alamouti MIMO-OFDM systems
Elavarasan et al. PAPR reduction in MIMO-OFDM systems using joint channel estimation and Precoding
EP1722501B1 (en) Method for wireless communication
Zhou et al. Generalized frequency hopping OFDMA through unknown frequency-selective multipath channels
Tonello Performance analysis of a multiple antenna concatenated DMT-FMT scheme in the uplink
GB2463872A (en) An MMSE Equaliser for asynchronous reception in Code Division Multiple Access Systems
Horlin et al. Space-time block coding for uplink single-carrier CDMA with joint detection in the frequency domain
Kadhim et al. Design and Improvement of WiMAX OSTBCCOFDM Transceiver Based Multiwavelet Signals by TomlinsonHarashima Precoding on SFF SDR Development Platform

Legal Events

Date Code Title Description
PCNP Patent ceased through non-payment of renewal fee

Effective date: 20221216