The following pages link to Vahid Tarokh (Q553727):
Displaying 50 items.
- Adaptive algorithms for sparse system identification (Q553728) (← links)
- Space-time codes for wireless optical communications (Q1607620) (← links)
- Large deviations of convex polyominoes (Q2082646) (← links)
- On the existence and construction of good codes with low peak-to-average power ratios (Q2705926) (← links)
- Space-time codes for high data rate wireless communication: performance criteria in the presence of channel estimation errors, mobility, and multiple paths (Q2732717) (← links)
- Multiple description trellis-coded quantization (Q2732741) (← links)
- Spectral Distribution of Product of Pseudorandom Matrices Formed From Binary Block Codes (Q2989416) (← links)
- Trellis complexity versus the coding gain of lattices. I (Q3129466) (← links)
- Trellis complexity versus the coding gain of lattices. II (Q3129467) (← links)
- A new construction of 16-QAM golay complementary sequences (Q3546715) (← links)
- Correction to “A New Construction of 16-QAM Golay Complementary Sequences” (Q3546716) (← links)
- Achievable rates in cognitive radio channels (Q3546790) (← links)
- Multiple-Antenna Channel Hardening and Its Implications for Rate Feedback and Scheduling (Q3547020) (← links)
- On compound channels with side information at the transmitter (Q3547378) (← links)
- Space–Time Diversity Enhancements Using Collaborative Communications (Q3547381) (← links)
- Variable-Rate Two-Phase Collaborative Communication Protocols for Wireless Networks (Q3547994) (← links)
- Performance Bounds for Bidirectional Coded Cooperation Protocols (Q3604881) (← links)
- Upper bounds on trellis complexity of lattices (Q4345634) (← links)
- Existence of optimal prefix codes for infinite source alphabets (Q4392408) (← links)
- Space-time codes for high data rate wireless communication: performance criterion and code construction (Q4400286) (← links)
- (Q4460815) (← links)
- Correction to "Space-time block codes from orthogonal designs" (Q4503498) (← links)
- A construction of OFDM 16-QAM sequences having low peak powers (Q4544654) (← links)
- Multiple transmit antenna differential detection from generalized orthogonal designs (Q4544709) (← links)
- A simple encodable/decodable OFDM QPSK code with low peak-to-mean envelope power ratio (Q4544748) (← links)
- A Frame Construction and a Universal Distortion Bound for Sparse Representations (Q4568739) (← links)
- On Bounds and Algorithms for Frequency Synchronization for Collaborative Communication Systems (Q4569041) (← links)
- An Adaptive Greedy Algorithm With Application to Nonlinear Communications (Q4570288) (← links)
- SPARLS: The Sparse RLS Algorithm (Q4570424) (← links)
- Pseudo-Wigner Matrices (Q4570887) (← links)
- Symmetric Pseudo-Random Matrices (Q4570888) (← links)
- Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling (Q4571618) (← links)
- A Coding Theory Approach to Noisy Compressive Sensing Using Low Density Frames (Q4573304) (← links)
- On Sequential Elimination Algorithms for Best-Arm Identification in Multi-Armed Bandits (Q4621807) (← links)
- Multiple Change Point Analysis: Fast Implementation and Strong Consistency (Q4621830) (← links)
- Corrections to “Asymptotic Achievability of the Cramér–Rao Bound for Noisy Compressive Sampling” [Mar 09 1233-1236] (Q4621880) (← links)
- SLANTS: Sequential Adaptive Nonlinear Modeling of Time Series (Q4621883) (← links)
- Analysis of Multistate Autoregressive Models (Q4622134) (← links)
- Estimation of the Evolutionary Spectra With Application to Stationarity Test (Q4628291) (← links)
- Existence and construction of noncoherent unitary space-time codes (Q4677633) (← links)
- Energy reduction in VLSI computation modules: an information-theoretic approach (Q4680051) (← links)
- Universal bound on the performance of lattice codes (Q4701310) (← links)
- Combined array processing and space-time coding (Q4701365) (← links)
- Space-time block codes from orthogonal designs (Q4701405) (← links)
- Design of successively refinable trellis-coded quantizers (Q4701407) (← links)
- On the Trellis Complexity of the Densest Lattice Packings in $\mathbb{R}^n $ (Q4717569) (← links)
- A Constraint on the Existence of Simple Torsion-Free Lie Modules (Q4846001) (← links)
- Convergence Rate of Empirical Spectral Distribution of Random Matrices From Linear Codes (Q4963952) (← links)
- Rate of Channel Hardening of Antenna Selection Diversity Schemes and Its Implication on Scheduling (Q4974004) (← links)
- Shannon-Theoretic Limits on Noisy Compressive Sampling (Q4976066) (← links)
