The highly sparse nature of propagation channels and the restricted use of radio frequency (RF) chains at transceivers limit the performance of millimeter wave (mmWave) multiple-input multiple- output (MIMO) systems. Introducing reconfigurable antennas to mmWave can offer an additional degree of freedom on designing mmWave MIMO systems. This paper provides a theoretical framework for studying the mmWave MIMO with reconfigurable antennas. We present an architecture of reconfigurable mmWave MIMO with beamspace hybrid analog-digital beamformers and reconfigurable antennas at both the transmitter and the receiver. We show that employing reconfigurable antennas can provide throughput gain for the mmWave MIMO. We derive the expression for the average throughput gain of using reconfigurable antennas, and further simplify the expression by considering the case of large number of reconfiguration states. In addition, we propose a low-complexity algorithm for the reconfiguration state and beam selection, which achieves nearly the same throughput performance as the optimal selection of reconfiguration state and beams by exhaustive search.

The performance of millimeter wave (mmWave) multiple-input multiple-output (MIMO) systems is limited by the sparse nature of propagation channels and the restricted number of radio frequency chains at transceivers. The introduction of reconfigurable antennas offers an additional degree of freedom on designing mmWave MIMO systems. This paper provides a theoretical framework for studying the mmWave MIMO with reconfigurable antennas. Based on the virtual channel model, we present an architecture of reconfigurable mmWave MIMO with beamspace hybrid analog-digital beamformers and reconfigurable antennas at both the transmitter and the receiver. We show that employing reconfigurable antennas can provide throughput gain for the mmWave MIMO. We derive the expression for the average throughput gain of using reconfigurable antennas in the system, and further derive the expression for the outage throughput gain for the scenarios where the channels are (quasi) static. Moreover, we propose a low-complexity algorithm for reconfiguration state selection and beam selection. Our numerical results verify the derived expressions for the throughput gains and demonstrate the near-optimal throughput performance of the proposed low-complexity algorithm.

Recent studies have numerically demonstrated the possible advantages of the asynchronous non-orthogonal multiple access (ANOMA) over the conventional synchronous non-orthogonal multiple access (NOMA). The ANOMA makes use of the oversampling technique by intentionally introducing a timing mismatch between symbols of different users. Focusing on a two-user uplink system, for the first time, we analytically prove that the ANOMA with a sufficiently large frame length can always outperform the NOMA in terms of the sum throughput. To this end, we derive the expression for the sum throughput of the ANOMA as a function of signal-To-noise ratio, frame length, and normalized timing mismatch. Based on the derived expression, we find that users should transmit at full powers to maximize the sum throughput. In addition, we obtain the optimal timing mismatch as the frame length goes to infinity. Moreover, we comprehensively study the impact of timing error on the ANOMA throughput performance. Two types of timing error, i.e., the synchronization timing error and the coordination timing error, are considered. We derive the throughput loss incurred by both types of timing error and find that the synchronization timing error has a greater impact on the throughput performance compared with the coordination timing error.

Theoretical studies on physical layer security often adopt the secrecy outage probability as the performance metric for wireless communications over quasi-static fading channels. The secrecy outage probability has two limitations from a practical point of view: 1) it does not give any insight into the eavesdropper's decodability of confidential messages and 2) it cannot characterize the amount of information leakage to the eavesdropper when an outage occurs. Motivated by the limitations of the secrecy outage probability, we propose three new secrecy metrics for secure transmissions over quasi-static fading channels. The first metric establishes a link between the concept of secrecy outage and the decodability of messages at the eavesdropper. The second metric provides an error-probability-based secrecy metric which is typically used for the practical implementation of secure wireless systems. The third metric characterizes how much or how fast the confidential information is leaked to the eavesdropper. We show that the proposed secrecy metrics collectively give a more comprehensive understanding of physical layer security over fading channels and enable one to appropriately design secure communication systems with different views on how secrecy is measured.

We propose a novel analytical framework for evaluating the coverage performance of a millimeter wave (mmWave) cellular network where idle user equipments (UEs) act as relays. In this network, the base station (BS) adopts either the direct mode to transmit to the destination UE, or the relay mode if the direct mode fails, where the BS transmits to the relay UE and then the relay UE transmits to the destination UE. To address the drastic rotational movements of destination UEs in practice, we propose to adopt selection combining at destination UEs. New expression is derived for the signal-to-interference-plus-noise ratio (SINR) coverage probability of the network. Using numerical results, we first demonstrate the accuracy of our new expression. Then we show that ignoring spatial correlation, which has been commonly adopted in the literature, leads to severe overestimation of the SINR coverage probability. Furthermore, we show that introducing relays into a mmWave cellular network vastly improves the coverage performance. In addition, we show that the optimal BS density maximizing the SINR coverage probability can be determined by using our analysis.

The Sonic Hedgehog (Shh) pathway is physiologically involved during embryogenesis, but is also activated in several diseases, including solid cancers. Previous studies have demonstrated that the Shh pathway is involved in oncogenesis, tumor progression and chemoresistance in lung cancer and mesothelioma. The Shh pathway is also closely associated with epithelial-mesenchymal transition and cancer stem cells. Recent findings have revealed that a small proportion of lung cancer cells expressed an abnormal full-length Shh protein, associated with cancer stem cell features. In this paper, we review the role of the Shh pathway in thoracic cancers (small cell lung cancer, non-small cell lung cancer, and mesothelioma) and discuss the new perspectives of cancer research highlighted by the recent data of the literature.

Hedgehog signaling pathway is physiologically activated during embryogenesis, especially in lung development. It is also reactivated in many solid tumors. In lung cancer, Hedgehog pathway is closely associated with cancer stem cells (CSCs). Recent works have shown that CSCs produced a full-length Sonic Hedgehog (Shh) protein, with paracrine activity and induction of tumor development. Hedgehog pathway is also involved in tumor drug resistance in lung cancer, as cytotoxic chemotherapy, radiotherapy, and targeted therapies. This review proposes to describe the activation mechanisms of Hedgehog pathway in lung cancer, the clinical implications for overcoming drug resistance, and the perspectives for further research.