The security of SHA-0 with various message schedules is discussed in this letter. SHA-0 employs a primitive polynomial of degree 16 over GF(2) in its message schedule. For each primitive polynomial, a SHA-0 variant can be constructed. The collision resistance and the near-collision resistance of SHA-0 variants to the Chabaud-Joux attack are evaluated. Moreover, the near-collision resistance of a variant to the Biham-Chen attack is evaluated. It is shown that the selection of primitive polynomials highly affects the resistance. However, it is concluded that these SHA-0 variants are not appropriate for making SHA-0 secure.

This letter reports laboratory experiments of trellis-coded multiple-antenna systems. We evaluate the effect of spatial interleaving for the vector Viterbi algorithm under several conditions such as line-of-sight (LOS), non-LOS propagation, frequency-flat and frequency-selective channels.

This paper considers coordinated linear precoding for rate optimization in downlink multicell, multiuser orthogonal frequency-division multiple access networks. We focus on two different design criteria. In the first, the weighted sum-rate is maximized under transmit power constraints per base station. In the second, we minimize the total transmit power satisfying the signal-to-interference-plus-noise-ratio constraints of the subcarriers per cell. Both problems are solved using standard conic optimization packages. A less complex, fast, and provably convergent algorithm that maximizes the weighted sum-rate with per-cell transmit power constraints is formulated. We approximate the non-convex weighted sum-rate maximization (WSRM) problem with a solvable convex form by means of a sequential parametric convex approximation approach. The second-order cone formulations of an objective function and the constraints of the optimization problem are derived through a proper change of variables, first-order linear approximation, and hyperbolic constraints transformation. This algorithm converges to the suboptimal solution while taking fewer iterations in comparison to other known iterative WSRM algorithms. Numerical results are presented to demonstrate the effectiveness and superiority of the proposed algorithm.

Co-channel interference is a major factor limiting spectral efficiency of a cellular radio system. The trellis-coded co-channel interference canceller (TCC) leading to the significant increase of traffic capacity of a cellular system has been proposed. In this scheme, a maximum-likelihood sequence estimation implemented with the Viterbi algorithm is extended to estimate both desired signal and co-channel interference, and combined with trellis-coded modulation to enhance the co-channel interference cancelling capability. The complexity of TCC grows exponentially with the channel memory and the constraint length of the trellis encoder. In this paper, two reduced-state sequence estimation algorithms, namely, the delayed decision feedback sequence estimation and the M-algorithm, are applied to TCC and their performance is compared. In addition, effective trellis coded modulation schemes to reduce the computational complexity are proposed. The performance of these schemes is examined through simulations, and compared to that of a conventional interference canceller.

Personal communication systems are increasingly required to accommodate not only voice traffic, but also various types of data traffic. Generally speaking, voice traffic is symmetric between uplink and downlink, while data traffic can be highly asymmetric. It is therefore inefficient to accommodate data in a conventional TDMA/TDD system with fixed TDD boundary. In this paper, focusing on the continuous data traffic which requires multi-slots in a circuit based TDMA/TDD system, an algorithm is proposed in which the TDD boundary are moved adaptively to accommodate data traffic efficiently. Comparing with the boundary-fixed conventional algorithm, computer simulations confirm that the proposed algorithm has superior performance in the excessive transmission delay of data while maintaining the performance of voice. The intercell interference between mobiles due to different TDD boundaries is also confirmed to be negligible. Moreover, almost the similar performance improvements of the proposed algorithm are confirmed for two different average message sizes of data calls.

The present paper focuses on the application of the base station cooperation (BSC) technique in fractional frequency reuse (FFR) networks. Fractional frequency reuse is considered to be a promising scheme for avoiding the inter-cell interference problem in OFDMA cellular systems, such as WiMAX, in which the edge mobile stations (MSs) of adjacent cells use different subchannels for separate transmission. However, the problem of FFR is that the cell edge spectral efficiency (SE) is much lower than that of the cell center. The BSC technique, in which adjacent BSs perform cooperative transmission for one cell edge MS with the same channel, may improve the cell edge SE. However, since more BSs transmit signals for one cell edge MS, the use of BSC can also increase the inter-cell interference, which might degrade the network performance. In this paper, with a focus on this tradeoff, we propose an adaptive BSC scheme in which BSC is only performed for the cell edge MSs that can achieve a significant capacity increase with only a slight increase in inter-cell interference. Moreover, a channel reallocation scheme is proposed in order to further improve the performance of the adaptive BSC scheme. The simulation results reveal that, compared to the conventional FFR scheme, the proposed schemes are effective for improving the performance of FFR networks.

In this paper we discuss the binary spreading sequences whose spectral distributions are DC free and spectral distribution's shapes can be easily controlled by a certain parameter denoted by δ. The newly developed sequences, referred to as modified antisymmetric M-sequences, are modified-versions of the conventional antisymmetric (AS)M-sequences. The proposed sequences are designed to increase the varieties of spectral distribution's shapes and improve the correlation properties when compared to those of the FM coded M-sequences which have already proposed by Tsuzuki et al. Some typical line coded M-sequences, i.e. the (differential) Manchester coded M-sequences and the FM coded M-sequences, and the conventional AS M-sequences are included in the set of proposed sequences. The improvement of the average BER (bit error rate) performance for asynchronous DS/SSMA (direct sequence/spread spectrum multiple access) systems using the proposed sequences in comparison to the system using the conventional AO/LSE (auto-optimal phase with least sidelobe energy) M-sequences is also shown.

