Reza Moosavi

A Fast Scheme for Blind Identification of Channel Codes

We present a fast mechanism for determining which channel code that was used on a communication link. In the proposed scheme, the receiver does not need to receive the entire data to determine the actual code. Moreover, the proposed scheme can also be used to determine the interleaving/scrambling sequence that was used at the transmitter. We investigate the performance of the scheme for some standard convolutional codes.

Comparison of Strategies for Signaling of Scheduling Assignments in Wireless OFDMA

This paper considers the transmission of scheduling information in orthogonal frequency-division multiple-access (OFDMA)-based cellular communication systems such as the Third-Generation Partnership Project (3GPP) long-term evolution (LTE). These systems provide efficient usage of radio resources by allowing users to be dynamically scheduled in both frequency and time. This requires considerable amounts of scheduling information to be sent to the users. This paper compares two basic transmission strategies: transmitting a separate scheduling message to each user versus broadcasting a joint scheduling message to all users. Different scheduling granularities are considered, as are different scheduling algorithms. The schemes are evaluated in the context of the LTE downlink using multiuser system simulations, assuming a full-buffer situation. The results show that separate transmission of the scheduling information requires a slightly lower overhead than joint broadcasting when proportional fair scheduling is employed and the users are spread out over the cell area. The results also indicate that the scheduling granularity standardized for LTE provides a good tradeoff between scheduling granularity and overhead.

Fast Blind Recognition of Channel Codes

We present a fast algorithm that, for a given input sequence and a linear channel code, computes the syndrome posterior probability (SPP) of the code, i.e., the probability that all parity check relations of the code are satisfied. According to this algorithm, the SPP can be computed blindly, i.e., given the soft information on a received sequence we can compute the SPP for the code without first decoding the bits. We show that the proposed scheme is efficient by investigating its computational complexity. We then consider two scenarios where our proposed SPP algorithm can be used. The first scenario is when we are interested in finding out whether a certain code was used to encode a data stream. We formulate a statistical hypothesis test and we investigate its performance. We also compare the performance of our scheme with that of an existing scheme. The second scenario deals with how we can use the algorithm for reducing the computational complexity of a blind decoding process. We propose a heuristic sequential statistical hypotheses test to use the fact that in real applications, the data arrives sequentially, and we investigate its performance using system simulations.

On Coding of Scheduling Information in OFDM

Control signaling strategies for scheduling information in cellular OFDM systems are studied. A single-cell multiuser system model is formulated that provides system capacity estimates accounting for the signaling overhead. Different scheduling granularities are considered, including the one used in the specifications for the 3G Long Term Evolution (LTE). A greedy scheduling method is assumed, where each resource is assigned to the user for which it can support the highest number of bits. The simulation results indicate that the cost of control signaling does not outweigh the scheduling gain, when compared with a simple round-robin scheme that does not need signaling of scheduling information. Furthermore, in the studied scenario, joint coding and signaling of scheduling information over all selected users is found to be superior to separate coding and signaling for each user. The results also indicate that the scheduling granularity used for LTE provides better performance than the full granularity.

Complexity reduction of blind decoding schemes using CRC splitting

Blind decoding, used on control channels of some multi-user wireless access systems, is a technique for achieving adaptive modulation and coding. The idea is to adapt the modulation and coding scheme to the channel quality but instead of signaling the parameters used explicitly, the receiver blindly tries a number of fixed parameter combinations until a successful decoding attempt is detected, with the help of a cyclic redundancy check. In this paper we suggest a new method for reducing the complexity and energy consumption associated with such blind decoding schemes. Our idea is to use a mini-CRC injected early in the data stream to determine if the current decoding attempt is using the correct modulation and coding parameters. We analyze and exemplify the complexity gain of this approach and also investigate the impact of the rearrangement of the CRC scheme in terms of the probability of undetected error. The presented results for the complexity gain are promising and the impact on the error detection capability turns out to be small if any.

Piggybacking an Additional Lonely Bit on Linearly Coded Payload Data

We provide a coding scheme, by which an additional lonely bit can be piggybacked on a payload data packet encoded with a linear channel code, at no essential extra cost in power or bandwidth. The underlying principle is to use the additional bit to select which of two linear codes that should be used for encoding the payload packet, this way effectively creating a nonlinear code. We give a fast algorithm for detecting the additional bit, without decoding the data packet. Applications include control signaling, for example, transmission of ACK/NACK bits.

On automatic establishment of relations in 5G radio networks

One of the first key self-organizing features introduced in LTE was Automatic Neighbor Relations (ANR), a function for automatically generating relations between radio network entities that is needed for many features such as active-mode mobility, load balancing and dual connectivity. Given the benefits of ANR in LTE, we foresee that procedures for relations establishment will be an important integrated part of 5G systems as well. Moreover, the new emerging technology components of 5G such as massive beamforming expand the scope of relations beyond the neighbor relations of LTE. In this paper, we give an overview of key 5G radio access components, discuss the need for different types of identifiers and relations, and comment on the impact from the ultra-lean design principle of 5G. The paper also discusses some possible procedures for automatic relation establishment in consideration of the specific 5G aspects.

Optimized Encoding of Scheduling Assignments Using Finite Blocklength Coding Bounds

We provide an analytical framework for optimizing the number of resources required for the signaling of scheduling information in wireless multiple access systems. In doing so, we use recent bounds on the achievable rate in the finite blocklength regime. We formulate optimization problems for finding the minimum required number of channel uses such that the overall error probability in the decoding of the control information is below a given threshold. Three specific control signaling schemes are compared.

Fast identification of control signaling aided by please-decode-blindly (PDB) messages

Blind decoding of control information is used in some wireless multiple access systems such as LTE to achieve adaptive modulation and coding, as well as to address the multiple access problem on the control channel. Blind decoding incurs high computational complexity in mobile terminals. In this paper, we describe a scheme to reduce the computational complexity associated with the blind decoding. The main idea is to broadcast a “please-decode-blindly” message to all terminals that are eligible for scheduling, to instruct a subset of the terminals to perform the blind search. We propose two schemes to implement our idea and we investigate their performances via system simulations.