Reflecting on this week’s content focusing on ethical leadership, strategy, and alliances, develop an essay responding to the following questions
How has HSBC adapted its global strategy to operate in China, both before and after China’s WTO accession?
Discuss HSBC’s strategy for entering and operating in other emerging markets. Where has it found success, and where has it faced setbacks? Why?
What are the pros and cons of HSBC’s “Managing for Growth” strategy?
simplified to ensure that the proposed algorithms could be performed with low complexity. Hence, a simplified sub-optimal algorithm for multiuser pairing with proportional fairness is proposed namely SS-PFMPA. The Hungarian algorithm is shown in Abrar et al. (2014), Li et al. (2012), Chen et al. (2011) and Binary Switching Algorithm as shown in Zeger & Gersho (1990) have been implemented in Ruder et al. (2013). The paper focuses on the optimisation of user pairing and frequency allocation when V-MIMO of the SC-FDMA model is used. The combination of the Hungarian and Binary Switching algorithms performs both the user pairings and frequency allocation. The two algorithm approach is based on a optimal effort which has high computational complexity. These algorithms improve the bit error rate performance compared to user pairing and frequency allocation made by random selection. This scheme performs well when the number of users per group is two. Unfortunately, the computational complexity tends to increase when the number of users per group increases, and this problem has not been addressed in this paper. This paper has solved an extreme computational complexity which is provided by full search through implementing a sub-optimal algorithm by combining the Hungarian algorithm with Binary Switching algorithm. Two objective functions have been introduced, which are maximizing the capacity and minimizing the error rate. At first, the Hungarian algorithm is applied to allocate the best frequency carriers. Then, Binary Switching algorithm is applied to perform a single user swap in order to switch every user between groups. Even though this sub-optimal algorithm has solved the frequency allocation and user grouping method with low computational complexity, it is still considerably high especially when more users are incorporated in one group. This algorithm is suitable if the number of users per group is two but it becomes impractical when the number of users per group is more. The probability in performing the frequency allocation and user grouping will be extremely high while many other possibilities remain untested. The optimal number of user per group is not taken into account in their study and no concrete reason why two users per group is chosen. This paper does not also discuss more number of users per group and its >GET ANSWER