We developed two types of practical maximum-likelihood detectors (MLD) for multiple-input multiple-output (MIMO) systems, using a field programmable gate array (FPGA) device. For implementations, we introduced two simplified metrics called a Manhattan metric and a correlation metric. Using the Manhattan metric, the detector needs no multiplication operations, at the cost of a slight performance degradation within 1 dB. Using the correlation metric, the MIMO-MLD can significantly reduce the complexity in both multiplications and additions without any performance degradation. This paper demonstrates the bit-error-rate performance of these MLD prototypes at a 1 Gbps-order real-time processing speed, through the use of an all-digital baseband 44 MIMO testbed integrated on the same FPGA chip.

The present paper proposes two novel and practical schemes for distributed and asynchronous power control in wireless ad hoc networks, in which users dynamically share several frequency bands as in "cognitive radio" networks. These schemes iteratively adjust transmit powers of individual network transmitters with respect to mutually caused interference in the shared bands. Their most attractive feature is that they find network-wide acceptable trade-offs to diverse signal-to-noise and interference (SINR) requirements and efficiently use techniques of stochastic approximation and time-averaging to guarantee a robust performance in random channels. Advantageously, both proposed algorithms do not assume any particular modulation, coding, QoS measure definition or network architecture, which assures their high applicability in the industry and research. Moreover, the broad definition and non-linear nature of these schemes mathematically generalize and thus encompass as a special case many widely deployed power control schemes such as e.g. those for achieving fixed SINR targets or using game-theoretic utility maximization. Simulations are provided to illustrate our approach and its better performance compared to standard algorithms.

An efficient scheme is proposed which achieves the oblivious transfer with probabilistic receipt, α-OT, approximately for 0 < α < 1. The proposed scheme approximates α-OT with 2-i-OT for i = 1,2,...,k. It implements γ-OT for some γ such that (α - 2-k) / (1 - 2-k) < γ α with - log (1 - α) invocations of 2-1-OT and at most 2 invocations of 2-i-OT for each i = 2,...,k. These invocations can be executed in parallel.

Co-channel interference is a major deteriorating factor limiting the capacity of mobile communication systems. To mitigate the effect of the interference, a kind of nonlinear interference canceller named trellis-coded co-channel interference canceller (TCC) has been proposed. In TCC the trellis-coded modulation (TCM) is introduced to both the desired signal and the interference signal in order to enhance the cancelling performance. In this paper, the bit error rate (BER) performance of TCC in static channel is theoretically evaluated for the first time. An equivalent TCM (E-TCM) model is firstly established, and a BER asymptotic estimate (AE) and a BER upper bound (UB) of TCC are then evaluated respectively by analyzing E-TCM. In the evaluation of AE, the BER performance is calculated as a function of phase difference between the desired signal and the interference signal (φ), subsequently the average BER performance over φ can be evaluated. The UB of BER is calculated using a transfer function based on the matrix representation. This paper also demonstrates that AE gives higher accuracy and less calculation complexity than UB. Performance comparisons reveal the consistency of these theoretical results with that of computer simulations.

Multihop network is an approach utilizing distributed wireless stations for relaying. In this system, area size, coverage and total transmit power efficiency can be improved. It is shown by computer simulations that the cooperative relaying scheme provides transmit diversity effect, and can offer much better performance compared with that of non-cooperation case. To confirm this superior performance in actual environments, field trials using real time communication equipments are now being planned. This paper reports the design and the performance of wireless equipments for field trials.

A QoS support technique for easily minimizing delay in multihop wireless networks is proposed. Using a priority queue operation that reduces delays overall, the proposed technique, Reduced Congestion Queuing (RCQ), solves problems peculiar to multihops. By adding RCQ to a multihop system, base station or access point density and cost can be more effectively curtailed than by simply applying multihops to a cellular network or wireless LAN because RCQ expands the multihop service area. Due to its simplicity, the proposed technique can be used in a wide range of applications, including VoIP.

A routing algorithm, utilizing two-hop relaying when necessary, is proposed to enhance the system capacity of code division multiple access (CDMA) cellular systems. Up to now, multihop relaying is applied to cellular systems mainly with the aim of decreasing the transmit power of each mobile station or extending the cell coverage area. Here, in this paper, potential benefit of multihop relaying is studied so as to increase the system capacity. A condition for the interference to be reduced by changing single-hop connections to two-hop connections is analyzed. In addition, a new route selection criterion maximizing the amount of interference reduction is proposed. Simulation results reveal that the proposed criterion is superior to the conventional criterion minimizing the total transmit power in respect of the amount of interference reduction. By using this criterion, an efficient routing algorithm for two-hop CDMA cellular systems is proposed to enhance the system capacity. Simulation results also indicate that by using the proposed routing algorithm in combination with a call admission control, the system capacity is increased even under heavy traffic conditions.

