37 resultados para concurrent training


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fast and efficient channel estimation is key to achieving high data rate performance in mobile and vehicular communication systems, where the channel is fast time-varying. To this end, this work proposes and optimizes channel-dependent training schemes for reciprocal Multiple-Input Multiple-Output (MIMO) channels with beamforming (BF) at the transmitter and receiver. First, assuming that Channel State Information (CSI) is available at the receiver, a channel-dependent Reverse Channel Training (RCT) signal is proposed that enables efficient estimation of the BF vector at the transmitter with a minimum training duration of only one symbol. In contrast, conventional orthogonal training requires a minimum training duration equal to the number of receive antennas. A tight approximation to the capacity lower bound on the system is derived, which is used as a performance metric to optimize the parameters of the RCT. Next, assuming that CSI is available at the transmitter, a channel-dependent forward-link training signal is proposed and its power and duration are optimized with respect to an approximate capacity lower bound. Monte Carlo simulations illustrate the significant performance improvement offered by the proposed channel-dependent training schemes over the existing channel-agnostic orthogonal training schemes.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

How the brain converts parallel representations of movement goals into sequential movements is not known. We tested the role of basal ganglia (BG) in the temporal control of movement sequences by a convergent approach involving inactivation of the BG by muscimol injections into the caudate nucleus of monkeys and assessing behavior of Parkinson's disease patients, performing a modified double-step saccade task. We tested a critical prediction of a class of competitive queuing models that explains serial behavior as the outcome of a selection of concurrently activated goals. In congruence with these models, we found that inactivation or impairment of the BG unmasked the parallel nature of goal representations such that a significantly greater extent of averaged saccades, curved saccades, and saccade sequence errors were observed. These results suggest that the BG perform a form of competitive queuing, holding the second movement plan in abeyance while the first movement is being executed, allowing the proper temporal control of movement sequences.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Single receive antenna selection (AS) is a popular method for obtaining diversity benefits without the additional costs of multiple radio receiver chains. Since only one antenna receives at any time, the transmitter sends a pilot multiple times to enable the receiver to estimate the channel gains of its N antennas to the transmitter and select an antenna. In time-varying channels, the channel estimates of different antennas are outdated to different extents. We analyze the symbol error probability (SEP) in time-varying channels of the N-pilot and (N+1)-pilot AS training schemes. In the former, the transmitter sends one pilot for each receive antenna. In the latter, the transmitter sends one additional pilot that helps sample the channel fading process of the selected antenna twice. We present several new results about the SEP, optimal energy allocation across pilots and data, and optimal selection rule in time-varying channels for the two schemes. We show that due to the unique nature of AS, the (N+1)-pilot scheme, despite its longer training duration, is much more energy-efficient than the conventional N-pilot scheme. An extension to a practical scenario where all data symbols of a packet are received by the same antenna is also investigated.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Transmit antenna selection (AS) has been adopted in contemporary wideband wireless standards such as Long Term Evolution (LTE). We analyze a comprehensive new model for AS that captures several key features about its operation in wideband orthogonal frequency division multiple access (OFDMA) systems. These include the use of channel-aware frequency-domain scheduling (FDS) in conjunction with AS, the hardware constraint that a user must transmit using the same antenna over all its assigned subcarriers, and the scheduling constraint that the subcarriers assigned to a user must be contiguous. The model also captures the novel dual pilot training scheme that is used in LTE, in which a coarse system bandwidth-wide sounding reference signal is used to acquire relatively noisy channel state information (CSI) for AS and FDS, and a dense narrow-band demodulation reference signal is used to acquire accurate CSI for data demodulation. We analyze the symbol error probability when AS is done in conjunction with the channel-unaware, but fair, round-robin scheduling and with channel-aware greedy FDS. Our results quantify how effective joint AS-FDS is in dispersive environments, the interactions between the above features, and the ability of the user to lower SRS power with minimal performance degradation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper considers the design of a power-controlled reverse channel training (RCT) scheme for spatial multiplexing (SM)-based data transmission along the dominant modes of the channel in a time-division duplex (TDD) multiple-input and multiple-output (MIMO) system, when channel knowledge is available at the receiver. A channel-dependent power-controlled RCT scheme is proposed, using which the transmitter estimates the beamforming (BF) vectors required for the forward-link SM data transmission. Tight approximate expressions for 1) the mean square error (MSE) in the estimate of the BF vectors, and 2) a capacity lower bound (CLB) for an SM system, are derived and used to optimize the parameters of the training sequence. Moreover, an extension of the channel-dependent training scheme and the data rate analysis to a multiuser scenario with M user terminals is presented. For the single-mode BF system, a closed-form expression for an upper bound on the average sum data rate is derived, which is shown to scale as ((L-c - L-B,L- tau)/L-c) log logM asymptotically in M, where L-c and L-B,L- tau are the channel coherence time and training duration, respectively. The significant performance gain offered by the proposed training sequence over the conventional constant-power orthogonal RCT sequence is demonstrated using Monte Carlo simulations.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The concurrent planning of sequential saccades offers a simple model to study the nature of visuomotor transformations since the second saccade vector needs to be remapped to foveate the second target following the first saccade. Remapping is thought to occur through egocentric mechanisms involving an efference copy of the first saccade that is available around the time of its onset. In contrast, an exocentric representation of the second target relative to the first target, if available, can be used to directly code the second saccade vector. While human volunteers performed a modified double-step task, we examined the role of exocentric encoding in concurrent saccade planning by shifting the first target location well before the efference copy could be used by the oculomotor system. The impact of the first target shift on concurrent processing was tested by examining the end-points of second saccades following a shift of the second target during the first saccade. The frequency of second saccades to the old versus new location of the second target, as well as the propagation of first saccade localization errors, both indices of concurrent processing, were found to be significantly reduced in trials with the first target shift compared to those without it. A similar decrease in concurrent processing was obtained when we shifted the first target but kept constant the second saccade vector. Overall, these results suggest that the brain can use relatively stable visual landmarks, independent of efference copy-based egocentric mechanisms, for concurrent planning of sequential saccades.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper considers the problem of receive antenna selection (AS) in a multiple-antenna communication system having a single radio-frequency (RF) chain. The AS decisions are based on noisy channel estimates obtained using known pilot symbols embedded in the data packets. The goal here is to minimize the average packet error rate (PER) by exploiting the known temporal correlation of the channel. As the underlying channels are only partially observed using the pilot symbols, the problem of AS for PER minimization is cast into a partially observable Markov decision process (POMDP) framework. Under mild assumptions, the optimality of a myopic policy is established for the two-state channel case. Moreover, two heuristic AS schemes are proposed based on a weighted combination of the estimated channel states on the different antennas. These schemes utilize the continuous valued received pilot symbols to make the AS decisions, and are shown to offer performance comparable to the POMDP approach, which requires one to quantize the channel and observations to a finite set of states. The performance improvement offered by the POMDP solution and the proposed heuristic solutions relative to existing AS training-based approaches is illustrated using Monte Carlo simulations.