• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.26-34
• /
• 2004

A blind interference canceller in the presence of subchipspaced multipath channels for direct-sequence code division multiple access (DS-CDMA) down-link system is considered. This technique is based on combining the existing blind interference canceller with a technique that involves assigning subchip-tap spacing to the Rake receiver. The proposed receiver minimizes the receiver’s output energy subject to a constraint in order to mitigate the multiple access interference (MAI) along each multipath component, and then suboptimally combining all the multipath components. Moreover, it is able to mitigate the mismatch problem when subchip-spaced multipath components arrive at the blind interference canceller. It is known that optimal combining techniques perform a decorrelation operation before combining, which requires both knowledge and computational complexity. In the following, we have adopted a simpler but suboptimum approach in the combining of the suppressed signals at the output of our proposed receiver. Computer simulation results verify the effectiveness of the proposed receiver to handle subchip-spaced multipath components and still suppresses MAI significantly.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.41-45
• /
• 2007

Multi-input multi-output (MIMO) system can increase data rate, capacity and bit error rate (BER) performance compare to traditional single antenna system. However MIMO technique is pointed out the problem that has high complexity to design receiver. So a recent trend of research on the MIMO system pays more attention to simplified implementation of receiver structure. In this paper, we propose differential space time block code (STBC) for MIMO system with cyclic delay diversity (CDD). This structure can provide a very close performance to that of the conventional diversity scheme with maximum likelihood (ML) detection without channel estimation block while the receiver structure is highly simplified. Bit error rate (BER) performance of the proposed system is simulated for an AWGN channel by theoretical and simulated approaches. The results of this paper can be applicable to the 4G mobile multimedia communication systems.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1354-1357
• /
• 2002

In this paper, we propose a suboptimal receiver combining adaptive array antenna and orthogonal decision-feedback detector in DS/CDMA system. Adaptive array antenna can cancel out undesired signal using beamforming scheme. However, if there are interfering signals from undesired users with the same incident angle as that of a desired user, an adaptive array antenna cannot suppress them. The proposed receiver can cancel out remaining interference from users having nearly the same beam pattern. And we employ Orthogonal Decision-Feedback Detector (ODFD) as multiuser detection. The ODFD performs as good as the decorrelating decision -feedback detector (DDD) with much less complexity. Simulation results show that the proposed system provides a significantly enhanced performance.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.443-451
• /
• 2004

Since the publication of Alamouti's famous space-time block code, various quasi-orthogonal space-time block codes (QSTBC) for multi-input multi-output (MIMO) fading channels for more than two transmit antennas have been proposed. It has been shown that these codes cannot achieve full diversity at full rate. In this paper, we present a simple feedback scheme for rich scattering (flat Rayleigh fading) MIMO channels that improves the coding gain and diversity of a QSTBC for 2$^n$ (n=3, 4, ${\cdots}$) transmit antennas. The relevant channel state information is sent back from the receiver to the transmitter quantized to one or two bits per code block. In this way, signal transmission with an improved coding gain and diversity near to the maximum diversity order is achieved. Such high diversity can be exploited with either a maximum-likelihood receiver or low-complexity zero-forcing receiver.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.888-894
• /
• 2007

The computational complexity of a sphere decoder (SD) is conventionally reduced by decoding order scheme which sorts candidate symbols in the ascending order of the Euclidean distance from the output of a zero-forcing (ZF) receiver. However, since the ZF output may not be a reliable sorting reference, we propose two types of sorting schemes to allow faster decoding. The first is to use the newly found lattice points in the previous search round instead of the ZF output (Type I). Since these lattice points are closer to the received signal than the ZF output, they can serve as a more reliable sorting reference for finding the maximum likelihood (ML) solution. The second sorting scheme is to sort candidate symbols in descending order according to the number of candidate symbols in the following layer, which are called child symbols (Type II). These two proposed sorting schemes can be combined with layer sorting for more complexity reduction. Through simulation, the Type I and Type II sorting schemes were found to provide 12% and 20% complexity reduction respectively over conventional sorting schemes. When they are combined with layer sorting, Type I and Type II provide an additional 10-15% complexity reduction while maintaining detection performance.

• International journal of advanced smart convergence
• /
• v.9 no.1
• /
• pp.98-108
• /
• 2020

We consider transmit antenna selection combined with power allocation for quadrature spatial modulation (QSM) systems to improve the error rate performance. The Euclidean distance-based joint optimization criterion is presented for transmit antenna selection and power allocation in QSM. It requires an exhaustive search and thus high computational complexity. Thus its reduced-complexity algorithm is proposed with a strategy of decoupling, which is employed to successively find transmit antennas and power allocation factors. First, transmit antennas are selected without considering power allocation. After selecting transmit antennas, power allocation factors are determined. Simulation results demonstrate considerable performance gains with lower complexity for transmit antenna selected QSM systems with power allocation, which can be achieved with limited rate feedback.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.8
• /
• pp.41-46
• /
• 2017

In this paper, we investigate the D2D Transmitter(Tx) and Receiver(Rx) pair assignment problem in the cellular system where D2D users share the uplink resource of the cellular system. Sharing the uplink resource of the cellular system may cause interference to the cellular system, though it is beneficial to improve the D2D user Capacity. Therefore, to protect the cellular users, D2D transmit power should be carefully controlled. In this work, we focus on optimal Tx-Rx assignment in such a way that the total transmit power of users is minimized. First, we consider the optimum Tx-Rx assignment in general and the corresponding complexity. Then, we propose an iterative D2D Tx-Rx assignment algorithm with low complexity that can minimize total transmit power of users. Finally, we present the numerical examples that show the complexity and the convergence to the unique transmit power level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.231-237
• /
• 2010

Multi-input multi-output (MIMO) systems are used to improve the transmission rate in proportion to the number of antennas. However, their computational complexity is very high for the detection in the receiver. The sphere decoding (SD) is a detection algorithm with reduced complexity. In this paper, an improved Schnorr-Euchner SD (SE SD) is proposed based on the minimum mean square error (MMSE) and the Euclidean distance criteria without additional complexity.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.564-571
• /
• 2014

Sphere decoding (SD) for multiple-input and multiple-output systems is a well-recognized approach for achieving near-maximum likelihood performance with reduced complexity. SD is a tree search process, whereby a large number of nodes can be searched in an effort to find an estimation of a transmitted symbol vector. In this paper, a simple and generalized approach called layer pruning is proposed to achieve complexity reduction in SD. Pruning a layer from a search process reduces the total number of nodes in a sphere search. The symbols corresponding to the pruned layer are obtained by adopting a QRM-MLD receiver. Simulation results show that the proposed method reduces the number of nodes to be searched for decoding the transmitted symbols by maintaining negligible performance loss. The proposed technique reduces the complexity by 35% to 42% in the low and medium signal-to-noise ratio regime. To demonstrate the potential of our method, we compare the results with another well-known method - namely, probabilistic tree pruning SD.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.185-186
• /
• 2007

In this paper, We propose the selective detection scheme based on pulse repetition considering Bit Error Rate (BER) performance and complexity of noncoherent Ultra Wide Band (UWB) systems. To consider system complexity, the proposed scheme transmits the UWB signals by pulse repetition at the transmitter, like the conventional Pulse Repetition Coding (PRC). However, to effectively improve BER performance of the system the proposed scheme performs selective detection by estimating the Signal-to-Noise Ratio (SNR) of the received pulse-repeated signal at the receiver. Hence, the proposed scheme effectively improves BER performance of the noncoherent UWB systems without increase of the system complexity, as compared to the conventional PRC algorithm.