#### DMCA

## A Family of Distributed Space-Time Trellis Codes With Asynchronous Cooperative Diversity

### Cached

### Download Links

- [www.ee.udel.edu]
- [www.eecis.udel.edu]
- [www.eecis.udel.edu]
- DBLP

### Other Repositories/Bibliography

### Citations

2350 | On limits of wireless communications in a fading environment when using multiple antennas,” Wireless Personal Commun
- Foschini, Gans
- 1998
(Show Context)
Citation Context ...wever, when there is only one antenna in the destination receiver, the performance gain achieved by more than four transmit antennas is marginal comparing with that achieved by four transmit antennas =-=[13]-=-, [3]. Hence, four enrolled relays could be enough when only one destination antenna is available. On the other hand, is an undetermined parameter in the system. Although it has an upper limit because... |

1925 | Cooperative diversity in wireless networks: Efficient protocols and outage behavior
- Laneman, Tse, et al.
(Show Context)
Citation Context ...of making different users to communicate cooperatively to achieve the spatial diversity gain has been proposed in, for example, [1]–[4], and such spatial diversity is called cooperative diversity. In =-=[3]-=- and [4], different cooperative protocols are devised and their outage performances are analyzed. In [4], the problem of space–time code design for the cooperative communication is Paper approved by H... |

1749 | Space-time codes for high data rate wireless communication: Performance criteria and code construction
- Tarokh, Seshadri, et al.
- 1998
(Show Context)
Citation Context ...fferent rows in are transmitted by different relay terminals. is the set of all the complex numbers, i.e., the complex plane. There are two major differences between the conventional space–time codes =-=[12]-=-, and the space–time codes in the cooperative communication. One is that the row number in is a random variable instead of a constant in the conventional space–time codes which equals to the number of... |

603 | Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
- Laneman, Wornell
- 2003
(Show Context)
Citation Context ...ar or sensor networking system usually has multiple users, the idea of making different users to communicate cooperatively to achieve the spatial diversity gain has been proposed in, for example, [1]–=-=[4]-=-, and such spatial diversity is called cooperative diversity. In [3] and [4], different cooperative protocols are devised and their outage performances are analyzed. In [4], the problem of space–time ... |

451 |
for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems
- Standard
- 2006
(Show Context)
Citation Context ...s are known at the receiver but not at the transmitter. The timing errors can be estimated by using some random sequences transmitted periodically by the relay nodes. For example, in the WiMAX system =-=[22]-=-, the relative timing error of the mobile stations are estimated by the base station during the initial ranging and periodic ranging period. The maximum relative timing error is assumed to be . So the... |

435 | Fading relay channels: Performance limits and spacetime signal design - Nabar, Bolcskei, et al. - 2004 |

417 | User cooperation diversity-part i: system description
- Sendonaris, Erkip, et al.
- 2003
(Show Context)
Citation Context ...llular or sensor networking system usually has multiple users, the idea of making different users to communicate cooperatively to achieve the spatial diversity gain has been proposed in, for example, =-=[1]-=-–[4], and such spatial diversity is called cooperative diversity. In [3] and [4], different cooperative protocols are devised and their outage performances are analyzed. In [4], the problem of space–t... |

277 |
Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels
- Guey, Fitz, et al.
- 1996
(Show Context)
Citation Context ...ding of a packet/frame transmission. Similar to the conventional space–time code design, to achieve good performance, we need to have the full diversity order and a good diversity product as shown in =-=[11]-=- and [12], while the following two differences must be considered: number of rows in the space–time code matrix is random; rows in the space–time code matrix are not symbolaligned. The first one is, i... |

220 | Distributed space-time coding in wireless relay networks
- Jing, Hassibi
- 2006
(Show Context)
Citation Context .... It is shown that this scheme can achieve diversity order of , where is the number of relays involved. In [6] and [7], distributed channel codes are proposed to achieve the cooperative diversity. In =-=[9]-=- and , linear dispersion space–time codes are used and the achieveable diversity order is analyzed. In all these schemes, synchronization is assumed as an a priori condition. But different from the sp... |

194 | Coded cooperation in wireless communications: space-time transmission and iterative decoding
- Janani, Hedayat, et al.
- 2004
(Show Context)
Citation Context ... their estimated symbols to the destination according to the structure of orthogonal matrices. It is shown that this scheme can achieve diversity order of , where is the number of relays involved. In =-=[6]-=- and [7], distributed channel codes are proposed to achieve the cooperative diversity. In [9] and , linear dispersion space–time codes are used and the achieveable diversity order is analyzed. In all ... |

137 |
Two signaling schemes for improving the error performance of FDD transmission systems using transmitter antenna diversity,” Int
- Seshadri, Winters
- 1994
(Show Context)
Citation Context ...acket length . However, the second difference is not easy to handle. For example, the delay diversity codes that are designed to ensure full diversity order in the conventional space–time codes [12], =-=[17]-=- do not have the full diversity property in the asynchronous cooperative communication. Also, the existing space–time block codes, for example, the orthogonal space–time codes and the lattice based sp... |

