CISS 2008 - PDF Preprint Papers

CISS 2008 Conference on Information Sciences and Systems

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CISS-2008 Paper

click to vote

CISS
2008
IEEE

250views Information Technology» more CISS 2008»

Adaptive codebook for beamforming in limited feedback MIMO systems

14 years 7 months ago

Download www.ruf.rice.edu

—We propose a new scheme for limited feedback in MIMO systems. We consider transmit beamforming and receiver maximal ratio combining as a base for our work, and propose a novel b...

Kiarash Amiri, Davood Shamsi, Behnaam Aazhang, Jos...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	250	Adaptive codebook for beamforming in limited feedback MIMO systems	claim
2	230	Quickest spectrum sensing in cognitive radio	claim
3	223	1-Bit compressive sensing	claim
4	216	Cramer Rao bound on target localization estimation in MIMO radar systems	claim
5	207	Distributed power control in wireless ad hoc networks using message passing: Throughput optimality and network utility maximization	claim
6	207	Peer-to-Peer utility maximization	claim
7	194	On the delay and throughput of digital and analog network coding for wireless broadcast	claim
8	183	Costas array generator polynomials in finite fields	claim
9	179	Reconstruction of compressively sensed images via neurally plausible local competitive algorithms	claim
10	172	Resource allocation algorithms for multiuser cooperative OFDMA systems with subchannel permutation	claim
11	172	Coordinated beamforming for the multi-cell multi-antenna wireless system	claim
12	172	Cross-layer multicommodity capacity expansion on ad hoc wireless networks of cognitive radios	claim
13	170	Compressed channel sensing	claim
14	168	Overlay protection against link failures using network coding	claim
15	166	Game theory for heterogeneous flow control	claim
16	166	Diversity-multiplexing tradeoff for the multiple-antenna wire-tap channel	claim
17	165	A low complexity linear multiuser MIMO beamforming system with limited feedback	claim
18	164	Distributed detection in the presence of frequency offset and phase shift	claim
19	159	Client-centric fractional frequency reuse based on user cooperation in OFDMA networks	claim
20	158	Improved sum-rate optimization in the multiuser MIMO downlink	claim
21	157	Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo	claim
22	155	Sum transmission power of multiple cooperative secondary transmitters in dynamic spectrum access networks	claim
23	151	The Chinese Generals Problem	claim
24	151	Network distribution capacity and content-pipe gap	claim
25	151	Bandwidth allocation games under budget and access constraints	claim
26	147	Achieving network stability and user fairness through admission control of TCP connections	claim
27	146	Appropriate control of wireless networks with flow level dynamics	claim
28	145	Sparsity in MRI RF excitation pulse design	claim
29	144	Subgradient methods in network resource allocation: Rate analysis	claim
30	144	Distributed estimation in wireless sensor networks via variational message passing	claim
31	143	On the achievable rates for the relay channels with generalized feedback	claim
32	143	A genetic algorithm for designing constellations with low error floors	claim
33	143	Portfolio diversification using subspace factorizations	claim
34	142	Information theory based estimator of the number of sources in a sparse linear mixing model	claim
35	137	Optimal rate control policies for proportional fairness in wireless networks	claim
36	137	On the frame error rate of transmission schemes on quasi-static fading channels	claim
37	136	Distributed processing in frames for sparse approximation	claim
38	134	Optimizing redundancy using MDS codes and dynamic symbol allocation in mobile ad hoc networks	claim
39	134	Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm	claim
40	134	Bandwidth exchange as an incentive for relaying	claim
41	134	A linear integer programming approach to analyze P2P media streaming	claim
42	132	Resource and power costs in dynamic spectrum allocation	claim
43	131	On flat-rate and usage-based pricing for tiered commodity internet services	claim
44	129	Network tomography based on additive metrics	claim
45	128	Incorporating retransmission diversity in quality-of-service guaranteed multi-user scheduling	claim
46	128	Relay selection methods for wireless cooperative communications	claim
47	128	Detection of anomalous meetings in a social network	claim
48	126	Secure transmission power of cognitive radios for dynamic spectrum access applications	claim
49	125	Imperfect randomized algorithms for the optimal control of wireless networks	claim
50	124	Distance vectors in Costas arrays	claim
51	123	A distributed scheme for detection of information flows	claim
52	122	On optimal training and beamforming in uncorrelated MIMO systems with feedback	claim
53	122	Real equiangular frames	claim
54	120	Accelerated costas array enumeration using FPGAs	claim
55	120	Distributed antenna system: Performance analysis in multi-user scenario	claim
56	119	Distributed computation of a sparse cover in sensor networks without location information	claim
57	118	Distributed algorithm and reversible network	claim
58	118	On the degrees-of-freedom of the MIMO interference channel	claim
59	117	Distributed interference pricing for OFDM wireless networks with non-separable utilities	claim
60	116	Achievable rates and training optimization for fading relay channels with memory	claim
61	116	The information-outage probability of finite-length codes over AWGN channels	claim
62	116	Effects of cooperation on the secrecy of multiple access channels with generalized feedback	claim
63	116	An efficient adaptive distributed space time coding scheme for cooperative relaying	claim
64	115	Equilibria and price of anarchy in parallel relay networks with node pricing	claim
65	114	Random access over multiple access channels: A queuing perspective	claim
66	113	Progress on pricing with peering	claim
67	113	A lower-bound on the number of rankings required in recommender systems using collaborativ filtering	claim
68	112	Adversarial interference models for multiantenna cooperative systems	claim
69	111	Short-term fairness and long-term QoS	claim
70	111	Costas permutations in the continuum	claim
71	111	Radio scene analysis using trilinear decomposition	claim
72	110	The Dantzig selector and generalized thresholding	claim
73	110	Dynamic data compression for wireless transmission over a fading channel	claim
74	110	Iteratively Re-weighted Least Squares minimization: Proof of faster than linear rate for sparse recovery	claim
75	109	Bandwidth-sharing in overloaded networks	claim
76	108	Optimal path planning for mobile backbone networks	claim
77	108	End-to-end bandwidth and available bandwidth estimation in multi-hop IEEE 802.11b ad hoc networks	claim
78	108	On sparse representations of linear operators and the approximation of matrix products	claim
79	108	Frames in bioimaging	claim
80	108	Performance evaluation of error control protocols over finite-state Markovian channels	claim
81	107	Grassmannian beamforming for MIMO amplify-and-forward relaying	claim
82	107	Channel modeling and detector design for dynamic mode high density probe storage	claim
83	106	Compressive sensing	claim
84	106	Modelling multi-path problems	claim
85	106	On wireless network scheduling with intersession network coding	claim
86	106	Network coding on line networks with broadcast	claim
87	105	Energy-efficient adaptive MIMO systems leveraging dynamic spare capacity	claim
88	104	Resource allocation for cooperative relaying	claim
89	103	MIMO-assisted channel-based authentication in wireless networks	claim
90	102	Peer-to-peer live streaming: Optimality results and open problems	claim
91	101	Throughput of random access without message passing	claim
92	100	Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view	claim
93	100	Rate adaptation via link-layer feedback for goodput maximization over a time-varying channel	claim
94	100	Outer bound and noisy-interference sum-rate capacity for symmetric Gaussian interference channels	claim
95	99	Identifying sufficient statistics in information networks	claim
96	97	Memory-constrained ML-optimal tree search detection	claim
97	94	Fusion frames and robust dimension reduction	claim
98	93	Optimization via communication networks	claim
99	93	Higher dimensional generalizations of the Costas property	claim
100	93	Diversity-multiplexing gain tradeoff with peak to average power ratio constraints	claim
101	93	Measuring interference in overcomplete signal representations	claim
102	91	Two experimental pearls in Costas arrays	claim
103	89	Interference management for multiuser two-way relaying	claim
104	89	Partial side information problem: Equivalence of two inner bounds	claim
105	88	A new approach to counting broadcast trees	claim
106	87	Frames for linear reconstruction without phase	claim
107	87	On the energy-delay trade-off of a two-way relay network	claim
108	85	Optimizing wireless networks for heterogeneous spatial loads	claim
109	85	Throughput and delay analysis of wireless random access networks	claim
110	85	Unsupervised distributional anomaly detection for a self-diagnostic speech activity detector	claim
111	84	Optimal memoryless relays with noncoherent modulation	claim
112	82	Revisiting the optimal scheduling problem	claim
113	81	Optimal resource allocation for OFDM uplink communication: A primal-dual approach	claim
114	81	Multiuser linear precoding for cooperating base stations with asynchronous interference	claim
115	75	Robust cognitive beamforming with partial channel state information	claim
116	72	Sequential placement of reference levels in a level-crossing analog-to-digital converter	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers