The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In the cooperative communication system, due to the distributed nature of the relay system, multiple carrier frequency offsets (CFOs) at different relays and multipath channels between relays cause the whole cooperative communication channel to be a doubly time-frequency selective channel. Zero-Padding Orthogonal Frequency Division Multiplexing (ZP-OFDM), which has been adopted for some wideband communication...
In this paper, we consider cooperative networks comprising multiple simultaneous transmitting source-destination pairs. Specifically, we propose two relay assignment schemes whereby one relay is assigned to one pair at any given time. It is assumed that the number of relays equals or exceeds the number of pairs. This assumption is practical because in future wireless networks, any node in the network...
In this paper, we consider the optimal resource allocation problem for dual-hop systems with a source-destination pair and multiple decode-and-forward (DF) relays. Orthogonal frequency division multiplexing (OFDM) is adopted in both hops. To maximize the system capacity, we formulate a mixed binary integer programming problem to optimally allocate the subchannels and transmit power for both the source...
We study the dynamic decode and forward (DDF) protocol for a single half-duplex relay, single-antenna channel with quasi-static fading. We analyze the diversity-multiplexing tradeoff (DMT) of the DDF protocol for the case of finite block-lengths, and provide simple constructions of explicit, DMT optimal codes. Reduced complexity lattice decoding algorithms for the proposed codes are investigated.
Li and Xia have recently investigated the design of space-time codes that achieve full spatial diversity for asynchronous cooperative communications. They show that certain of the binary space-time trellis codes derived from the Hammons-El Gamal stacking construction are delay tolerant and can be used in the multilevel code constructions by Lu and Kumar to produce delay tolerant space-time codes for...
We introduce a new primitive, the Resource Controller, which abstracts the problem of controlling the total amount of resources consumed by a distributed algorithm. We present an efficient distributed algorithm to implement this abstraction. The message complexity of our algorithm per participating node is polylogarithmic in the size of the network, compared to the linear cost per node of the naive...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.