most citedA New Low-Complexity Decodable Rate-1 Full-Diversity 4 x 4 STBC with Nonvanishing Determinants

5 citations · 12 across the 5 of their papers we have counts for

collaborators

5 papers

cs.IT2012★ 1 cited

A New Family of Low-Complexity Decodable STBCs for Four Transmit Antennas

Amr Ismail, Jocelyn Fiorina, Hikmet Sari

In this paper we propose a new construction method for rate-1 Fast-Group-Decodable (FGD) Space-Time-Block Codes (STBC)s for 2^a transmit antennas. We focus on the case of a=2 and w…

cs.IT2012★ 2 cited

A New Low-Complexity Decodable Rate-5/4 STBC for Four Transmit Antennas with Nonvanishing Determinants

Amr Ismail, Jocelyn Fiorina, Hikmet Sari

The use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low-complexity decodability property is taken into con…

cs.IT2012★ 4 cited

A Novel Construction of Multi-group Decodable Space-Time Block Codes

Amr Ismail, Jocelyn Fiorina, Hikmet Sari

Complex Orthogonal Design (COD) codes are known to have the lowest detection complexity among Space-Time Block Codes (STBCs). However, the rate of square COD codes decreases expone…

cs.IT2012★ 5 cited

A New Low-Complexity Decodable Rate-1 Full-Diversity 4 x 4 STBC with Nonvanishing Determinants

Amr Ismail, Jocelyn Fiorina, Hikmet Sari

Space-time coding techniques have become common-place in wireless communication standards as they provide an effective way to mitigate the fading phenomena inherent in wireless cha…

cs.IT2012

A New Family of Low-Complexity STBCs for Four Transmit Antennas

Amr Ismail, Jocelyn Fiorina, Hikmet Sari

Space-Time Block Codes (STBCs) suffer from a prohibitively high decoding complexity unless the low-complexity decodability property is taken into consideration in the STBC design.…