5,141 research outputs found
Asymptotically-Optimal, Fast-Decodable, Full-Diversity STBCs
For a family/sequence of STBCs , with
increasing number of transmit antennas , with rates complex symbols
per channel use (cspcu), the asymptotic normalized rate is defined as . A family of STBCs is said to be
asymptotically-good if the asymptotic normalized rate is non-zero, i.e., when
the rate scales as a non-zero fraction of the number of transmit antennas, and
the family of STBCs is said to be asymptotically-optimal if the asymptotic
normalized rate is 1, which is the maximum possible value. In this paper, we
construct a new class of full-diversity STBCs that have the least ML decoding
complexity among all known codes for any number of transmit antennas and
rates cspcu. For a large set of pairs, the new codes
have lower ML decoding complexity than the codes already available in the
literature. Among the new codes, the class of full-rate codes () are
asymptotically-optimal and fast-decodable, and for have lower ML decoding
complexity than all other families of asymptotically-optimal, fast-decodable,
full-diversity STBCs available in the literature. The construction of the new
STBCs is facilitated by the following further contributions of this paper:(i)
For , we construct -group ML-decodable codes with rates greater than
one cspcu. These codes are asymptotically-good too. For , these are the
first instances of -group ML-decodable codes with rates greater than
cspcu presented in the literature. (ii) We construct a new class of
fast-group-decodable codes for all even number of transmit antennas and rates
.(iii) Given a design with full-rank linear dispersion
matrices, we show that a full-diversity STBC can be constructed from this
design by encoding the real symbols independently using only regular PAM
constellations.Comment: 16 pages, 3 tables. The title has been changed.The class of
asymptotically-good multigroup ML decodable codes has been extended to a
broader class of number of antennas. New fast-group-decodable codes and
asymptotically-optimal, fast-decodable codes have been include
Beamforming Techniques for Non-Orthogonal Multiple Access in 5G Cellular Networks
In this paper, we develop various beamforming techniques for downlink
transmission for multiple-input single-output (MISO) non-orthogonal multiple
access (NOMA) systems. First, a beamforming approach with perfect channel state
information (CSI) is investigated to provide the required quality of service
(QoS) for all users. Taylor series approximation and semidefinite relaxation
(SDR) techniques are employed to reformulate the original non-convex power
minimization problem to a tractable one. Further, a fairness-based beamforming
approach is proposed through a max-min formulation to maintain fairness between
users. Next, we consider a robust scheme by incorporating channel
uncertainties, where the transmit power is minimized while satisfying the
outage probability requirement at each user. Through exploiting the SDR
approach, the original non-convex problem is reformulated in a linear matrix
inequality (LMI) form to obtain the optimal solution. Numerical results
demonstrate that the robust scheme can achieve better performance compared to
the non-robust scheme in terms of the rate satisfaction ratio. Further,
simulation results confirm that NOMA consumes a little over half transmit power
needed by OMA for the same data rate requirements. Hence, NOMA has the
potential to significantly improve the system performance in terms of transmit
power consumption in future 5G networks and beyond.Comment: accepted to publish in IEEE Transactions on Vehicular Technolog
On the Uniqueness of Balanced Complex Orthogonal Design
Complex orthogonal designs (CODs) play a crucial role in the construction of
space-time block codes. Their real analog, real orthogonal designs (or
equivalently, sum of squares composition formula) have a long history. Adams et
al. (2011) introduced the concept of balanced complex orthogonal designs
(BCODs) to address practical considerations. BCODs have a constant code rate of
and a minimum decoding delay of , where is the number of
columns. Understanding the structure of BCODs helps design space-time block
codes, and it is also fascinating in its own right.
We prove, when the number of columns is fixed, all (indecomposable) balanced
complex orthogonal designs (BCODs) have the same parameters , and moreover, they are all equivalent
Novel Feedback Calculation Technique for Improved Transmit Scheme
Extended balanced space-time block coding (EBSTBC) is able to achieve large coding gain and guarantee full diversity for any number of transmit antennas. Performance of the EBSTBC has been improved with improved transmit scheme (ITS) which is combination of the EBSTBC with transmit antenna selection. Performance of the ITS with a limited number of feedback bits approaches to performance of ideal beamforming which requires ideal channel state information at the transmitter. However, the calculation of feedback information at the receiver employs exhaustive searching scheme which is very complex and energy inefficient process. In this work, a low complexity and energy efficient feedback information scheme for the ITS receiver is proposed. Theoretical and simulation results show that the calculation complexity of feedback information is decreased more than 87% and the proposed scheme yields the same bit error rate performance with the ITS. Moreover, the proposed scheme requires very low addition memory with respect to alternative schemes
Optical Time-Frequency Packing: Principles, Design, Implementation, and Experimental Demonstration
Time-frequency packing (TFP) transmission provides the highest achievable
spectral efficiency with a constrained symbol alphabet and detector complexity.
In this work, the application of the TFP technique to fiber-optic systems is
investigated and experimentally demonstrated. The main theoretical aspects,
design guidelines, and implementation issues are discussed, focusing on those
aspects which are peculiar to TFP systems. In particular, adaptive compensation
of propagation impairments, matched filtering, and maximum a posteriori
probability detection are obtained by a combination of a butterfly equalizer
and four 8-state parallel Bahl-Cocke-Jelinek-Raviv (BCJR) detectors. A novel
algorithm that ensures adaptive equalization, channel estimation, and a proper
distribution of tasks between the equalizer and BCJR detectors is proposed. A
set of irregular low-density parity-check codes with different rates is
designed to operate at low error rates and approach the spectral efficiency
limit achievable by TFP at different signal-to-noise ratios. An experimental
demonstration of the designed system is finally provided with five
dual-polarization QPSK-modulated optical carriers, densely packed in a 100 GHz
bandwidth, employing a recirculating loop to test the performance of the system
at different transmission distances.Comment: This paper has been accepted for publication in the IEEE/OSA Journal
of Lightwave Technolog
Optical multiple access techniques for on-board routing
The purpose of this research contract was to design and analyze an optical multiple access system, based on Code Division Multiple Access (CDMA) techniques, for on board routing applications on a future communication satellite. The optical multiple access system was to effect the functions of a circuit switch under the control of an autonomous network controller and to serve eight (8) concurrent users at a point to point (port to port) data rate of 180 Mb/s. (At the start of this program, the bit error rate requirement (BER) was undefined, so it was treated as a design variable during the contract effort.) CDMA was selected over other multiple access techniques because it lends itself to bursty, asynchronous, concurrent communication and potentially can be implemented with off the shelf, reliable optical transceivers compatible with long term unattended operations. Temporal, temporal/spatial hybrids and single pulse per row (SPR, sometimes termed 'sonar matrices') matrix types of CDMA designs were considered. The design, analysis, and trade offs required by the statement of work selected a temporal/spatial CDMA scheme which has SPR properties as the preferred solution. This selected design can be implemented for feasibility demonstration with off the shelf components (which are identified in the bill of materials of the contract Final Report). The photonic network architecture of the selected design is based on M(8,4,4) matrix codes. The network requires eight multimode laser transmitters with laser pulses of 0.93 ns operating at 180 Mb/s and 9-13 dBm peak power, and 8 PIN diode receivers with sensitivity of -27 dBm for the 0.93 ns pulses. The wavelength is not critical, but 830 nm technology readily meets the requirements. The passive optical components of the photonic network are all multimode and off the shelf. Bit error rate (BER) computations, based on both electronic noise and intercode crosstalk, predict a raw BER of (10 exp -3) when all eight users are communicating concurrently. If better BER performance is required, then error correction codes (ECC) using near term electronic technology can be used. For example, the M(8,4,4) optical code together with Reed-Solomon (54,38,8) encoding provides a BER of better than (10 exp -11). The optical transceiver must then operate at 256 Mb/s with pulses of 0.65 ns because the 'bits' are now channel symbols
- …