• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.167-167
• /
• 2004

The system combined layered space-time processing and space-time trellis codes (STTC) provide high transmission rate as well as diversity and coding gain without bandwidth expansion. In this paper, two layered receiver structures are proposed. One is the LSTT-MMSE in which received bit streams are decoupled by interference nulling and then decoded by separate STTC decoders. The decoded outputs are cancelled from the received signal before advancing to the next layer detection. The other is LSTT-Whitening employing whitening rather than nulling. The receiver employing whitening process shows several advantages on diversity gain and the required number of receive antennas compare to the convolutional coded space-time processing. The proposed receivers use different decoding order scheme according to each interference suwression. The (4, 3) LSTT-Whitening receiver still achieves 1㏈ gain over the (4, 4) LSTT-MMSE and the (4, 4) coded layered space-time processing.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.9-14
• /
• 2004

The system combined layered space-time processing and space-time trellis codes (STTC) provide high transmission rate as well as diversity and coding gain without bandwidth expansion. In this paper, two layered receiver structures are proposed. One is the LSTT-MMSE in which received bit streams are decoupled by interference nulling and then decoded by separate STTC decoders. The decoded outputs are cancelled from the received signal before advancing to the next layer detection. The other is LSTT-Whitening employing whitening rather than nulling. The receiver employing whitening process shows several advantages on diversity gain and the required number of receive antennas compare to the convolutional coded space-time processing. The proposed receivers use different decoding order scheme according to each interference suwression. The (4, 3) LSTT-Whitening receiver still achieves 1㏈ gain over the (4, 4) LSTT-MMSE and the (4, 4) coded layered space-time processing.

• Journal of IKEEE
• /
• v.24 no.3
• /
• pp.838-844
• /
• 2020

In this paper, we propose an efficient Viterbi processor using Joint Viterbi detection and decoding (JVDD) algorithm for a for bluetooth low energy (BLE) system. Since the convolutional coded Gaussian minimum-shift keying (GMSK) signal is specified in the BLE 5.0 standard, two Viterbi processors are needed for detection and decoding. However, the proposed JVDD scheme uses only one Viterbi processor by modifying the branch metric with inter-symbol interference information from GMSK modulation; therefore, the hardware complexity can be significantly reduced without performance degradation. Low-latency and low-complexity hardware architecture for the proposed JVDD algorithm was proposed, which makes Viterbi decoding completed within one clock cycle. Viterbi Processor RTL synthesis results on a GF55nm process show that the gate count is 12K and the memory unit and the initial latency is reduced by 33% compared to the modified state exchange (MSE).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.21-26
• /
• 2013

In this paper we propose a system where we divide the group with 2 symbols. The two added symbols are separated by multiplexing and later added using the DE-multiplexing technique. In our proposed system a simple Partial Interference Cancelation (PIC) group decoding scheme is used for Double-ABBA(D-ABBA) Quasi-Orthogonal Space Time Code, which reduces the decoding complexity for the higher order Multiple Input Multiple Output (MIMO) space time block coding. Finally we compare the proposed scheme performance using the different modulation schemes.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.270-279
• /
• 2014

The Viterbi decoding algorithm, which provides maximum - likelihood decoding, is currently considered the most widely used technique for the decoding of codes having a state description, including the class of linear error-correcting convolutional codes. Two classes of nonbinary convolutional codes are presented. Distance preserving mapping convolutional codes and M-ary convolutional codes are designed, respectively, from the distance-preserving mappings technique and the implementation of the conventional convolutional codes in Galois fields of order higher than two. We also investigated the performance of these codes when combined with a multiple frequency-shift keying (M-FSK) modulation scheme to correct narrowband interference (NBI) in power-line communications channel. Themodification of certain detectors of the M-FSK demodulator to refine the selection and the detection at the decoder is also presented. M-FSK detectors used in our simulations are discussed, and their chosen values are justified. Interesting and promising obtained results have shown a very strong link between the designed codes and the selected detector for M-FSK modulation. An important improvement in gain for certain values of the modified detectors was also observed. The paper also shows that the newly designed codes outperform the conventional convolutional codes in a NBI environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.338-343
• /
• 2005

MIMO(Multiple Input Multiple Output) systems are considered as one of the most promising systems for next generation mobile communication systems which require efficient frequency resource utilization as well as high data rate transmissions. BLAST-STTC is the MIMO system which transmits information from many of STTC encoder groups with two transmit antennas and cancels the interference from other groups in receiver. In this paper we propose a reverse-ordered iterative decoding scheme for BLAST-STTC systems which achieve full diversity gain for all groups and improve the performance of interference cancellation, and compare the error performance of the proposed scheme with general schemes.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.511-517
• /
• 2011

The capacity of wireless ad-hoc networks is analyzed for all kinds of information dissemination based on single and multiple packet reception schemes under the physical model. To represent the general information dissemination scheme, we use (n, m, k)-cast model [1] where n, m, and k (k ${\leq}$ m) are the number of nodes, destinations and closest destinations that actually receive packets from the source in each (n, m, k)-cast group, respectively. We first consider point-to-point communication, which implies single packet reception between transmitter-receiver pairs and compute the (n, m, k)-cast communications. Next, the achievable throughput capacity is computed when receiver nodes are endowed with multipacket reception (MPR) capability. We adopt maximum likelihood decoding (MLD) and successive interference cancellation as optimal and suboptimal decoding schemes for MPR. We also demonstrate that physical and protocol models for MPR render the same capacity when we utilize MLD for decoding.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.18-25
• /
• 2020

In the fifth generation (5G) and beyond 5G (B5G) mobile communication, non-orthogonal multiple access (NOMA) has attracted great attention due to higher spectral efficiency and massive connectivity. We investigate the impacts of the channel estimation errors on the bit-error rate (BER) of NOMA, especially with the single-user decoding (SUD) receiver, which does not perform successive interference cancellation (SIC), in contrast to the conventional SIC NOMA scheme. First, an analytical expression of the BER for SUD NOMA with channel estimation errors is derived. Then, it is demonstrated that the BER performance degrades severely up to the power allocation less than about 20%. Additionally, we show that for the fixed power allocation of 10% in such power allocation range, the signal-to-noise (SNR) loss owing to channel estimation errors is about 5 dB. As a consequence, the channel estimation error should be considered for the design of the SUD NOMA scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.1954-1971
• /
• 2017

In this work, first, a multiuser detection (MUD) algorithm based on component-level soft interference cancellation and linear minimum mean square error (CLSIC-LMMSE) is proposed, which can enhance the bit error ratio (BER) performance of the traditional SIC-LMMSE-based MUD by mitigating error propagation. Second, for non-binary low density parity check (NB-LDPC) coded high-order modulation systems, when the proposed algorithm is integrated with partial mapping, the receiver with iterative detection and decoding (IDD) achieves not only better BER performance but also significantly computational complexity reduction over the traditional SIC-LMMSE-based IDD scheme. Extrinsic information transfer chart (EXIT) analysis and numerical simulations are both used to support the conclusions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.160-165
• /
• 2007

In this paper, we propose a novel signal detection method that achieves the maximum likelihood (ML) performance but requires much less computational complexity than the ML detection. When the well-known linear decoding method is used for space-time block coded (STBC) OFDM systems in fast-fading channels, co-channel interference (CCI) as well as inter-carrier interference (ICI) occurs. A maximum likelihood (ML) method can be employed to deal with the CCI; however, its computational complexity is very high. In this paper, we propose a signal detection method for orthogonal space-time coded OFDM systems that achieves the similar error performance as the ML method, but requires much less computational complexity.