Hot spot service based on wireless LANs is expected to play an important role in the beyond 3G wireless networks. Although spatial coverage is very limited, a comfortable and higher speed compared with a cellular system is available there. However, there might exist nodes that cannot communicate directly with an Access Point (AP) because of the distant location or the shadowing due to obstacles. Accordingly, the introduction of two-hop relaying to the hot spot is useful to extend the coverage and avoid the dead spot. However, the throughput per node is getting decreased as the hot spot coverage area increases. Therefore, in this paper, we propose a scheme to reuse the same channel spatially wherever possible and apply it to the HiperLAN/2 based wireless LAN hot spot with two-hop relaying to compensate for the decrease of the throughput per node. Namely, we modify the HiperLAN/2 protocol in such a way that a time slot is reused at the nodes spatially separated far enough not to cause packet collision. Thus, the throughput is expected to be improved and confirmed by a theoretical analysis and computer simulations.

Advanced Evolved Universal Terrestrial Radio Access (Advanced E-UTRA), called LTE-Advanced, has been standardized in the 3rd Generation Partnership Project (3GPP) as a candidate for IMT-Advanced. LTE-Advanced supports spatial orthogonal-resource transmit diversity (SORTD) [1],[2] for ACK/NACK signals and scheduling requests (SRs), which are used to control downlink hybrid automatic repeat requests (HARQs) and manage uplink radio resources based on uplink data traffic, respectively. Both ACK/NACK signals and SRs are carried via a physical uplink control channel (PUCCH) [3], and a common PUCCH format is used for both ACK/NACK signals and SRs. If SORTD is used, the base station assigns mutually orthogonal resources to each antenna included in the user equipment (UE) for ACK/NACK signals and SRs; hence, the number of required resources increases with the number of transmitting antennas in the UE. In this paper, we study the resource reduction method for ACK/NACK signal and SR in case of SORTD using the concept of common resource. In addition, we investigate a phase rotation scheme for common resources to improve the SR detection performance.

To increase the spectral utilization efficiency of a wireless link, multiple-input multiple-output (MIMO) systems can be employed to transmit several data streams in parallel at the same time and on the same frequency but from different transmit antennas. However, at the receiver side multi-stream detection is needed. In this paper, ordered successive MMSE detection (OSD) is considered as a low-complexity detection scheme. OSD's main computational cost lies in computing the nulling weights that correspond to each stage of successive detection. In this paper, we develop an efficient semi-adaptive approach to generate MMSE weights. This semi-adaptive approach efficiently combines two approaches: channel estimates-based direct matrix inversion weights generation (direct approach) and Recursive Least Squares (RLS) algorithm-based weights generation (adaptive approach). Although the direct approach alone performs better than the adaptive approach, it is more complex for updating weights within the tracking mode. On the other hand, the adaptive approach alone is less complex in updating weights within the tracking mode, but converges slowly within the training mode. Our combined semi-adaptive approach effectively offsets these disadvantages. We demonstrate, through computer simulations, that the semi-adaptive approach can achieve the BER of the direct approach in slow time-varying MIMO channels, while its computational complexity is less than or comparable to that of the adaptive approach.

Cooperative relaying (CR) is a promising technique to provide spatial diversity by combining multiple signals from source and relay stations. In the present paper, the impact and use of the asymmetric property in bi-directional CR under asymmetric traffic conditions are discussed assuming that CR involves one communication pair and one relay station in a time division duplex (TDD) system. The asymmetric property means that the average communication quality differs for each transmission direction because of the difference in signal power between the combined signals for each direction. First, numerical results show the asymmetric property of bi-directional CR. Next, in order to evaluate the impact of the asymmetric property, the optimal relay position and resource allocation are compared to those in simple multi-hop relaying, which does not have the asymmetric property. Numerical results show that, in order to maximize the overall quality of bi-directional communication, the optimal relay position in CR depends on the offered traffic ratio, which is defined as the traffic ratio of each transmission direction, while the offered traffic ratio does not affect the optimal relay position in multi-hop relaying. Finally, the asymmetric property is used to enhance the overall quality. Specifically, a high overall quality can be achieved by, for example, opportunistically switching to the transmission direction with higher quality. Under asymmetric traffic conditions, weighted proportionally fair scheduling (WPFS), which is proposed in the context of downlink scheduling in a cellular network, is applied to transmission direction switching. Numerical results reveal that WPFS provides a high overall quality and that the quality ratio is similar to the offered traffic ratio.

A new dynamic channel allocation algorithm which is integrated with transmitting power control is proposed. By introducing a new threshold, referred to as TPC threshold (Transmitting Power Control threshold), which is added some margin to the threshold of channel allocation, the subsequent transmitting power control can be performed effectively. This DCA algorithm can achieve a cellular system with both high traffic capacity and high service quality such as interference frequency performance simultaneously. The computer simulation shows that this DCA algorithm improves blocking probability performance 4 times better than that of DECT system at 14 Erlang, while keeping the same interference frequency and forced termination performances.