Density and bounds for Grassmannian codes with chordal distance

2011 ◽  
Author(s):  
Renaud-Alexandre Pitaval ◽  
Olav Tirkkonen ◽  
Steven D. Blostein
Keyword(s):  
Chordal Distance

Partial Interference Alignment Schemes for the K-User MIMO Interference Channel

2014 ◽  
Vol 548-549 ◽  
pp. 1368-1376
Author(s):  
Xue Lei Lv ◽  
Guo Mei Zhang ◽  
Guo Bing Li ◽  
Gang Ming Lv ◽  
Chao Zhang
Keyword(s):  
Mimo Systems ◽  
Interference Alignment ◽  
Signal Subspace ◽  
Interference Signal ◽  
Interference Channel ◽  
Precoding Matrix ◽  
Partial Interference ◽  
Chordal Distance ◽  
Simulation Results ◽  
User Interference

Partial interference alignment (PIA) strategies for the K-user interference channel are considered. Two schemes are proposed to align the partial interference for the downlink interference channel in the case ofK>3. In the first scheme, strong interferences are limited as much as possible by aligning the two strongest interferers into a same subspace at the receiver. While the second scheme is to design its precoding matrix (or vector) by selecting the precoder pair which maximizes the chordal distance between designed signal subspace and interference signal subspace in the set of pecoding matrices (or vectors) at each transmitter. Simulation results show that compared with the existing schemes which don’t optimize the precoder, such as Fixed-PIA, the proposed schemes can improve the sum rates significantly by selecting IA forms in multi-input multi-output (MIMO) systems.

Indoor experiment of multi-user MIMO user selection algorithm based on chordal distance

2013 ◽  
Author(s):  
Masato Taniguchi ◽  
Hidekazu Murata ◽  
Susumu Yoshida ◽  
Koji Yamamoto ◽  
Daisuke Umehara ◽  
...  
Keyword(s):  
User Selection ◽  
Selection Algorithm ◽  
Chordal Distance

scholarly journals Grassmannian Constellation Based on Antipodal Points and Orthogonal Design and Its Simplified Detecting Algorithm

2017 ◽  
Vol 2017 ◽  
pp. 1-8
Author(s):  
Li Peng ◽  
Dacong Hu ◽  
Lin Zhang ◽  
Zhen Qin
Keyword(s):  
Search Algorithm ◽  
Orthogonal Design ◽  
Grid Search ◽  
Matrix Operation ◽  
Unitary Space ◽  
Time Modulation ◽  
Simulation Performance ◽  
The Matrix ◽  
Chordal Distance ◽  
Grid Search Algorithm

This study presents a framework of the unitary space time modulation (USTM) constellation based on antipodal points over Grassmannian manifold. The antipodal constellation enables an intrinsic simplified ML detecting algorithm. The algebraic orthogonal USTM constellation is also an antipodal constellation which, apart from being adaptive to the antipodal simplified ML detector, also has another simplified ML detector based on its self-indexing features, and the latter is simpler because of getting rid of the matrix operation. A searching orthogonal USTM constellation based on the grid search algorithm is obtained under the presented framework and its minimum Frobenius chordal distance and simulation performance are be superior to those of the algebraic orthogonal USTM constellation.

Sign in / Sign up

Export Citation Format

Share Document