135 |
Cooperative coding for wireless networks
- Stefanov, Erkip
- 2002
(Show Context)
Citation Context ...stimated symbols to the destination according to the structure of orthogonal matrices. It is shown that this scheme can achieve diversity order of , where is the number of relays involved. In [6] and =-=[7]-=-, distributed channel codes are proposed to achieve the cooperative diversity. In [9] and , linear dispersion space–time codes are used and the achieveable diversity order is analyzed. In all these sc... |

133 | Reduced-state sequence estimation with setpartitioning and decision feedback - Eyuboglu, Qureshi - 1988 |

123 |
Sequential coding algorithms: a survey and cost analysis
- Anderson, Mohan
- 1994
(Show Context)
Citation Context ...simplified decoding is sequential decoding, whose complexity is independent of the maximum memory order of the generating polynomial . Usually, there are three kinds of sequential decoding algorithms =-=[20]-=-, [21]: one is breadth-first algorithms which include M-algorithm, T-algorithm, etc.; one is depth-first algorithms which include Fano algorithm, etc.; and the other is metric-first algorithms, which ... |

103 | Gamal, “On the theory of space-time codes for PSK modulation
- Hammons, El
- 2000
(Show Context)
Citation Context ...ime trellis codes that can achieve the full cooperative diversity order in asynchronous cooperative communications for any number of involved relays. In this paper, based on the stack construction in =-=[14]-=-, a family of space–time trellis codes for BPSK modulation scheme is constructed. When this family of space–time trellis codes is used to exploit the cooperative diversity without the symbol synchroni... |

94 | cooperation diversity-Part II: Implementation aspects and performance analysis - “User - 2003 |

77 |
Costello Jr. Error Control Coding: Fundamentals and Applications
- Lin, J
- 1983
(Show Context)
Citation Context ...t is known at the receiver. is the AWGN at and has zero mean and variance per real dimension. is the transmitted symbol by . During Phase II, first, demodulates the received signal and does CRC check =-=[18]-=- to see whether the detected information is correct or not. We assume . . . that those can pass the CRC check do not have any errors in their detected information. We use to denote the set of potentia... |

75 | Asynchronous cooperative diversity
- Wei, Goeckel, et al.
- 2006
(Show Context)
Citation Context ...oscillator. Thus, the cooperative diversity is asynchronous in nature. The method to achieve the cooperative diversity where synchronization between relays is not a required condition is discussed in =-=[10]-=-. In [10], intentional delays are introduced in different terminals. At the destination receiver, minimum mean square error (MMSE) estimator is used to exploit the cooperative diversity. Although some... |

57 |
Breadth-first trellis decoding with adaptive effort
- Simmons
- 1990
(Show Context)
Citation Context ...fied decoding is sequential decoding, whose complexity is independent of the maximum memory order of the generating polynomial . Usually, there are three kinds of sequential decoding algorithms [20], =-=[21]-=-: one is breadth-first algorithms which include M-algorithm, T-algorithm, etc.; one is depth-first algorithms which include Fano algorithm, etc.; and the other is metric-first algorithms, which includ... |

31 |
Rate-diversity trade-off of space-time codes with fixed alphabet and optimal constructions for PSK modulation
- Lu, Kumar
- 2003
(Show Context)
Citation Context ...trellis codes is used to exploit the cooperative diversity without the symbol synchronization requirement, the full diversity order is guaranteed/proven. Based on the unified construction proposed in =-=[15]-=- and [16], this family of space–time trellis codes is generalized to higher order modulation schemes, such as QAM and PSK. Some diversity product properties of the space–time trellis codes are studied... |

20 |
Shift-full-rank matrices and applications in space-time trellis codes for relay networks with asynchronous cooperative diversity
- Shang, Xia
- 2006
(Show Context)
Citation Context ... it is shifted to be Constructing with a smaller number of columns is an interesting problem. The shifted full rank construction with minimum number of column for arbitrary has been recently found in =-=[23]-=-. Having the BPSK modulated space–time codes that have full diversity order, using Lu–Kumar’s unified construction [16], we can generalize them to other PAM, QAM, or PSK modulated space–time codes, as... |

13 |
Wireless antennas-making wireless communications perform like wireline communications
- Hua, Mei, et al.
- 2003
(Show Context)
Citation Context .... Digital Object Identifier 10.1109/TCOMM.2007.894117 Yabo Li and Xiang-Gen Xia, Senior Member, IEEE 0090-6778/$25.00 © 2007 IEEE also proposed, and the orthogonal space–time block codes are used. In =-=[5]-=-, to achieve cooperative diversity, transmitted symbols are estimated but not detected in relays, then the relays forward their estimated symbols to the destination according to the structure of ortho... |

4 |
unified construction of space-time codes with optimal rate-diversity tradeoff
- “A
- 2005
(Show Context)
Citation Context ...odes is used to exploit the cooperative diversity without the symbol synchronization requirement, the full diversity order is guaranteed/proven. Based on the unified construction proposed in [15] and =-=[16]-=-, this family of space–time trellis codes is generalized to higher order modulation schemes, such as QAM and PSK. Some diversity product properties of the space–time trellis codes are studied in async... |