Method of generating space-time codes for generalized layered space-time architectures
AssigneeHughes Electronics Corporation
InventorsA. Roger Hammons JR., Hasham El Gamal
Life of this patent
Estimating the term…
Abstract
Space-time codes for use with layered architectures with arbitrary numbers of antennas are provided such as rate k/n convolutional codes (e.g., rates higher than or equal to 1/n where n is the number of transmit antennas). Convolutional codes for layered space-time architectures are generated using matrices over the ring F[[D]] of formal power series in variable D.
Claims14
A method of generating a space-time code for encoding information symbols comprising the steps of:
- defining a binary rank criterion such that C is a linear n×l space-time code with underlying binary code C of length N=nl where l≧n, and a non-zero code word c is a matrix of full rank over a binary field to allow full spatial diversity nm for n transmit antennas and m receive antennas;
- and
- generating binary matrices M1, M2, . . . , Mn of dimension k×l, l≧k, C being said n×l space-time code of dimension k and comprising code word matrices
- 7 c ^ = [ x _ M 1 x _ M 2 ⋮ x _ M n ] ,
- wherein x denotes an arbitrary k-tuple of said information symbols and n≦l, said binary matrices M1, M2, . . . , Mn being characterized by
- ∀a1, a2, . . . , an ∈:
- M=a1M1⊕a2M2⊕ . . . ⊕anMn is of full rank k unless a1=a2= . . . =an=0
- to allow said code C to satisfy said binary rank criterion.
A method of generating a space-time code for encoding information symbols comprising the steps of:
- defining L as a layer of spatial span n, and C as a binary code of dimension k comprising code words having the form g(x)=xM1|xM2| . . . |xMn, where M1, M2, . . . , Mn are binary matrices of dimension k×l and x denotes an arbitrary k-tuple of said information symbols;
- modulating said code words xMj such that said modulated symbols μ(xMj) are transmitted in the l/b symbol intervals of L that are assigned to an antenna j (18);
- and
- generating a space-time code C comprising C and fL having d be the largest integer such that M1, M2, . . . , Mn have the property that
- ∀a1, a2, . . . , an ∈, a1+a2+ . . . +an=n−d+1:
- M=[a1M1a2M2 . . . anMn] is of rank k over the binary field
- to achieve spatial diversity dm in a quasi-static fading channel.
A method for generating a space-time code for encoding information symbols comprising the steps of:
- defining C as a generalized layered space-time code comprising a binary convolutional code C having a k×n transfer function matrix of G(D)=[F1(D) F2(D) . . . Fn(D)], and a spatial modulator fL in which the output Yj(D)=X(D)·Fj(D) is assigned to an antenna j along a layer L;
- defining v as the smallest integer having the property that, whenever a1+a2+ . . . +an=v, the k×n matrix [a1F1 a2F2 . . . anFn has full rank k over [[x]];
- and
- generating a space-time code C to achieve d-level spatial transmit diversity over the quasi-static fading channel where d=n−v+1 and v≧k.
A method generating a space-time code for encoding information symbols comprising the steps of:
- defining L as a layer of spatial span n and C as a binary code of dimension k comprising code words of the form
- g(x)=xM1,1|xM2,1| . . . |xMn,1| . . . |xM1,B|xM2,B| . . . |xMn,B
- where M1,1, M2,1, . . . , Mn,1, . . . , M1,B, Mn,B are binary matrices of dimension k×l and x denotes an arbitrary k-tuple of information bits, and B as the number of independent fading blocks spanning one code word;
- modulating said code words xMj,ν such that said modulated symbols μ(xMj,ν) are transmitted in the symbol intervals of L that are assigned to antenna j in a fading block ν;
- and
- generating said space-time code in a communication system with n transmit antennas and m receive antennas such that C comprising C and fL achieves spatial diversity dm in a B-block fading channel, d being the largest integer such that M1,1, M2,1, . . . , Mn,B have the property that
- ∀a1,1, a2,1, . . . , an,B ∈, a1,1+a2,1+ . . . +an,B=nB−d+1:
- M=[a1,1M1,1a2,1M2,1 . . . an,BMn,B] is of rank k over the binary field.
An encoding apparatus in a layered space-time architecture comprising:
- an input device for receiving information symbols;
- and
- a processing device for encoding said information symbols using a space-time code generated by defining a binary rank criterion such that C is a linear n×l space-time code with underlying binary code C of length N=nl where l≧n and a non-zero code word ĉ is a matrix of full rank over a binary field to allow full spatial diversity nm for n transmit antennas and m receive antennas, and by generating binary matrices M1, M2, . . . , Mn of dimension k×l, l≧k, C being said n×l space-time code of dimension k and comprising code word matrices
- 8 c ^ = [ x _ M 1 x _ M 2 ⋮ x _ M n ] ,
- wherein x denotes an arbitrary k-tuple of said information symbols and n≦l, said binary matrices M1, M2, . . . , Mn being characterized by
- ∀a1, a2 . . . , an ∈:
- M=a1M1⊕a2M2⊕ . . . ⊕anMn is of full rank k unless a1=a2= . . . =an=0
- to allow said code C to satisfy said binary rank criterion.
An encoding apparatus in a layered space-time architecture comprising:
- an input device for receiving information symbols;
- and
- a processing device for encoding said information symbols using a space-time code generated by defining L as a layer of spatial span n and C as a binary code of dimension k comprising code words having the form g(x)=xM1|xM2| . . . |xMn,where M1, M2, . . . , Mn are binary matrices of dimension k×l and x denotes an arbitrary k-tuple of said information symbols, by modulating said code words xMj such that said modulated symbols μ(xMj) are transmitted in the l/b symbol intervals of L that are assigned to an antenna j, and by generating said space-time code C comprising C and fL wherein d is the largest integer such that M1, M2, . . . , Mn have the property that
- ∀a1, a2, . . . , an ∈, a1+a2+ . . . +an=n−d+1:
- M=[a1M1a2M2 . . . anMn] is of rank k over the binary field
- to achieve spatial diversity dm in a quasi-static fading channel.
An encoding apparatus in a layered space-time architecture comprising:
- an input device for receiving information symbols;
- and
- a processing device for encoding said information symbols using a space-time code generated by defining C as a generalized layered space-time code comprising a binary convolutional code C having a k×n transfer function matrix of G(D)=F1(D) F2(D) . . . Fn(D)], and by spatial modulating fL in which the output Yj(D)=X(D)·Fj(D) is assigned to an antenna j along a layer L, v being defined as the smallest integer having the property that, whenever a1+a2+ . . . +an=v, the k×n matrix [a1F1 a2F2 . . . anFn] has full rank k over [[x]], and generating said space-time code C achieving d-level spatial transmit diversity over the quasi-static fading channel where d=n−v+1 and v≧k.
An encoding apparatus in a layered space-time architecture comprising:
- an input device for receiving information symbols;
- and
- a processing device for encoding said information symbols using a space-time code generated by defining L as a layer of spatial span n and C as a binary code of dimension k comprising code words of the form
- g(x)=xM1,1|xM2,1| . . . |xMn,1| . . . |xM1,B|xM2,B| . . . |xMn,B
- where M1,1, M2,1, . . . , Mn,1, . . . , M1,B, M2,B, . . . , Mn,B are binary matrices of dimension k×l and x denotes an arbitrary k-tuple of information bits, and B as the number of independent fading blocks spanning one code word, modulating said code words xMj,ν such that said modulated symbols μ(xMj,ν) are transmitted in the symbol intervals of L that are assigned to antenna j in a fading block ν, and generating said space-time code in a communication system with n transmit antennas and m receive antennas such that C comprising C and fL achieves spatial diversity dm in a B-block fading channel, d being the largest integer such that M1,1, M2,1, . . . , Mn,B have the property that
- ∀a1,1, a2,1, . . . , an,B ∈, a1,1+a2,1+ . . . +an,B=nB−d+1:
- M=[a1,1M1,1a2,1M2,1 . . . , an,BMn,B] is of rank k over the binary field.
Dependencies are inferred from the claim text.